skip to main content
10.1145/1297231.1297239acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
Article

Complex-network theoretic clustering for identifying groups of similar listeners in p2p systems

Published:19 October 2007Publication History

ABSTRACT

This article presents an approach to automatically create virtual communities of users with similar music preferences in a distributed system. Our goal is to create personalized music channels for these communities using the content shared by its members in peer-to-peer networks for each community. To extract these communities a complex network theoretic approach is chosen. A fully connected graph of users is created using epidemic protocols. We show that the created graph sufficiently converges to a graph created with a centralized algorithm after a small number of protocol iterations. To find suitable techniques for creating user communities, we analyze graphs created from real-world recommender datasets and identify specific properties of these datasets. Based on these properties, different graph-based community-extraction techniques are chosen and evaluated. We select a technique that exploits identified properties to create clusters of music listeners. The suitability of this technique is validated using a music dataset and two large movie datasets. On a graph of 6,040 peers, the selected technique assigns at least 85% of the peers to optimal communities, and obtains a mean classification error of less than 0.05% over the remaining peers that are not assigned to the best community.

References

  1. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47--97, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. Anglade. Virtual communities for creating shared music channels. Master's thesis, Chalmers University of Technology, Goteborg, Sweden, 2007.Google ScholarGoogle Scholar
  3. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. of UAI, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. da F. Costa. Hub-based community Finding. arXiv:cond-mat/0405022, 2004.Google ScholarGoogle Scholar
  6. P. Erdős and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5:17--61, 1960.Google ScholarGoogle Scholar
  7. G. W. Flake, S. Lawrence, C. L. Giles, and F. M. Coetzee. Self-organization and identification of web communities. IEEE Computer, 35(3):66--71, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In Proc. Natl. Acad. Sci. USA, volume 99, pages 7821--7826, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  9. http://www.grouplens.org/.Google ScholarGoogle Scholar
  10. M. Jelasity and M. van Steen. Large-scale newscast computing on the internet. Technical Report IR-503, Vrije Universiteit, Amsterdam, 2002.Google ScholarGoogle Scholar
  11. http://www.mercora.com/.Google ScholarGoogle Scholar
  12. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 2004.Google ScholarGoogle Scholar
  13. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proc. of the Conference on Computer Supported Cooperative Work, pages 175--186, New York, 1994. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Wang, J. A. Pouwelse, J. Fokker, and M. Reinders. Personalization of a peer-to-peer television system. In Proc. of EuroITV 2006, Athens, 2006.Google ScholarGoogle Scholar
  15. D. Watts. Six Degrees: The Science of a Connected Age. Norton, 2003.Google ScholarGoogle Scholar
  16. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440--442, 1998.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Complex-network theoretic clustering for identifying groups of similar listeners in p2p systems

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              RecSys '07: Proceedings of the 2007 ACM conference on Recommender systems
              October 2007
              222 pages
              ISBN:9781595937308
              DOI:10.1145/1297231

              Copyright © 2007 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 19 October 2007

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate254of1,295submissions,20%

              Upcoming Conference

              RecSys '24
              18th ACM Conference on Recommender Systems
              October 14 - 18, 2024
              Bari , Italy

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader