In: Journal of Informetrics, 2020, vol. 14, no. 3, p. 101038
Evaluating scholars’ achievements is an important problem in the science of science with applications in the evaluation of grant proposals and promotion applications. Since the number of scholars and the number of scholarly outputs grow exponentially with time, well-designed ranking metrics that have the potential to assist in these tasks are of prime importance. To rank scholars, it is...
|
In: PLoS ONE, 2011, vol. 6, no. 7, p. e20648
The study of the organization of social networks is important for the understanding of opinion formation, rumor spreading, and the emergence of trends and fashion. This paper reports empirical analysis of networks extracted from four leading sites with social functionality (Delicious, Flickr, Twitter and YouTube) and shows that they all display a scale-free leadership structure. To reproduce this...
|
In: Proceedings of the National Academy of Sciences of the USA - PNAS, 2010, vol. 107, no. 10, p. 4511-4515
Recommender systems use data on past user preferences to predict possible future likes and interests. A key challenge is that while the most useful individual recommendations are to be found among diverse niche objects, the most reliably accurate results are obtained by methods that recommend objects based on user or object similarity. In this paper we introduce a new algorithm specifically to...
|
In: New Journal of Physics, 2009, vol. 11, p. 123008
In this paper, based on a weighted projection of a bipartite user-object network, we introduce a personalized recommendation algorithm, called network-based inference (NBI), which has higher accuracy than the classical algorithm, namely collaborative filtering. In NBI, the correlation resulting from a specific attribute may be repeatedly counted in the cumulative recommendations from different...
|
In: The European Physical Journal B, 2009, vol. 71, no. 4, p. 623-630
Missing link prediction in networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate a simple framework of link prediction on the basis of node similarity. We compare nine well- known local similarity measures on six real networks. The results indicate that the simplest measure, namely Common Neighbours, has the best...
|
In: The European Physical Journal B, 2009, vol. 71, no. 4, p. 623-630
|
In: Europhysics Letters, 2008, vol. 81, no. 5, p. 58004
In this paper, based on a weighted object network, we propose a recommendation algorithm, which is sensitive to the configuration of initial resource distribution. Even under the simplest case with binary resource, the current algorithm has remarkably higher accuracy than the widely applied global ranking method and collaborative filtering. Furthermore, we introduce a free parameter β to...
|
In: Physical Review E, 2007, vol. 76, no. 4, p. 046115
One-mode projecting is extensively used to compress bipartite networks. Since one-mode projection is always less informative than the bipartite representation, a proper weighting method is required to better retain the original information. In this article, inspired by the network-based resource-allocation dynamics, we raise a weighting method which can be directly applied in extracting the...
|
In: IEEE Access, 2019, vol. 7, p. 184145–184159
Community structure discovery can help us better understand the capabilities and functions of the network. However, many existing methods have failed to identify nodes in communities accurately. In this paper, we proposed a heuristic community detection method based on node similarities that are computed by assigning different edge weight influence factors based on different neighbor types of...
|
In: International Journal of Modern Physics C, 2020, vol. 31, no. 04, p. 2050056
Community division in complex networks has become one of the hot topics in the field of network science. Most of the methods developed based on network topology ignore the dynamic characteristics underlying the structure. By exploring the diffusion process in the network based on random walk, this paper sums up the general rule with temporal characteristics as a temporary local balancing...
|
