{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:54:02Z","timestamp":1791323642592,"version":"4.3.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,5]]},"abstract":"<jats:p>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.<\/jats:p>\n                  <jats:p>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.<\/jats:p>","DOI":"10.14778\/2311906.2311916","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T08:17:57Z","timestamp":1403597877000},"page":"896-907","source":"Crossref","is-referenced-by-count":232,"title":["Challenging the long tail recommendation"],"prefix":"10.14778","volume":"5","author":[{"given":"Hongzhi","family":"Yin","sequence":"first","affiliation":[{"name":"Peking University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junjie","family":"Yao","sequence":"additional","affiliation":[{"name":"Peking University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"Peking University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557029"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718499"},{"key":"e_1_2_1_3_1","volume-title":"Hyperion","author":"Anderson C.","year":"2006","unstructured":"C. Anderson . The Long Tail: Why the Futhure of Business is Selling Less of More . Hyperion , 2006 . C. Anderson. The Long Tail: Why the Futhure of Business is Selling Less of More. Hyperion, 2006."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.2"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526801"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864721"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250939"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2005.9"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307752101"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989421"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020443909834"},{"key":"e_1_2_1_13_1","volume-title":"Finite Markov Chains","author":"Kemeny J. G.","year":"1976","unstructured":"J. G. Kemeny and J. L. Snell . Finite Markov Chains . Springer-Verlag , 1976 . J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer-Verlag, 1976."},{"key":"e_1_2_1_14_1","volume-title":"Cambridge University Press","author":"Norris J.","year":"1997","unstructured":"J. Norris . Markov Chains . Cambridge University Press , 1997 . J. Norris. Markov Chains. Cambridge University Press, 1997."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1894049.1894098"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639726"},{"key":"e_1_2_1_18_1","volume-title":"Random walks on graphs: A survey","author":"Lovsz L.","year":"1993","unstructured":"L. Lovsz . Random walks on graphs: A survey , 1993 . L. Lovsz. Random walks on graphs: A survey, 1993."},{"key":"e_1_2_1_19_1","volume-title":"AAAI","author":"Ma H.","year":"2010","unstructured":"H. Ma , M. R. Lyu , and I. King . Diversifying query suggestion results . In AAAI , 2010 . H. Ma, M. R. Lyu, and I. King. Diversifying query suggestion results. In AAAI, 2010."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009050"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1125451.1125659"},{"key":"e_1_2_1_22_1","unstructured":"D. Oktar. Recommendation Systems: Increasing Profit by Long Tail. http:\/\/en.webrazzi.com\/2009\/09\/18\/.  D. Oktar. Recommendation Systems: Increasing Profit by Long Tail . http:\/\/en.webrazzi.com\/2009\/09\/18\/."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557093"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807179"},{"key":"e_1_2_1_25_1","volume-title":"Recommender Systems Handbook","author":"Ricci F.","year":"2010","unstructured":"F. Ricci , L. Rokach , B. Shapira , and P. B. Kantor . Recommender Systems Handbook . Springer-Verlag New York, Inc. , 2010 . F. Ricci, L. Rokach, B. Shapira, and P. B. Kantor. Recommender Systems Handbook. Springer-Verlag New York, Inc., 2010."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1951.tb01366.x"},{"key":"e_1_2_1_27_1","volume-title":"Stochastic processes","author":"Ross S.","year":"1996","unstructured":"S. Ross . Stochastic processes , 2 nd ed, 1996 . S. Ross. Stochastic processes, 2nd ed, 1996.","edition":"2"},{"key":"e_1_2_1_28_1","volume-title":"Probabilistic Topic Models","author":"Steyvers M.","year":"2007","unstructured":"M. Steyvers and T. Griffiths . Probabilistic Topic Models . Lawrence Erlbaum Associates , 2007 . M. Steyvers and T. Griffiths. Probabilistic Topic Models. Lawrence Erlbaum Associates, 2007."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.133"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2311906.2311916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T05:29:30Z","timestamp":1672205370000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2311906.2311916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":29,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["10.14778\/2311906.2311916"],"URL":"https:\/\/doi.org\/10.14778\/2311906.2311916","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}