Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3038912.3052585acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Learning to Recommend Accurate and Diverse Items

Published: 03 April 2017 Publication History

Abstract

In this study, we investigate diversified recommendation problem by supervised learning, seeking significant improvement in diversity while maintaining accuracy. In particular, we regard each user as a training instance, and heuristically choose a subset of accurate and diverse items as ground-truth for each user. We then represent each user or item as a vector resulted from the factorization of the user-item rating matrix. In our paper, we try to discover a factorization for matching the following supervised learning task. In doing this, we define two coupled optimization problems, parameterized matrix factorization and structural learning, to formulate our task. And we propose a diversified collaborative filtering algorithm (DCF) to solve the coupled problems. We also introduce a new pairwise accuracy metric and a normalized topic coverage diversity metric to measure the performance of accuracy and diversity respectively. Extensive experiments on benchmark datasets show the performance gains of DCF in comparison with the state-of-the-art algorithms.

References

[1]
G. Adomavicius and Y. Kwon. Maximizing aggregate recommendation diversity: A graph-theoretic approach. In DiveRS, pages 3--10, 2011.
[2]
G. Adomavicius and Y. Kwon. Improving aggregate recommendation diversity using ranking-based techniques. IEEE Trans. Knowl. Data Eng., 24(5):896--911, 2012.
[3]
G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Eng., 17(6):734--749, 2005.
[4]
A. Ashkan, B. Kveton, S. Berkovsky, and Z. Wen. Optimal greedy diversity for recommendation. In IJCAI, pages 1742--1748, 2015.
[5]
R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, Boston, MA, USA, 1999.
[6]
E. Brynjolfsson, Y. Hu, and M. D. Smith. Research commentary--long tails vs. superstars: The effect of information technology on product variety and sales concentration patterns. Info. Sys. Res., 21(4):736--747, 2010.
[7]
P. Chandar and B. Carterette. Preference based evaluation measures for novelty and diversity. In SIGIR, pages 413--422, 2013.
[8]
C. L.A. Clarke, M. Kolla, G. V. Cormack, O. Vechtomova, A. Ashkan, S. Büttcher, and I. MacKinnon. Novelty and diversity in information retrieval evaluation. In SIGIR, pages 659--666, 2008.
[9]
C. Cui, J. Ma, T. Lian, Z. Chen, and S. Wang. Improving image annotation via ranking-oriented neighbor search and learning-based keyword propagation. J. Assoc. Inf. Sci. Technol., 66(1):82--98, 2015.
[10]
C. Cui, J. Ma, S. Wang, S. Gao, and T. Lian. Semantically coherent image annotation with a learning-based keyword propagation strategy. In CIKM, pages 2423--2426, 2012.
[11]
U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634--652, 1998.
[12]
D. S. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing, Boston, MA, USA, 1997.
[13]
S. Huang, S. Wang, T.-Y. Liu, J. Ma, Z. Chen, and J. Veijalainen. Listwise collaborative filtering. In SIGIR, pages 343--352, 2015.
[14]
K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst., 20(4):422--446, 2002.
[15]
T. Joachims, T. Finley, and C. Yu. Cutting-plane training of structural svms. Mach. Learn., 77(1):27--59, 2009.
[16]
J. E Kelley, Jr. The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math., 8(4):703--712, 1960.
[17]
S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Inf. Process. Lett., 70(1):39--45, 1999.
[18]
Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30--37, 2009.
[19]
G. Linden, B. Smith, and J. York. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Comput., 7(1):76--80, 2003.
[20]
S. M. McNee, J. Riedl, and J. A. Konstan. Being accurate is not enough: how accuracy metrics have hurt recommender systems. In CHI, pages 1097--1101, 2006.
[21]
G. Oestreicher-Singer and A. Sundararajan. Recommendation networks and the long tail of electronic commerce. MIS Q., 36(1):65--84, 2012.
[22]
K. Onuma, H. Tong, and C. Faloutsos. TANGENT: a novel, 'surprise me', recommendation algorithm. In KDD, pages 657--666, 2009.
[23]
S.P. Parambath, N. Usunier, and Y. Grandvalet. A coverage-based approach to recommendation diversity on similarity graph. In RecSys, pages 15--22, 2016.
[24]
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In WWW, pages 285--295, 2001.
[25]
Y. Shi, M. Larson, and A. Hanjalic. List-wise learning to rank with matrix factorization for collaborative filtering. In RecSys, pages 269--272, 2010.
[26]
I. Szpektor, Y. Maarek, and D. Pelleg. When relevance is not enough: promoting diversity and freshness in personalized question recommendation. In WWW, pages 1249--1260, 2013.
[27]
I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. J. Mach. Learn. Res., 6:1453--1484, 2005.
[28]
S. Vargas, L. Baltrunas, A. Karatzoglou, and P. Castells. Coverage, redundancy and size-awareness in genre diversity for recommender systems. In RecSys, pages 209--216, 2014.
[29]
S. Wang, J. Sun, B. J. Gao, and J. Ma. Adapting vector space model to ranking-based collaborative filtering. In CIKM, pages 1487--1491, 2012.
[30]
S. Wang, J. Sun, B. J. Gao, and J. Ma. Vsrank: A novel framework for ranking-based collaborative filtering. ACM Trans. Intell. Syst. Technol., 5(3):51:1--51:24, 2014.
[31]
M. Weimer, A. Karatzoglou, Q. V. Le, and A. J. Smola. CofiRank: Maximum margin matrix factorization for collaborative ranking. In NIPS, 2007.
[32]
L. Wu, Q. Liu, E. Chen, N.J. Yuan, G. Guo, and X. Xie. Relevance meets coverage: A unified framework to generate diversified recommendations. ACM TIST, 7(3):39, 2016.
[33]
Y. Yue and T. Joachims. Predicting diverse subsets using structural SVMs. In ICML, pages 1224--1231, 2008.
[34]
M. Zhang and N. Hurley. Avoiding monotony: improving the diversity of recommendation lists. In RecSys, pages 123--130, 2008.
[35]
C.-N. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In WWW, pages 22--32, 2005.

Cited By

View all
  • (2025)Diversified recommendation with weighted hypergraph embedding: Case study in musicNeurocomputing10.1016/j.neucom.2024.128905616(128905)Online publication date: Feb-2025
  • (2024)Retention Induced Bias in a Recommendation System with Heterogeneous UsersSSRN Electronic Journal10.2139/ssrn.4684539Online publication date: 2024
  • (2024)Diversity Matters: User-Centric Multi-Interest Learning for Conversational Movie RecommendationProceedings of the 32nd ACM International Conference on Multimedia10.1145/3664647.3680909(9515-9524)Online publication date: 28-Oct-2024
  • Show More Cited By

Index Terms

  1. Learning to Recommend Accurate and Diverse Items

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    WWW '17: Proceedings of the 26th International Conference on World Wide Web
    April 2017
    1678 pages
    ISBN:9781450349130

    Sponsors

    • IW3C2: International World Wide Web Conference Committee

    In-Cooperation

    Publisher

    International World Wide Web Conferences Steering Committee

    Republic and Canton of Geneva, Switzerland

    Publication History

    Published: 03 April 2017

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. collaborative filtering
    2. diversity
    3. recommender systems
    4. structural svm

    Qualifiers

    • Research-article

    Funding Sources

    • the Fundamental Research Funds of Shandong University
    • the Natural Science Foundation of Shandong province
    • the Natural Science Foundation of China
    • the National Science Foundation of United States
    • the Shandong Province Higher Educational Science and Technology Program

    Conference

    WWW '17
    Sponsor:
    • IW3C2

    Acceptance Rates

    WWW '17 Paper Acceptance Rate 164 of 966 submissions, 17%;
    Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)121
    • Downloads (Last 6 weeks)13
    Reflects downloads up to 22 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2025)Diversified recommendation with weighted hypergraph embedding: Case study in musicNeurocomputing10.1016/j.neucom.2024.128905616(128905)Online publication date: Feb-2025
    • (2024)Retention Induced Bias in a Recommendation System with Heterogeneous UsersSSRN Electronic Journal10.2139/ssrn.4684539Online publication date: 2024
    • (2024)Diversity Matters: User-Centric Multi-Interest Learning for Conversational Movie RecommendationProceedings of the 32nd ACM International Conference on Multimedia10.1145/3664647.3680909(9515-9524)Online publication date: 28-Oct-2024
    • (2024)Diversifying Sequential Recommendation with Retrospective and Prospective TransformersACM Transactions on Information Systems10.1145/365301642:5(1-37)Online publication date: 29-Apr-2024
    • (2024)Promoting Two-sided Fairness with Adaptive Weights for Providers and Customers in RecommendationProceedings of the 18th ACM Conference on Recommender Systems10.1145/3640457.3688169(918-923)Online publication date: 8-Oct-2024
    • (2024)Probabilistic Attention for Sequential RecommendationProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671733(1956-1967)Online publication date: 25-Aug-2024
    • (2024)Contextual Distillation Model for Diversified RecommendationProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671514(5307-5316)Online publication date: 25-Aug-2024
    • (2024)A Universal Sets-level Optimization Framework for Next Set RecommendationProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679610(1544-1554)Online publication date: 21-Oct-2024
    • (2024)Sparks of Surprise: Multi-objective Recommendations with Hierarchical Decision Transformers for Diversity, Novelty, and SerendipityProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679533(2358-2368)Online publication date: 21-Oct-2024
    • (2024)Knowledge Graph Context-Enhanced Diversified RecommendationProceedings of the 17th ACM International Conference on Web Search and Data Mining10.1145/3616855.3635803(462-471)Online publication date: 4-Mar-2024
    • 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

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media