Supporting social recommendations with activity-balanced clustering

  • Authors:
  • F. Maxwell Harper;Shilad Sen;Dan Frankowski

  • Affiliations:
  • University of Minnesota, Minneapolis, MN;University of Minnesota, Minneapolis, MN;University of Minnesota, Minneapolis, MN

  • Venue:
  • Proceedings of the 2007 ACM conference on Recommender systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.02

Visualization

Abstract

In support of social interaction and information sharing, online communities commonly provide interfaces for users to form or interact with groups. For example, a user of the social music recommendation site last.fm might join the "First Wave Punk" group to discuss his or her favorite band (The Clash) and listen to playlists generated by fellow fans. Clustering techniques provide the potential to automatically discover groups of users who appear to share interests. We explore this idea by describing algorithms for clustering users of an online community and automatically describing the resulting user groups. We designed these techniques for use in an online recommendation system with no pre-existing group functionality, which led us to develop an "activity-balanced clustering" algorithm that considers both user activity and user interests in forming clusters.