skip to main content
10.1145/1526709.1526801acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Collaborative filtering for orkut communities: discovery of user latent behavior

Published: 20 April 2009 Publication History

Abstract

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 community recommendations in order to meet more users. In this paper, we investigate two algorithms from very different domains and evaluate their effectiveness for personalized community recommendation. First is association rule mining (ARM), which discovers associations between sets of communities 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 recommendations 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 examples 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 and demonstrate our parallel implementation's scalability with varying numbers of machines.

References

[1]
Open source parallel lda. http://code.google.com/p/plda/.
[2]
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD conference, pages 207--216, 1993.
[3]
R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. of the 20th VLDB conference, pages 487--499, 1994.
[4]
D. M. Blei and M. I. Jordan. Modeling annotated data. In Proc. of the 26th ACM SIGIR conference, pages 127--134, New York, NY, USA, 2003.
[5]
D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, 3:993--1022, 2003.
[6]
J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. Communications of the ACM, 51(1):107--113, 2008.
[7]
T. L. Griffiths and M. Steyvers. Finding scientific topics. Proceedings of the National Academy Science, 101 (suppl. 1):5228--5235, April 2004.
[8]
W. Gropp, E. Lusk, and A. Skjellum. Using MPI-2: Advanced Features of the Message-Passing Interface. MIT Press, 1999.
[9]
J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53--87, 2004.
[10]
K. Jarvelin and J. Kekalainen. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 20(4):422--446, 2002.
[11]
Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In Proc. of the 14th ACM SIGKDD conference, pages 426--434, 2008.
[12]
H. Li, Y. Wang, D. Zhang, M. Zhang, and E. Y. Chang. Pfp: parallel fp-growth for query recommendation. In Proc. of the 2008 ACM RecSys conference, pages 107--114, 2008.
[13]
A. McCallum, A. Corrada-Emmanuel, and X. Wang. The author-recipient-topic model for topic and role discovery in social networks: Experiments with enron and academic email. Technical report, Computer Science, University of Massachusetts Amherst, 2004.
[14]
J. J. Sandvig, B. Mobasher, and R. Burke. Robustness of collaborative recommendation based on association rule mining. In Proc. of the 2007 ACM Recommender Systems conference, pages 105--112, New York, NY, USA, 2007. ACM.
[15]
M.-L. Shyu, C. Haruechaiyasak, S.-C. Chen, and N. Zhao. Collaborative filtering by mining association rules from user access sequences. In Proc. of the Web Information Retrieval and Integration workshop, pages 128--135, 2005.
[16]
M. Snir and S. Otto. MPI-The Complete Reference: The MPI Core. MIT Press, 1998.
[17]
E. Spertus, M. Sahami, and O. Buyukkokten. Evaluating similarity measures: a large-scale study in the orkut social network. In Proc. of the 11th ACM SIGKDD Conference, pages 678--684, 2005.
[18]
R. Srikant and R. Agrawal. Mining generalized association rules. Future Gener. Comput. Syst., 13(2-3):161--180, 1997.
[19]
M. Steyvers, P. Smyth, M. Rosen-Zvi, and T. Griffiths. Probabilistic author-topic models for information discovery. In Proc. of the 10th ACM SIGKDD Conference, pages 306--315, 2004.
[20]
R. Thakur, R. Rabenseinfer, and W. Gropp. Optimization of collective communication operations in MPICH. International Journal of High Performance Computing Applications, 19(1):49--66, 2005.

Cited By

View all
  • (2024)Community detection in social networks using machine learning: a systematic mapping studyKnowledge and Information Systems10.1007/s10115-024-02201-866:12(7205-7259)Online publication date: 12-Aug-2024
  • (2023)ezLDA: Efficient and Scalable LDA on GPUsIEEE Access10.1109/ACCESS.2023.331523911(100165-100179)Online publication date: 2023
  • (2023)Discrete limited attentional collaborative filtering for fast social recommendationEngineering Applications of Artificial Intelligence10.1016/j.engappai.2023.106437123:PCOnline publication date: 1-Aug-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW '09: Proceedings of the 18th international conference on World wide web
April 2009
1280 pages
ISBN:9781605584874
DOI:10.1145/1526709

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 April 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. association rule mining
  2. collaborative filtering
  3. data mining
  4. latent topic models
  5. recommender systems

Qualifiers

  • Research-article

Conference

WWW '09
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)13
  • Downloads (Last 6 weeks)1
Reflects downloads up to 28 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Community detection in social networks using machine learning: a systematic mapping studyKnowledge and Information Systems10.1007/s10115-024-02201-866:12(7205-7259)Online publication date: 12-Aug-2024
  • (2023)ezLDA: Efficient and Scalable LDA on GPUsIEEE Access10.1109/ACCESS.2023.331523911(100165-100179)Online publication date: 2023
  • (2023)Discrete limited attentional collaborative filtering for fast social recommendationEngineering Applications of Artificial Intelligence10.1016/j.engappai.2023.106437123:PCOnline publication date: 1-Aug-2023
  • (2022)Job offers recommender system based on virtual organizationsExpert Systems10.1111/exsy.1315241:2Online publication date: 28-Sep-2022
  • (2022)Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00265(2942-2955)Online publication date: May-2022
  • (2021)Sparse Trust Data MiningIEEE Transactions on Information Forensics and Security10.1109/TIFS.2021.310941216(4559-4573)Online publication date: 2021
  • (2020)Leveraging personality information to improve community recommendation in e‐learning platformsBritish Journal of Educational Technology10.1111/bjet.1301151:5(1711-1733)Online publication date: 6-Aug-2020
  • (2020)SaberLDA: Sparsity-Aware Learning of Topic Models on GPUsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2020.297970231:9(2112-2124)Online publication date: 1-Sep-2020
  • (2020)Collaborative Generative Hashing for Marketing and Fast Cold-Start RecommendationIEEE Intelligent Systems10.1109/MIS.2020.302519735:5(84-95)Online publication date: 1-Sep-2020
  • (2020)Behavior Analysis through Routine Cluster Discovery in Ubiquitous Sensor Data2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS48256.2020.9027377(267-274)Online publication date: Jan-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media