scispace - formally typeset
Journal ArticleDOI

Scalable Affiliation Recommendation using Auxiliary Networks

Reads0
Chats0
TLDR
This article shows that information from the friendship network can indeed be fruitfully exploited in making affiliation recommendations, and suggests two models of user-community affinity for the purpose of making affiliation recommendation: one based on graph proximity, and another using latent factors to model users and communities.
Abstract
Social network analysis has attracted increasing attention in recent years In many social networks, besides friendship links among users, the phenomenon of users associating themselves with groups or communities is common Thus, two networks exist simultaneously: the friendship network among users, and the affiliation network between users and groups In this article, we tackle the affiliation recommendation problem, where the task is to predict or suggest new affiliations between users and communities, given the current state of the friendship and affiliation networks More generally, affiliations need not be community affiliations---they can be a user’s taste, so affiliation recommendation algorithms have applications beyond community recommendation In this article, we show that information from the friendship network can indeed be fruitfully exploited in making affiliation recommendations Using a simple way of combining these networks, we suggest two models of user-community affinity for the purpose of making affiliation recommendations: one based on graph proximity, and another using latent factors to model users and communities We explore the affiliation recommendation algorithms suggested by these models and evaluate these algorithms on two real-world networks, Orkut and Youtube In doing so, we motivate and propose a way of evaluating recommenders, by measuring how good the top 50 recommendations are for the average user, and demonstrate the importance of choosing the right evaluation strategy The algorithms suggested by the graph proximity model turn out to be the most effective We also introduce scalable versions of these algorithms, and demonstrate their effectiveness This use of link prediction techniques for the purpose of affiliation recommendation is, to our knowledge, novel

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Collaborative Filtering beyond the User-Item Matrix: A Survey of the State of the Art and Future Challenges

TL;DR: A comprehensive introduction to a large body of research, more than 200 key references, is provided, with the aim of supporting the further development of recommender systems exploiting information beyond the U-I matrix.
Journal ArticleDOI

A survey of collaborative filtering based social recommender systems

TL;DR: This paper presents how social network information can be adopted by recommender systems as additional input for improved accuracy and surveys and compares several representative algorithms of collaborative filtering (CF) based socialRecommender systems.
Journal ArticleDOI

Clustering With Multi-Layer Graphs: A Spectral Perspective

TL;DR: This paper proposes two novel methods, which are based on a joint matrix factorization and a graph regularization framework respectively, to efficiently combine the spectrum of the multiple graph layers, namely the eigenvectors of the graph Laplacian matrices.
Proceedings ArticleDOI

Combining latent factor model with location features for event-based group recommendation

TL;DR: A method called Pairwise Tag enhAnced and featuRe-based Matrix factorIzation for Group recommendAtioN (PTARMIGAN), which considers location features, social features, and implicit patterns simultaneously in a unified model to provide better group recommendations.
Proceedings ArticleDOI

On top-k recommendation using social networks

TL;DR: This paper shows that the existing social-trust enhanced Matrix Factorization (MF) models can be tailored for top-k recommendation by including observed and missing ratings in their training objective functions, and proposes a Nearest Neighbor (NN) based top- k recommendation method that combines users' neighborhoods in the trust network with their neighborhood in the latent feature space.
References
More filters
Proceedings ArticleDOI

Maximizing the spread of influence through a social network

TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Journal ArticleDOI

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

TL;DR: This work presents a new coarsening heuristic (called heavy-edge heuristic) for which the size of the partition of the coarse graph is within a small factor of theSize of the final partition obtained after multilevel refinement, and presents a much faster variation of the Kernighan--Lin (KL) algorithm for refining during uncoarsening.
Journal ArticleDOI

Probabilistic latent semantic indexing

TL;DR: Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data.
Journal ArticleDOI

A new status index derived from sociometric analysis.

TL;DR: A new method of computation which takes into account who chooses as well as how many choose is presented, which introduces the concept of attenuation in influence transmitted through intermediaries.
Related Papers (5)