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

skip to main content
10.1145/2499178.2499186acmotherconferencesArticle/Chapter ViewAbstractPublication PagesictirConference Proceedingsconference-collections
research-article

Understanding Similarity Metrics in Neighbour-based Recommender Systems

Published: 29 September 2013 Publication History

Abstract

Neighbour-based collaborative filtering is a recommendation technique that provides meaningful and, usually, accurate recommendations. The method's success depends however critically upon the similarity metric used to find the most similar users (neighbours), the basis of the predictions made. In this paper, we explore twelve features that aim to explain why some user similarity metrics perform better than others. Specifically, we define two sets of features, a first one based on statistics computed over the distance distribution in the neighbourhood, and, a second one based on the nearest neighbour graph. Our experiments with a public dataset show that some of these features are able to correlate with the performance up to a 90%.

References

[1]
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. on Knowl. and Data Eng., 17(6):734--749, June 2005.
[2]
C. C. Aggarwal, J. L. Wolf, K.-L. Wu, and P. S. Yu. Horting hatches an egg: a new graph-theoretic approach to collaborative filtering. In the fifth ACM SIGKDD international conference, ECSCW'01, pages 201--212, New York, New York, USA, 1999. ACM Press.
[3]
A. Bellogín, P. Castells, and I. Cantador. Predicting the Performance of Recommender Systems: An Information Theoretic Approach. In ICTIR, volume 6931 of Lecture Notes in Computer Science, pages 27--39, Berlin, Heidelberg, 2011. Springer Berlin / Heidelberg.
[4]
K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is "nearest neighbor" meaningful? In C. Beeri and P. Buneman, editors, Database Theory - ICDT'99, volume 1540 of Lecture Notes in Computer Science, chapter 15, pages 217--235. Springer Berlin Heidelberg, Berlin, Heidelberg, Jan. 1999.
[5]
J. S. Breese, D. Heckerman, and C. Kadie. Empirical Analysis of Predictive Algorithms for Collaborative Filtering. In Proceedings of the 14th Annual Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 43--52, July 1998.
[6]
M. Clements, A. P. de Vries, J. A. Pouwelse, J. Wang, and M. J. T. Reinders. Evaluation of Neighbourhood Selection Methods in Decentralized Recommendation Systems. In Workshop on Large Scale Distributed Systems for Information Retrieval (LSDS-IR), 2007.
[7]
S. Cronen-Townsend, Y. Zhou, and W. B. Croft. Predicting query performance. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '02, pages 299--306, New York, NY, USA, 2002. ACM.
[8]
A. P. de Vries, N. Mamoulis, N. Nes, and M. L. Kersten. Efficient k-NN search on vertically decomposed data. In SIGMOD Conference, pages 322--333. ACM, 2002.
[9]
C. Desrosiers and G. Karypis. A Comprehensive Survey of Neighborhood-based Recommendation Methods. In Recommender Systems Handbook, chapter 4, pages 107--144. Springer, Boston, MA, 2011.
[10]
D. Eppstein, M. Paterson, and F. F. Yao. On nearest-neighbor graphs. Discrete & Computational Geometry, 17(3):263--282, 1997.
[11]
R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In SIGMOD Conference, pages 301--312, 2003.
[12]
H. Fang, T. Tao, and C. Zhai. Diagnostic Evaluation of Information Retrieval Models. ACM Trans. Inf. Syst., 29, Apr. 2011.
[13]
M. Fernández, D. Vallet, and P. Castells. Probabilistic Score Normalization for Rank Aggregation. In 28th European Conference on Information Retrieval (ECIR 2006), pages 553--556. Springer Verlag Lecture Notes in Computer Science, Vol. 3936, Apr. 2006.
[14]
M. Fernández, D. Vallet, and P. Castells. Using historical data to enhance rank aggregation. In SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pages 643--644, New York, NY, USA, Aug. 2006. ACM.
[15]
D. Goldberg, D. Nichols, B. M. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. Commun. ACM, 35(12):61--70, Dec. 1992.
[16]
C. Hauff, D. Kelly, and L. Azzopardi. A comparison of user and system query performance predictions. In Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM '10, pages 979--988, New York, NY, USA, 2010. ACM.
[17]
D. Heesch and S. Rüger. N Nk networks for Content-Based image retrieval. In Advances in Information Retrieval, volume 2997 of Lecture Notes in Computer Science, pages 253--266. Springer Berlin Heidelberg, 2004.
[18]
D. Heesch and S. Rüger. Image browsing: Semantic analysis of N Nk networks. In Image and Video Retrieval, volume 3568 of Lecture Notes in Computer Science, pages 609--618. Springer Berlin Heidelberg, 2005.
[19]
J. Herlocker, J. A. Konstan, and J. Riedl. An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms. Inf. Retr., 5(4):287--310, Oct. 2002.
[20]
J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '99, pages 230--237, New York, NY, USA, 1999. ACM.
[21]
A. Hinneburg, C. C. Aggarwal, and D. A. Keim. What is the nearest neighbor in high dimensional spaces? In VLDB, pages 506--515, 2000.
[22]
Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '08, pages 426--434, New York, NY, USA, 2008. ACM.
[23]
H. Ma, I. King, and M. R. Lyu. Effective missing data prediction for collaborative filtering. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '07, pages 39--46, New York, NY, USA, 2007. ACM.
[24]
M. O'Connor and J. Herlocker. Clustering items for collaborative filtering. In ACM SIGIR Workshop on Recommender Systems, 1999.
[25]
J. O'Donovan and B. Smyth. Trust in recommender systems. In Proceedings of the 10th international conference on Intelligent user interfaces, IUI '05, pages 167--174, New York, NY, USA, 2005. ACM.
[26]
P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In CSCW, pages 175--186, 1994.
[27]
U. Shardanand and P. Maes. Social information filtering: algorithms for automating "word of mouth". In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI '95, pages 210--217, New York, NY, USA, 1995. ACM Press/Addison-Wesley Publishing Co.
[28]
P. Symeonidis, A. Nanopoulos, A. Papadopoulos, and M. Y. Collaborative filtering : Fallacies and insights in measuring similarity. In Proceedings of the 10th PKDD Workshop on Web Mining (WEBMine'2006), pages 56--67, Berlin, 2006.
[29]
J. Wang, A. P. de Vries, and M. J. T. Reinders. Unified relevance models for rating prediction in collaborative filtering. ACM Trans. Inf. Syst., 26(3):1--42, June 2008.
[30]
D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440--442, June 1998.

Cited By

View all
  • (2023)Closed-Form Models of Accuracy Loss due to Subsampling in SVD Collaborative FilteringBig Data Mining and Analytics10.26599/BDMA.2022.90200246:1(72-84)Online publication date: Mar-2023
  • (2022)A Clustering-based model for the Generation of Diversified Recommendations2022 IEEE Silchar Subsection Conference (SILCON)10.1109/SILCON55242.2022.10028791(1-6)Online publication date: 4-Nov-2022
  • (2020)Employment Service System Based on Hybrid Recommendation AlgorithmBig Data Analytics for Cyber-Physical System in Smart City10.1007/978-981-33-4572-0_54(368-375)Online publication date: 18-Dec-2020
  • Show More Cited By

Index Terms

  1. Understanding Similarity Metrics in Neighbour-based Recommender Systems

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICTIR '13: Proceedings of the 2013 Conference on the Theory of Information Retrieval
    September 2013
    148 pages
    ISBN:9781450321075
    DOI:10.1145/2499178
    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 the author(s) 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].

    Sponsors

    • Findwise: Findwise AB
    • Google Inc.
    • Spinque: Spinque
    • Univ. of Copenhagen: University of Copenhagen
    • LARM: LARM Audio Research Archive
    • Royal School of Library and Information Science: Royal School of Library and Information Science
    • Yahoo! Labs

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 29 September 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Collaborative Filtering
    2. Neighbour selection
    3. Similarity metric

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    ICTIR '13
    Sponsor:
    • Findwise
    • Spinque
    • Univ. of Copenhagen
    • LARM
    • Royal School of Library and Information Science

    Acceptance Rates

    ICTIR '13 Paper Acceptance Rate 11 of 51 submissions, 22%;
    Overall Acceptance Rate 235 of 527 submissions, 45%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)9
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 16 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Closed-Form Models of Accuracy Loss due to Subsampling in SVD Collaborative FilteringBig Data Mining and Analytics10.26599/BDMA.2022.90200246:1(72-84)Online publication date: Mar-2023
    • (2022)A Clustering-based model for the Generation of Diversified Recommendations2022 IEEE Silchar Subsection Conference (SILCON)10.1109/SILCON55242.2022.10028791(1-6)Online publication date: 4-Nov-2022
    • (2020)Employment Service System Based on Hybrid Recommendation AlgorithmBig Data Analytics for Cyber-Physical System in Smart City10.1007/978-981-33-4572-0_54(368-375)Online publication date: 18-Dec-2020
    • (2018)Applying Subsequence Matching to Collaborative FilteringProceedings of the 5th Spanish Conference on Information Retrieval10.1145/3230599.3230605(1-2)Online publication date: 26-Jun-2018
    • (2018)Indiscriminateness in Representation Spaces of Terms and DocumentsAdvances in Information Retrieval10.1007/978-3-319-76941-7_19(251-262)Online publication date: 1-Mar-2018
    • (2018)Recommender Systems EvaluationEncyclopedia of Social Network Analysis and Mining10.1007/978-1-4939-7131-2_110162(2095-2112)Online publication date: 12-Jun-2018
    • (2017)Recommender Systems EvaluationEncyclopedia of Social Network Analysis and Mining10.1007/978-1-4614-7163-9_110162-1(1-18)Online publication date: 6-Jul-2017
    • (2016)Effect of Collaborative Recommender System ParametersAdvances in Artificial Intelligence10.1155/2016/93863682016(1)Online publication date: 1-Jun-2016
    • (2015)Extended feature combination model for recommendations in location-based mobile servicesKnowledge and Information Systems10.1007/s10115-014-0776-544:3(629-661)Online publication date: 1-Sep-2015
    • (2014)Using novelty score of unseen items to handle popularity bias in recommender systems2014 International Conference on Contemporary Computing and Informatics (IC3I)10.1109/IC3I.2014.7019608(934-939)Online publication date: Nov-2014

    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