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 paper, we introduce a modified collaborative filtering (MCF) algorithm, which has remarkably higher accuracy than the standard collaborative filtering. In the MCF, instead of the cosine similarity index, the user–user correlations are obtained by a diffusion process. Furthermore, by...

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

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

I analyze a bilateral bargaining model with one-sided uncertainty about time preferences. The uninformed player has the option of halting the bargaining process to obtain additional information, when it is his turn to offer. For a wide class of preference settings, the uninformed player does not...

We analyze a psychologically-based model of voter turnout. Potential voters experience regret if they fail to vote, which is the motivation for participation in voting. Regret from abstention is inversely related to the margin of victory. Voters on the winner's side experience less regret than...