The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Challenging the long tail recommendation
Open accessAbstract
The success of "infinite-inventory" retailers such as Amazon.com and Netflix has been largely attributed to a "long tail" phenomenon. Although the majority of their inventory is not in high demand, these niche products, unavailable at limited-inventory competitors, generate a significant fraction of total revenue in aggregate. In addition, tail product availability can boost head sales by offering consumers the convenience of "one-stop shopping" for both their mainstream and niche tastes. However, most of existing recommender systems, especially collaborative filter based methods, can not recommend tail products due to the data sparsity issue. It has been widely acknowledged that to recommend popular products is easier yet more trivial while to recommend long tail products adds more novelty yet it is also a more challenging task. In this paper, we propose a novel suite of graph-based algorithms for the long tail recommendation. We first represent user-item information with undirected edge-weighted graph and investigate the theoretical foundation of applying Hitting Time algorithm for long tail item recommendation. To improve recommendation diversity and accuracy, we extend Hitting Time and propose efficient Absorbing Time algorithm to help users find their favorite long tail items. Finally, we refine the Absorbing Time algorithm and propose two entropy-biased Absorbing Cost algorithms to distinguish the variation on different user-item rating pairs, which further enhances the effectiveness of long tail recommendation. Empirical experiments on two real life datasets show that our proposed algorithms are effective to recommend long tail items and outperform state-of-the-art recommendation techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Blei, D. M. (2012) · Communications of the ACM · doi:10.1145/2133806.2133826 · Cited by 5,516 · cited 2×
“So we try to employ probabilistic topic model [28] to directly model users’ latent interests and tastes in this section.”
MethodFactorization meets the neighborhood: a multifaceted collaborative filtering model
Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852
Ross, S. M. (1982) · Cited by 3,812
(2011) · Springer eBooks · doi:10.1007/978-0-387-85820-3 · Cited by 3,761
The long tail: why the future of business is selling less of more
(2007) · Choice Reviews Online · doi:10.5860/choice.44-2783 · Cited by 2,869
Kemeny, J. G., & Snell, J. L. (1976) · Medical Entomology and Zoology · Cited by 2,813
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Random Walks on Graphs: A Survey
Lovász, L. (2001) · Cited by 1,411
Performance of recommender algorithms on top-n recommendation tasks
Cremonesi, P., Koren, Y., & Turrin, R. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864721 · Cited by 1,410
University Press, C. (2021) · doi:10.26226/morressier.60c8d83cbea1445efd9a1905 · Cited by 1,215
Being accurate is not enough: how accuracy metrics have hurt recommender systems
McNee, S. M., Riedl, J., & Konstan, J. A. (2006) · CHI '06 Extended Abstracts on Human Factors in Computing Systems · doi:10.1145/1125451.1125659 · Cited by 1,066
Steyvers, M., & Griffiths, T. (2015) · Handbook of Latent Semantic Analysis · doi:10.4324/9780203936399.ch21 · Cited by 1,011
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms
Herlocker, J., Konstan, J. A., & Riedl, J. (2002) · Information Retrieval · doi:10.1023/a:1020443909834 · Cited by 658
Regression-based latent factor models
Agarwal, D., & Chen, B.-C. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557029 · Cited by 514
Latent dirichlet allocation for tag recommendation
Krestel, R., Fankhauser, P., & Nejdl, W. (2009) · Proceedings of the third ACM conference on Recommender systems · doi:10.1145/1639714.1639726 · Cited by 494
A collaborative filtering algorithm and evaluation metric that accurately model the user experience
McLaughlin, M. R., & Herlocker, J. L. (2004) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1008992.1009050 · Cited by 387
fLDA: matrix factorization through latent dirichlet allocation
Agarwal, D., & Chen, B.-C. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718499 · Cited by 256
Göbel, F., & Jagers, A. A. (1974) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(74)90001-5 · Cited by 246
Collaborative filtering for orkut communities: discovery of user latent behavior
Chen, W.-Y., Chu, J.-C., Luan, J., Bai, H., Wang, Y., & Chang, E. Y. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526801 · Cited by 168
Recommender systems and their impact on sales diversity
Fleder, D. M., & Hosanagar, K. (2007) · Proceedings of the 8th ACM conference on Electronic commerce · doi:10.1145/1250910.1250939 · Cited by 167
TANGENT: a novel, 'Surprise me', recommendation algorithm
Onuma, K., Tong, H., & Faloutsos, C. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557093 · Cited by 135
A random walks perspective on maximizing satisfaction and profit
Brand, M. (2005) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.2 · Cited by 101
Fouss, F., Pirotte, A., & Saerens, M. (2005) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2005.9 · Cited by 90
Fouss, F., Pirotte, A., Saerens, M., Renders, J.-M., & Yen, L. (2006) · DIAL (Catholic University of Leuven) · Cited by 24
Fouss, F., Pirotte, A., & Saerens, M. (2004) · Cited by 23
Soft-Constraint Based Online LDA for Community Recommendation
Kang, Y., & Yu, N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15696-0_46 · Cited by 10
Cited by
Artificial intelligence in recommender systems
Zhang, Q., Lu, J., & Jin, Y. (2021) · Complex & Intelligent Systems · doi:10.1007/s40747-020-00212-w · Cited by 450
Self-supervised learning for recommender systems: A survey
Yu, J., Yin, H., Xia, X., Chen, T., Li, J., & Huang, Z. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3282907 · Cited by 413
“Meanwhile,recommendersystemsencounteruniquechallenges suchashighly-skeweddatadistribution[38],widelyobserved biases[39],andlarge-vocabularycategoricalfeatures[2],which providesoilfornew-typeSSLandhavespurredaseriesof distinctSSRmethodsthatcanenrichtheSSLfamily.”
Self-citationLCARS: a location-content-aware recommender system
Yin, H., Sun, Y., Cui, B., Hu, Z., & Chen, L. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487608 · Cited by 331
Self-citationXSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendation
Yu, J., Xia, X., Chen, T., Cui, L., Hung, N. Q. V., & Yin, H. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3288135 · Cited by 322
Self-citationBeyond Globally Optimal: Focused Learning for Improved Recommendations
Beutel, A., Chi, E. H., Cheng, Z., Pham, H., & Anderson, J. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052713 · Cited by 73
“Recently, researchers have examined the cold-start problem using just ratings data [30, 39], but aren’t able to build on state-of-the-art CF methods.”
Background
Metadata
- Authors
- Yin, H., Cui, B., Li, J., Yao, J., & Chen, C.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2012-05
- Volume
- 5
- Issue
- 9
- Pages
- 896-907
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2140942692
- Cited by
- 283
- References
- 28
- FWCI
- 31.45
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.