396 research outputs found
Hybrid recommendation algorithm based on two roles of social tags
The past few years have witnessed the great success of a new family of paradigms, social tagging networks, which allows users to freely associate social tags to items and efficiently manage them. Thus it provides us a promising way to effectively find useful and interesting information. In this paper, we consider two typical roles of social tags: (i) an accessorial tool helping users organize items; (ii) a bridge that connects users and items. We then propose a hybrid algorithm to integrate the two different roles to obtain better recommendation performance. Experimental results on a real-world data set, Del.icio.us, shows that it can significantly enhance both the algorithmic accuracy and diversity
Solving the Cold-Start Problem in Recommender Systems with Social Tags
In this paper, based on the user-tag-object tripartite graphs, we propose a
recommendation algorithm, which considers social tags as an important role for
information retrieval. Besides its low cost of computational time, the
experiment results of two real-world data sets, \emph{Del.icio.us} and
\emph{MovieLens}, show it can enhance the algorithmic accuracy and diversity.
Especially, it can obtain more personalized recommendation results when users
have diverse topics of tags. In addition, the numerical results on the
dependence of algorithmic accuracy indicates that the proposed algorithm is
particularly effective for small degree objects, which reminds us of the
well-known \emph{cold-start} problem in recommender systems. Further empirical
study shows that the proposed algorithm can significantly solve this problem in
social tagging systems with heterogeneous object degree distributions
Domain wall brane in a reduced Born-Infeld- theory
The Born-Infeld theory is reduced from the Born-Infeld determinantal
gravity in Weitzenb\"ock spacetime. We investigate a braneworld scenario in
this theory and obtain an analytic domain wall solution by utilizing the
first-order formalism. The model is stable against the linear tensor
perturbation. It is shown that the massless graviton is localized on the brane,
but the continuous massive gravitons are non-localized and will generate a tiny
correction with the behavior of to the Newtonian potential.
The four-dimensional teleparallel gravity is recovered as an effective infrared
theory on the brane. As a physical application, we consider the
(quasi-)localization property of spin-1/2 Dirac fermion in this model.Comment: 9 pages, 2 figures, published versio
Emergence of Blind Areas in Information Spreading
Recently, contagion-based (disease, information, etc.) spreading on social
networks has been extensively studied. In this paper, other than traditional
full interaction, we propose a partial interaction based spreading model,
considering that the informed individuals would transmit information to only a
certain fraction of their neighbors due to the transmission ability in
real-world social networks. Simulation results on three representative networks
(BA, ER, WS) indicate that the spreading efficiency is highly correlated with
the network heterogeneity. In addition, a special phenomenon, namely
\emph{Information Blind Areas} where the network is separated by several
information-unreachable clusters, will emerge from the spreading process.
Furthermore, we also find that the size distribution of such information blind
areas obeys power-law-like distribution, which has very similar exponent with
that of site percolation. Detailed analyses show that the critical value is
decreasing along with the network heterogeneity for the spreading process,
which is complete the contrary to that of random selection. Moreover, the
critical value in the latter process is also larger that of the former for the
same network. Those findings might shed some lights in in-depth understanding
the effect of network properties on information spreading
Gravity Effects on Information Filtering and Network Evolving
In this paper, based on the gravity principle of classical physics, we
propose a tunable gravity-based model, which considers tag usage pattern to
weigh both the mass and distance of network nodes. We then apply this model in
solving the problems of information filtering and network evolving.
Experimental results on two real-world data sets, \emph{Del.icio.us} and
\emph{MovieLens}, show that it can not only enhance the algorithmic
performance, but can also better characterize the properties of real networks.
This work may shed some light on the in-depth understanding of the effect of
gravity model
Promoting cold-start items in recommender systems
As one of major challenges, cold-start problem plagues nearly all recommender
systems. In particular, new items will be overlooked, impeding the development
of new products online. Given limited resources, how to utilize the knowledge
of recommender systems and design efficient marketing strategy for new items is
extremely important. In this paper, we convert this ticklish issue into a clear
mathematical problem based on a bipartite network representation. Under the
most widely used algorithm in real e-commerce recommender systems, so-called
the item-based collaborative filtering, we show that to simply push new items
to active users is not a good strategy. To our surprise, experiments on real
recommender systems indicate that to connect new items with some less active
users will statistically yield better performance, namely these new items will
have more chance to appear in other users' recommendation lists. Further
analysis suggests that the disassortative nature of recommender systems
contributes to such observation. In a word, getting in-depth understanding on
recommender systems could pave the way for the owners to popularize their
cold-start products with low costs.Comment: 6 pages, 6 figure
- …