In: Europhysics Letters, 2011, vol. 96, no. 4, p. 48007
The common-neighbor–based method is simple yet effective to predict missing links, which assume that two nodes are more likely to be connected if they have more common neighbors. In the traditional method, each common neighbor of two nodes contributes equally to the connection likelihood. In this letter, we argue that different common neighbors may play different roles and thus contributes...
|
In: Physica A: Statistical Mechanics and its Applications, 2011, vol. 391, no. 4, p. 1777–1787
Identifying influential nodes that lead to faster and wider spreading in complex networks is of theoretical and practical significance. The degree centrality method is very simple but of little relevance. Global metrics such as betweenness centrality and closeness centrality can better identify influential nodes, but are incapable to be applied in large-scale networks due to the computational...
|
In: PLoS ONE, 2011, vol. 6, no. 6, p. e21202
Finding pertinent information is not limited to search engines. Online communities can amplify the influence of a small number of power users for the benefit of all other users. Users' information foraging in depth and breadth can be greatly enhanced by choosing suitable leaders. For instance in delicious.com, users subscribe to leaders' collection which lead to a deeper and wider reach not...
|
In: Physical Review E - statistical, non linear and soft matter physics, 2011, vol. 83, no. 5, p. 056123
Coarse-graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve statistical properties as well as the dynamic behaviors of the initial networks. Some methods have been proposed and found effective in undirected networks, while the study on coarse-graining directed networks lacks of consideration. In this paper we...
|
In: Physica A: Statistical Mechanics and its Applications, 2011, vol. 390, no. 23-24, p. 4486-4493
The explosive growth of information asks for advanced information filtering techniques to solve the so-called information overload problem. A promising way is the recommender system which analyzes the historical records of users’ activities and accordingly provides personalized recommendations. Most recommender systems can be represented by user-object bipartite networks where users can...
|
In: Physical Review E - Statistical Nonlinear, and Soft Matter Physics, 2011, vol. 83, no. 6, p. 066119
Recommender systems have shown great potential in addressing the information overload problem, namely helping users in finding interesting and relevant objects within a huge information space. Some physical dynamics, including the heat conduction process and mass or energy diffusion on networks, have recently found applications in personalized recommendation. Most of the previous studies focus...
|
In: International Journal of Modern Physics C, 2010, vol. 21, no. 6, p. 813-824
Two main difficulties in the problem of classification in partially labeled networks are the sparsity of the known labeled nodes and inconsistency of label information. To address these two difficulties, we propose a similarity-based method, where the basic assumption is that two nodes are more likely to be categorized into the same class if they are more similar. In this paper, we introduce ten...
|
In: Physics Procedia, 2010, vol. 3, no. 5, p. 1887-1896
Collaborative filtering is one of the most successful recommendation techniques, which can effectively predict the possible future likes of users based on their past preferences. The key problem of this method is how to define the similarity between users. A standard approach is using the correlation between the ratings that two users give to a set of objects, such as Cosine index and Pearson...
|
In: Europhysics Letters, 2010, vol. 90, no. 4, p. 48006
Understanding the structure and evolution of web-based user-object networks is a significant task since they play a crucial role in e-commerce nowadays. This letter reports the empirical analysis on two large-scale web sites, audioscrobbler.com (http://audioscrobbler.com/) and del.icio.us (http://del.icio.us/), where users are connected with music groups and bookmarks, respectively. The degree...
|
In: Europhysics Letters, 2010, vol. 89, no. 5, p. 58007
The problem of missing link prediction in complex networks has attracted much attention recently. Two difficulties in link prediction are the sparsity and huge size of the target networks. Therefore, to design an efficient and effective method is of both theoretical interest and practical significance. In this letter, we proposed a method based on local random walk, which can give competitively...
|