skip to main content
10.1145/1458082.1458325acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Collaborative partitioning with maximum user satisfaction

Published:26 October 2008Publication History

ABSTRACT

Our collaborative partitioning model posits a bicriteria objective in which we seek the best item clustering that satisfies the most users at the highest level of satisfaction. We consider two basic methods for determining user satisfaction. The first method is based on how well each user's preferences match a given partition, and the second method is based on average correlation scores taken over sufficiently large subpopulations of users. We show these problems are NP-Hard and develop a set of heuristic approaches for solving them. We provide lower bounds on the satisfaction level on random data, and error bounds in the planted partition model, which provide confidence levels for our heuristic methods. Finally, we present experiments on several real examples that demonstrate the effectiveness of our framework.

References

  1. F. Annexstein and S. Strunjas, Collaborative Partitioning with Maximum User Satisfaction, Univ. Cinti. Tech. Report 2008.Google ScholarGoogle Scholar
  2. Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation clustering, Machine Learning, 55(1-3),2004, pp. 89--113. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Condon and R.M. Karp, Algorithms for graph partitioning on the planted partition model, Random Structures and Algorithms, 18(2),p. 116--140, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. Joachims and J. Hopcroft, Error Bounds for Correlation Clustering, Proceedings of the International Conference on Machine Learning (ICML), 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chaitanya Swamy, Correlation clustering: maximizing agreements via semidefinite programming. In ACM-SIAM Symposium on Discrete algorithms, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. The Netflix Prize database, http://www.netflixprize.com/Google ScholarGoogle Scholar
  7. The StumbleUpon website: http://www.stumbleupon.com/Google ScholarGoogle Scholar

Index Terms

  1. Collaborative partitioning with maximum user satisfaction

      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
        CIKM '08: Proceedings of the 17th ACM conference on Information and knowledge management
        October 2008
        1562 pages
        ISBN:9781595939913
        DOI:10.1145/1458082

        Copyright © 2008 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: 26 October 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        Overall Acceptance Rate1,861of8,427submissions,22%

        Upcoming Conference

      • Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader