1,133 research outputs found
Recommender Systems
The ongoing rapid expansion of the Internet greatly increases the necessity
of effective recommender systems for filtering the abundant information.
Extensive research for recommender systems is conducted by a broad range of
communities including social and computer scientists, physicists, and
interdisciplinary researchers. Despite substantial theoretical and practical
achievements, unification and comparison of different approaches are lacking,
which impedes further advances. In this article, we review recent developments
in recommender systems and discuss the major challenges. We compare and
evaluate available algorithms and examine their roles in the future
developments. In addition to algorithms, physical aspects are described to
illustrate macroscopic behavior of recommender systems. Potential impacts and
future directions are discussed. We emphasize that recommendation has a great
scientific depth and combines diverse research fields which makes it of
interests for physicists as well as interdisciplinary researchers.Comment: 97 pages, 20 figures (To appear in Physics Reports
Inferring monopartite projections of bipartite networks: an entropy-based approach
Bipartite networks are currently regarded as providing a major insight into
the organization of many real-world systems, unveiling the mechanisms driving
the interactions occurring between distinct groups of nodes. One of the most
important issues encountered when modeling bipartite networks is devising a way
to obtain a (monopartite) projection on the layer of interest, which preserves
as much as possible the information encoded into the original bipartite
structure. In the present paper we propose an algorithm to obtain
statistically-validated projections of bipartite networks, according to which
any two nodes sharing a statistically-significant number of neighbors are
linked. Since assessing the statistical significance of nodes similarity
requires a proper statistical benchmark, here we consider a set of four null
models, defined within the exponential random graph framework. Our algorithm
outputs a matrix of link-specific p-values, from which a validated projection
is straightforwardly obtainable, upon running a multiple hypothesis testing
procedure. Finally, we test our method on an economic network (i.e. the
countries-products World Trade Web representation) and a social network (i.e.
MovieLens, collecting the users' ratings of a list of movies). In both cases
non-trivial communities are detected: while projecting the World Trade Web on
the countries layer reveals modules of similarly-industrialized nations,
projecting it on the products layer allows communities characterized by an
increasing level of complexity to be detected; in the second case, projecting
MovieLens on the films layer allows clusters of movies whose affinity cannot be
fully accounted for by genre similarity to be individuated.Comment: 16 pages, 9 figure
A Network Resource Allocation Recommendation Method with An Improved Similarity Measure
Recommender systems have been acknowledged as efficacious tools for managing
information overload. Nevertheless, conventional algorithms adopted in such
systems primarily emphasize precise recommendations and, consequently, overlook
other vital aspects like the coverage, diversity, and novelty of items. This
approach results in less exposure for long-tail items. In this paper, to
personalize the recommendations and allocate recommendation resources more
purposively, a method named PIM+RA is proposed. This method utilizes a
bipartite network that incorporates self-connecting edges and weights.
Furthermore, an improved Pearson correlation coefficient is employed for better
redistribution. The evaluation of PIM+RA demonstrates a significant enhancement
not only in accuracy but also in coverage, diversity, and novelty of the
recommendation. It leads to a better balance in recommendation frequency by
providing effective exposure to long-tail items, while allowing customized
parameters to adjust the recommendation list bias
- …