Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent lei-yang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent tao-sun.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent qiaozhu-mei.
- item-3 previous item-2.
- 1078 creator chin-wan-chung.
- 1078 creator jaimie-y-park.
- 1078 creator jungmin-lee.
- 1078 creator min-joong-lee.
- 1078 creator ryan-h-choi.
- 1078 type InProceedings.
- 1078 label "QUBE: a Quick algorithm for Updating BEtweenness centrality".
- 1078 sameAs 1078.
- 1078 abstract "The betweenness centrality of a vertex is defined as the number of shortest paths that go through the vertex, divided by the number of all shortest paths in a graph. Betweenness centrality is widely used in network analyses. Especially in a social network, the recursive computation of betweenness centrality of vertices is performed for the community detection and finding the influential user in the network. Since a social network graph is frequently updated, it is necessary to update the betweenness centrality efficiently. To the best of our knowledge, this is the first work that proposes an algorithm which updates the betweenness centrality of all vertices in a graph efficiently. When a graph is changed, betweenness centerality of all vertices should be recomputed from the scratch using all the vertices of the graph. In this paper, we propose a method that efficiently reduces the search space by finding a candidate set of vertices whose betweenness centrality can be updated and computes their betweenness centeralities using candidate vertices only. As the cost of calculating betweenness centrality mainly depends on the number of vertices to be considered, the proposed algorithm significantly reduces the cost of calculation. Experiments on large datasets show that our algorithm outperforms an adapted existing algorithm in updating the betweenness centrality of vertices.".
- 1078 hasAuthorList authorList.
- 1078 isPartOf proceedings.
- 1078 keyword "Algorithm".
- 1078 keyword "Betweenness centrality".
- 1078 keyword "Graph theory".
- 1078 title "QUBE: a Quick algorithm for Updating BEtweenness centrality".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent jungmin-lee.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent min-joong-lee.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent jaimie-y-park.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent ryan-h-choi.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent chin-wan-chung.
- item-5 previous item-4.
- 108 creator enhong-chen.
- 108 creator haiping-ma.
- 108 creator huanhuan-cao.
- 108 creator jilei-tian.
- 108 creator qiang-yang.
- 108 type InProceedings.
- 108 label "A Habit Mining Approach for Discovering Similar Mobile Users".
- 108 sameAs 108.
- 108 abstract "Discovering similar users with respect to their habits plays an important role in a wide range of applications, such as collaborative filtering for recommendation, user segmentation for market analysis, etc. Recently, the progressing ability to sense user context of smart mobile devices makes it possible to discover mobile users with similar habits by mining their habits from their mobile devices. However, though some researchers have proposed effective methods for mining user habits such as behavior pattern mining, how to leverage the mined results for discovering similar users remains less explored. To this end, we propose a novel approach for conquering the sparseness of behavior pattern space and thus make it possible to discover similar mobile users with respect to their habits by leveraging behavior pattern mining. To be specific, first, we normalize the raw context log of each user by transforming the location-based context data and user interaction records to more general representations. Second, we take advantage of a constraint-based Bayesian Matrix Factorization model for extracting the latent common habits among behavior patterns and then transforming behavior pattern vectors to the vectors of mined common habits which are in a much more dense space. The experiments conducted on real data sets show that our approach outperforms three baselines in terms of the effectiveness of discovering similar mobile users with respect to their habits.".
- 108 hasAuthorList authorList.
- 108 isPartOf proceedings.
- 108 keyword "Discover similar users".
- 108 keyword "habit mining".
- 108 keyword "mobile users".
- 108 title "A Habit Mining Approach for Discovering Similar Mobile Users".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent haiping-ma.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent huanhuan-cao.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent qiang-yang.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent enhong-chen.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent jilei-tian.
- item-5 previous item-4.
- 1105 creator jure-leskovec.
- 1105 creator robert-west.
- 1105 type InProceedings.
- 1105 label "Human Wayfinding in Information Networks".
- 1105 sameAs 1105.
- 1105 abstract "Navigating information spaces has become an essential part of our everyday lives, and in order to design efficient and user-friendly information systems, it is important to understand how humans navigate and find the information they are looking for. We perform a large-scale study of human wayfinding, in which, given a network of links between the concepts of Wikipedia, people play a game of finding a short path from a given start to a given target concept by following hyperlinks. What distinguishes our setup from other studies of human Web-browsing behavior is that in our case people navigate a graph of connections between concepts, and that the exact goal of the navigation is known ahead of time. We study more than 30,000 goal-directed human search paths and identify strategies people use when navigating information spaces. We find that human wayfinding, while mostly very efficient, differs from shortest paths in characteristic ways. Most subjects navigate through high-degree hubs in the early phase, while their search is guided by content features thereafter. We also observe a trade-off between simplicity and efficiency: conceptually simple solutions are more common but tend to be less efficient than more complex ones. Finally, we consider the task of predicting the target a user is trying to reach. We design a model and an efficient learning algorithm. Such predictive models of human wayfinding can be applied in intelligent browsing interfaces.".