{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T11:13:28Z","timestamp":1771586008751,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1016\/j.neucom.2014.09.082","type":"journal-article","created":{"date-parts":[[2015,2,24]],"date-time":"2015-02-24T14:52:12Z","timestamp":1424789532000},"page":"126-136","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":28,"special_numbering":"C","title":["Hierarchical Itemspace Rank: Exploiting hierarchy to alleviate sparsity in ranking-based recommendation"],"prefix":"10.1016","volume":"163","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-9853-0621","authenticated-orcid":false,"given":"Athanasios N.","family":"Nikolakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marianna A.","family":"Kouneli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Garofalakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2014.09.082_bib1","doi-asserted-by":"crossref","unstructured":"B. Sarwar, G. Karypis, J. Konstan, J. Riedl, Item-based collaborative filtering recommendation algorithms, in: Proceedings of the 10th International Conference on World Wide Web, WWW \u05f301, ACM, New York, NY, USA, 2001, pp. 285\u2013295. URL: https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/371920.372071.","DOI":"10.1145\/371920.372071"},{"key":"10.1016\/j.neucom.2014.09.082_bib2","series-title":"Recommender Systems Handbook","first-page":"107","article-title":"A comprehensive survey of neighborhood-based recommendation methods","author":"Desrosiers","year":"2011"},{"key":"10.1016\/j.neucom.2014.09.082_bib3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2013.03.012","article-title":"Recommender systems survey","volume":"46","author":"Bobadilla","year":"2013","journal-title":"Knowl.-Based Syst."},{"issue":"8","key":"10.1016\/j.neucom.2014.09.082_bib4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","article-title":"Matrix factorization techniques for recommender systems","volume":"42","author":"Koren","year":"2009","journal-title":"Computer"},{"key":"10.1016\/j.neucom.2014.09.082_bib5","series-title":"Recommender Systems Handbook","first-page":"145","article-title":"Advances in collaborative filtering","author":"Koren","year":"2011"},{"key":"10.1016\/j.neucom.2014.09.082_bib6","doi-asserted-by":"crossref","unstructured":"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 \u05f308, ACM, New York, NY, USA, 2008, pp. 426\u2013434. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/1401890.1401944.","DOI":"10.1145\/1401890.1401944"},{"key":"10.1016\/j.neucom.2014.09.082_bib7","doi-asserted-by":"crossref","unstructured":"S. Balakrishnan, S. Chopra, Collaborative ranking, in: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, WSDM \u05f312, ACM, New York, NY, USA, 2012, pp. 143\u2013152. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/2124295.2124314.","DOI":"10.1145\/2124295.2124314"},{"key":"10.1016\/j.neucom.2014.09.082_bib8","doi-asserted-by":"crossref","unstructured":"P. Cremonesi, Y. Koren, R. Turrin, Performance of recommender algorithms on top-n recommendation tasks, in: Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys \u05f310, ACM, 2010, pp. 39\u201346. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/1864708.1864721.","DOI":"10.1145\/1864708.1864721"},{"key":"10.1016\/j.neucom.2014.09.082_bib9","doi-asserted-by":"crossref","unstructured":"B.M. Marlin, R.S. Zemel, Collaborative prediction and ranking with non-random missing data, in: Proceedings of the Third ACM Conference on Recommender Systems, RecSys \u05f309, ACM, New York, NY, USA, 2009, pp. 5\u201312. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/1639714.1639717.","DOI":"10.1145\/1639714.1639717"},{"issue":"3","key":"10.1016\/j.neucom.2014.09.082_bib10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","article-title":"Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation","volume":"19","author":"Fouss","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2014.09.082_bib11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.neunet.2012.03.001","article-title":"An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification","volume":"31","author":"Fouss","year":"2012","journal-title":"Neural Netw."},{"key":"10.1016\/j.neucom.2014.09.082_bib12","doi-asserted-by":"crossref","unstructured":"Y. Koren, J. Sill, Ordrec: an ordinal model for predicting personalized item rating distributions, in: Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys \u05f311, ACM, New York, NY, USA, 2011, pp. 117\u2013124. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/2043932.2043956.","DOI":"10.1145\/2043932.2043956"},{"key":"10.1016\/j.neucom.2014.09.082_bib13","doi-asserted-by":"crossref","unstructured":"A.N. Nikolakopoulos, M. Kalantzi, J.D. Garofalakis, On the use of Lanczos vectors for efficient latent factor-based top-n recommendation, in: Proceedings of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS14), WIMS \u05f314, ACM, New York, NY, USA, 2014, pp. 28:1\u201328:6. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/2611040.2611078.","DOI":"10.1145\/2611040.2611078"},{"key":"10.1016\/j.neucom.2014.09.082_bib14","doi-asserted-by":"crossref","unstructured":"A. Freno, E. Trentin, M. Gori, Scalable pseudo-likelihood estimation in hybrid random fields, in: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u05f309, ACM, 2009, pp. 319\u2013328. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/1557019.1557059.","DOI":"10.1145\/1557019.1557059"},{"key":"10.1016\/j.neucom.2014.09.082_bib15","doi-asserted-by":"crossref","unstructured":"A. Freno, E. Trentin, Hybrid Random Fields\u2014A Scalable Approach to Structure and Parameter Learning in Probabilistic Graphical Models, vol. 15 of Intelligent Systems Reference Library, Springer, 2011.","DOI":"10.1007\/978-3-642-20308-4"},{"issue":"2\u20133","key":"10.1016\/j.neucom.2014.09.082_bib16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007413511361","article-title":"On the optimality of the simple Bayesian classifier under zero-one loss","volume":"29","author":"Domingos","year":"1997","journal-title":"Mach. Learn."},{"key":"10.1016\/j.neucom.2014.09.082_bib17","doi-asserted-by":"crossref","unstructured":"Y. Shi, A. Karatzoglou, L. Baltrunas, M. Larson, N. Oliver, A. Hanjalic, CLiMF: Learning to maximize reciprocal rank with collaborative less-is-more filtering, in: Proceedings of the Sixth ACM Conference on Recommender Systems, RecSys \u05f312, ACM, New York, NY, USA, 2012, pp. 139\u2013146. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/2365952.2365981.","DOI":"10.1145\/2365952.2365981"},{"key":"10.1016\/j.neucom.2014.09.082_bib18","first-page":"291","article-title":"Collaborative filtering recommender systems","volume":"vol. 4321","author":"Schafer","year":"2007"},{"issue":"6","key":"10.1016\/j.neucom.2014.09.082_bib19","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TKDE.2005.99","article-title":"Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions","volume":"17","author":"Adomavicius","year":"2005","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2014.09.082_bib20","doi-asserted-by":"crossref","unstructured":"H. Yildirim, M.S. Krishnamoorthy, A random walk method for alleviating the sparsity problem in collaborative filtering, in: Proceedings of the 2008 ACM Conference on Recommender Systems, RecSys \u05f308, ACM, 2008, pp. 131\u2013138. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/1454008.1454031.","DOI":"10.1145\/1454008.1454031"},{"key":"10.1016\/j.neucom.2014.09.082_bib21","unstructured":"M. Gori, A. Pucci, Itemrank: a random-walk based scoring algorithm for recommender engines, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI\u05f307, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2007, pp. 2766\u20132771. URL \u3008https:\/\/2.zoppoz.workers.dev:443\/http\/dl.acm.org\/citation.cfm?id=1625275.1625720\u3009."},{"issue":"9","key":"10.1016\/j.neucom.2014.09.082_bib22","first-page":"1505","article-title":"The matrix-forest theorem and measuring relations in small social groups","volume":"58","author":"Chebotarev","year":"1997","journal-title":"Autom. Remote Control"},{"issue":"1","key":"10.1016\/j.neucom.2014.09.082_bib23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"10.1016\/j.neucom.2014.09.082_bib24","first-page":"50","article-title":"A novel hierarchical approach to ranking-based collaborative filtering","volume":"vol. 384","author":"Nikolakopoulos","year":"2013"},{"key":"10.1016\/j.neucom.2014.09.082_bib25","doi-asserted-by":"crossref","unstructured":"A.N. Nikolakopoulos, J.D. Garofalakis, NCDawareRank: a novel ranking method that exploits the decomposable structure of the web, in: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM \u05f313, ACM, New York, NY, USA, 2013, pp. 143\u2013152. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/2433396.2433415.","DOI":"10.1145\/2433396.2433415"},{"key":"10.1016\/j.neucom.2014.09.082_bib26","series-title":"Modern Information Retrieval","author":"Baeza-Yates","year":"2008"},{"key":"10.1016\/j.neucom.2014.09.082_bib27","series-title":"Recommender Systems Handbook","first-page":"257","article-title":"Evaluating recommendation systems","author":"Shani","year":"2011"},{"issue":"2","key":"10.1016\/j.neucom.2014.09.082_bib28","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/(SICI)1097-4571(199503)46:2<133::AID-ASI6>3.0.CO;2-Z","article-title":"Measuring retrieval effectiveness based on user preference of documents","volume":"46","author":"Yao","year":"1995","journal-title":"J. Am. Soc. Inf. Sci."},{"key":"10.1016\/j.neucom.2014.09.082_bib29","doi-asserted-by":"crossref","unstructured":"L. Zhang, C. Li, A novel recommending algorithm based on topical pagerank, in: Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence, AI \u05f308, Springer-Verlag, Berlin, Heidelberg, 2008, pp. 447\u2013453. URL https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1007\/978-3-540-89378-3_45.","DOI":"10.1007\/978-3-540-89378-3_45"},{"key":"10.1016\/j.neucom.2014.09.082_bib30","series-title":"Nonparametric Statistics for the Behavioral Sciences","author":"Siegel","year":"1988"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0925231215002180?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0925231215002180?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T02:35:34Z","timestamp":1566354934000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231215002180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":30,"alternative-id":["S0925231215002180"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.neucom.2014.09.082","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2015,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hierarchical Itemspace Rank: Exploiting hierarchy to alleviate sparsity in ranking-based recommendation","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.neucom.2014.09.082","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}