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.
- R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47--97, 2002.Google ScholarCross Ref
- A. Anglade. Virtual communities for creating shared music channels. Master's thesis, Chalmers University of Technology, Goteborg, Sweden, 2007.Google Scholar
- A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.Google ScholarCross Ref
- J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proc. of UAI, 1998. Google ScholarDigital Library
- L. da F. Costa. Hub-based community Finding. arXiv:cond-mat/0405022, 2004.Google Scholar
- P. Erdős and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5:17--61, 1960.Google Scholar
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- http://www.grouplens.org/.Google Scholar
- M. Jelasity and M. van Steen. Large-scale newscast computing on the internet. Technical Report IR-503, Vrije Universiteit, Amsterdam, 2002.Google Scholar
- http://www.mercora.com/.Google Scholar
- M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 2004.Google Scholar
- 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 ScholarDigital Library
- 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 Scholar
- D. Watts. Six Degrees: The Science of a Connected Age. Norton, 2003.Google Scholar
- D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440--442, 1998.Google ScholarCross Ref
Index Terms
- Complex-network theoretic clustering for identifying groups of similar listeners in p2p systems
Recommendations
Exploiting semantic clustering in the eDonkey P2P network
EW 11: Proceedings of the 11th workshop on ACM SIGOPS European workshopPeer-to-peer file sharing now represents a significant portion of the Internet traffic and has generated a lot of interest from the research community. Some recent measurements studies of peer-to-peer workloads have demonstrated the presence of semantic ...
Local Groups Online: Political Learning and Participation
Voluntary associations serve crucial roles in local communities and within our larger democratic society. They aggregate shared interests, collective will, and cultivate civic competencies that nurture democratic participation. People active in multiple ...
Identifying Overlying Group of People through Clustering
Folksonomies like Delicious and LastFm are modeled as multilateral user-resource-tag hypergraphs for studying their network properties. Detecting communities of similar nodes from such networks is a challenging problem. Most existing algorithms for ...
Comments