Collaborative Filtering for Orkut Communities: Discovery of User Latent Behavior

Presented at: 18th International World Wide Web Conference (WWW2009)

by Wen-Yen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie Bai, Yi Wang, Edward Y. Chang

Webpage: http://www2009.eprints.org/69/1/p681.pdf

Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over time, users have even greater need for effective commu- nity recommendations in order to meet more users. In this paper, we investigate two algorithms from very different do- mains and evaluate their effectiveness for personalized com- munity recommendation. First is association rule mining (ARM), which discovers associations between sets of com- munities that are shared across many users. Second is latent Dirichlet allocation (LDA), which models user-community co-occurrences using latent aspects. In comparing LDA with ARM, we are interested in discovering whether modeling low-rank latent structure is more effective for recommen- dations than directly mining rules from the observed data. We experiment on an Orkut data set consisting of 492, 104 users and 118, 002 communities. Our empirical comparisons using the top-k recommendations metric show that LDA performs consistently better than ARM for the community recommendation task when recommending a list of 4 or more communities. However, for recommendation lists of up to 3 communities, ARM is still a bit better. We analyze exam- ples of the latent information learned by LDA to explain this finding. To efficiently handle the large-scale data set, we parallelize LDA on distributed computers [1] and demon- strate our parallel implementation's scalability with varying numbers of machines.

Keywords: Social Networks and Web 2.0


Resource URI on the dog food server: http://data.semanticweb.org/conference/www/2009/paper/69


Explore this resource elsewhere: