In this Brief Report, we propose an index of user similarity, namely, the transferring similarity, which involves all high-order similarities between users. Accordingly, we design a modified collaborative filtering algorithm, which provides remarkably higher accurate predictions than the...

In this article, we proposed a susceptible-infected model with identical infectivity, in which, at every time step, each node can only contact a constant number of neighbors. We implemented this model on scale-free networks, and found that the infected population grows in an exponential form...

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...

In this paper, we propose a spreading activation approach for collaborative filtering (SACF). By using the opinion spreading process, the similarity between any users can be obtained. The algorithm has remarkably higher accuracy than the standard collaborative filtering using the Pearson...

Keywords in scientific articles have found their significance in information filtering and classification. In this article, we empirically investigated statistical characteristics and evolutionary properties of keywords in a very famous journal, namely Proceedings of the National Academy of...

In this paper, the relationship between the in-degree and out-degree of World-Wide Web is studies. At each time step, a new node with out-degree kout is added, where kout obeys the power-law distribution and its mean value is m. The analytical and simulation results suggest that the exponent of...

In this paper, under the constraint that the average distance and the average degree 〈k〉 remain approximately constant, we studied a random scale-free network model. We found that, if the network maintains the form of its degree distribution and the maximal degree k c is N-dependent cutoff...

Using the requisition papers of Chinese Nature Science Basic Research in management and information department, we construct the weighted network of research areas (WNRA). In WNRA, two research areas, which is represented by the subject codes, are considered to be connected if they have been...

In this paper, we studied the research areas of Chinese natural science basic research from a point view of complex network. Two research areas are considered to be connected if they appear in one fund proposal. The explicit network of such connections using data from 1999 to 2004 is...