Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 type ListItem.
- item-2 hasContent thanh-tran.
- item-2 previous item-1.
- 347 creator danish-contractor.
- 347 creator l-v-subramaniam.
- 347 creator mrinmaya-sachan.
- 347 creator tanveer-faruquie.
- 347 type InProceedings.
- 347 label "Using Content and Interactions for Discovering Communities in Social Networks".
- 347 sameAs 347.
- 347 abstract "In recent years, social networking sites have not only enabled people to connect with each other using social links but have also allowed them to share, communicate and interact over diverse geographical regions. Social network provide a rich source of heterogeneous data which can be exploited to discover previously unknown relationships and interests among groups of people. In this paper, we address the problem of discovering topically meaningful communities from a social network. We assume that a persons' membership in a community is conditioned on its social relationship, the type of interaction and the information communicated with other members of that community. We propose generative models that can discover communities based on the discussed topics, interaction types and the social connections among people. In our models a person can belong to multiple communities and a community can participate in multiple topics. This allows us to discover both community interests and user interests based on the information exchanged and linked associations. We demonstrate the effectiveness of our models on two real word data sets and show that it performs better than existing community discovery models.".
- 347 hasAuthorList authorList.
- 347 isPartOf proceedings.
- 347 keyword "Community Detection".
- 347 keyword "Probabilistic Methods".
- 347 keyword "Social Networks".
- 347 title "Using Content and Interactions for Discovering Communities in Social Networks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent mrinmaya-sachan.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent danish-contractor.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent tanveer-faruquie.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent l-v-subramaniam.
- item-4 previous item-3.
- 367 creator dhruv-mahajan.
- 367 creator sundararajan-sellamanickam.
- 367 creator vinod-nair.
- 367 type InProceedings.
- 367 label "A Unified Approach to Learning Task-Specific Bit Vector Representations for Fast, Nearest Neighbour Search".
- 367 sameAs 367.
- 367 abstract "Fast nearest neighbor search is necessary for large scale web-applications, such as information retrieval, classification and regression. Recently, a number of machine learning algorithms have been proposed for representing the data to be searched as (short) bit vectors and then using hashing to do rapid search. These algorithms have been limited in their applicability in that they are suited for one type of task -- e.g. Spectral Hashing learns bit vector representations for retrieval, but not say, classification. In this paper we present a unified approach to learning bit vector representations for many applications that use nearest neighbor search. The main contribution is a single learning algorithm that can be customized to learn bit vector representation suited for the task at hand. This broadens the usefulness of bit vector representations to tasks beyond just conventional retrieval. We propose a learning-to-rank formulation to learn the bit vector representation of the data. RankNet and LambdaRank algorithms are used for learning a function that computes a task-specific bit vector from an input data vector. Our algorithm outperforms state-of-the-art nearest neighbor methods on a number of real world text and image classification and retrieval datasets. It is scalable and learns a 32-bit representation on 1.46 million training cases in a day.".
- 367 hasAuthorList authorList.
- 367 isPartOf proceedings.
- 367 keyword "Classification".
- 367 keyword "Fast Nearest Neighbor Search".
- 367 keyword "Hashing".
- 367 keyword "Lambdarank".
- 367 keyword "Learning".
- 367 keyword "Ranknet".
- 367 keyword "Retrieval".
- 367 title "A Unified Approach to Learning Task-Specific Bit Vector Representations for Fast, Nearest Neighbour Search".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent vinod-nair.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent dhruv-mahajan.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent sundararajan-sellamanickam.
- item-3 previous item-2.
- 370 creator ivica-crnkovic.
- 370 creator jan-carlson.
- 370 creator josip-maras.
- 370 type InProceedings.
- 370 label "Extracting Client-side Web Application code".
- 370 sameAs 370.
- 370 abstract "The web application domain is one of the fastest growing and most wide-spread application domains today. By utilizing fast, modern web browsers and advanced scripting techniques, web developers are developing highly interactive applications that can, in terms of user-experience and responsiveness, compete with standard desktop applications. A web application is composed of two equally important parts: the server-side and the client-side. The client-side acts as an user-interface to the application, and can be viewed as a collection of behaviors. Similar behaviors are often used in a large number of applications, and facilitating their reuse oers considerable benets. However, due to client-side specics (e.g. multi-language implementation, extreme dynamicity), identifying and extracting code responsible for a certain behavior is dicult. In this paper we present a method for extracting client-side web application code implementing a certain behavior. We show how by analyzing the execution of a usage scenario, code responsible for a certain behavior can be identied, how dependencies between dierent parts of the application can be tracked, and how in the end only the code responsible for a certain behavior can be extracted. Our evaluation shows that the method is capable of extracting stand-alone behaviors, while achieving considerable savings in terms of code size and application performance.".
- 370 hasAuthorList authorList.
- 370 isPartOf proceedings.
- 370 keyword "Code Extraction".
- 370 keyword "Reuse".
- 370 keyword "Slicing".
- 370 keyword "Web applications".
- 370 title "Extracting Client-side Web Application code".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent josip-maras.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jan-carlson.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ivica-crnkovic.