{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:20:24Z","timestamp":1777890024984,"version":"3.51.4"},"reference-count":49,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["WEB"],"published-print":{"date-parts":[[2015,11,18]]},"DOI":"10.3233\/web-150324","type":"journal-article","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T08:47:14Z","timestamp":1448354834000},"page":"247-265","source":"Crossref","is-referenced-by-count":3,"title":["Top-N recommendations in the presence of\u00a0sparsity: An NCD-based approach"],"prefix":"10.1177","volume":"13","author":[{"given":"Athanasios N.","family":"Nikolakopoulos","sequence":"first","affiliation":[{"name":"Department of Computer Engineering and Informatics, University of Patras, Panepistimioupoli, GR26500,\u00a0Rio,\u00a0Greece. E-mail:\u00a0nikolako@ceid.upatras.gr"},{"name":"Computer Technology Institute and Press \u201cDiophantus\u201d, Panepistimioupoli, GR26504, Rio, Greece. E-mail:\u00a0garofala@ceid.upatras.gr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Garofalakis","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Informatics, University of Patras, Panepistimioupoli, GR26500,\u00a0Rio,\u00a0Greece. E-mail:\u00a0nikolako@ceid.upatras.gr"},{"name":"Computer Technology Institute and Press \u201cDiophantus\u201d, Panepistimioupoli, GR26504, Rio, Greece. E-mail:\u00a0garofala@ceid.upatras.gr"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/WEB-150324_ref1","unstructured":"[1]C.\u00a0Anderson, The Long Tail: Why the Future of Business Is Selling Less of More, Hyperion, 2006."},{"issue":"4","key":"10.3233\/WEB-150324_ref2","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/15427951.2006.10129134","article-title":"Generic damping functions for propagating importance in link-based ranking","volume":"3","author":"Baeza-Yates","year":"2006","journal-title":"Internet Mathematics"},{"key":"10.3233\/WEB-150324_ref3","unstructured":"[3]R.\u00a0Baeza-Yates and B.\u00a0Ribeiro-Neto, Modern Information Retrieval, 2nd edn, Addison-Wesley Publishing Company, USA, 2008."},{"issue":"1","key":"10.3233\/WEB-150324_ref4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/04060593X","article-title":"Augmented implicitly restarted Lanczos bidiagonalization methods","volume":"27","author":"Baglama","year":"2005","journal-title":"SIAM Journal on Scientific Computing"},{"key":"10.3233\/WEB-150324_ref5","doi-asserted-by":"crossref","unstructured":"[5]S.\u00a0Balakrishnan and S.\u00a0Chopra, Collaborative ranking, in: Proc. of the Fifth ACM International Conference on Web Search and Data Mining (WSDM\u201912), ACM, New York, NY, USA, 2012, pp.\u00a0143\u2013152.","DOI":"10.1145\/2124295.2124314"},{"key":"10.3233\/WEB-150324_ref6","doi-asserted-by":"crossref","unstructured":"[6]J.\u00a0Ben Schafer, J.\u00a0Konstan and J.\u00a0Riedl, Recommender systems in e-commerce, in: Proc. of the 1st ACM Conference on Electronic Commerce (EC\u201999), ACM, New York, NY, USA, 1999, pp.\u00a0158\u2013166.","DOI":"10.1145\/336992.337035"},{"key":"10.3233\/WEB-150324_ref7","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":"Knowledge-Based Systems"},{"issue":"5","key":"10.3233\/WEB-150324_ref8","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TPDS.2010.119","article-title":"Site-based partitioning and repartitioning techniques for parallel pagerank computation","volume":"22","author":"Cevahir","year":"2011","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"10.3233\/WEB-150324_ref9","first-page":"1505","article-title":"The matrix-forest theorem and measuring relations in small social groups","volume":"58","author":"Chebotarev","year":"1997","journal-title":"Automation and Remote Control"},{"key":"10.3233\/WEB-150324_ref10","doi-asserted-by":"crossref","unstructured":"[10]P.-J.\u00a0Courtois, Decomposability: Queueing and Computer System Applications. ACM Monograph Series, Academic Press, 1977.","DOI":"10.1016\/B978-0-12-193750-8.50011-8"},{"key":"10.3233\/WEB-150324_ref11","doi-asserted-by":"crossref","unstructured":"[11]P.\u00a0Cremonesi, Y.\u00a0Koren and R.\u00a0Turrin, Performance of recommender algorithms on top-n recommendation tasks, in: Proc. of the Fourth ACM Conference on Recommender Systems (RecSys\u201910), ACM, 2010, pp.\u00a039\u201346.","DOI":"10.1145\/1864708.1864721"},{"key":"10.3233\/WEB-150324_ref12","doi-asserted-by":"crossref","unstructured":"[12]C.\u00a0Dean Meyer, S.\u00a0Race and K.\u00a0Valakuzhy, Determining the number of clusters via iterative consensus clustering, in: SDM, 2013, pp.\u00a094\u2013102.","DOI":"10.1137\/1.9781611972832.11"},{"key":"10.3233\/WEB-150324_ref13","doi-asserted-by":"crossref","unstructured":"[13]C.\u00a0Desrosiers and G.\u00a0Karypis, A comprehensive survey of neighborhood-based recommendation methods, in: Recommender Systems Handbook, F.\u00a0Ricci, L.\u00a0Rokach, B.\u00a0Shapira and P.B.\u00a0Kantor, eds, Springer, 2011, pp.\u00a0107\u2013144.","DOI":"10.1007\/978-0-387-85820-3_4"},{"key":"10.3233\/WEB-150324_ref14","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 Networks"},{"issue":"3","key":"10.3233\/WEB-150324_ref15","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 Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/WEB-150324_ref16","doi-asserted-by":"crossref","unstructured":"[16]A.\u00a0Freno, E.\u00a0Trentin and M.\u00a0Gori, Scalable pseudo-likelihood estimation in hybrid random fields, in: Proc. of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201909), ACM, 2009, pp.\u00a0319\u2013328.","DOI":"10.1145\/1557019.1557059"},{"issue":"12","key":"10.3233\/WEB-150324_ref17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/138859.138867","article-title":"Using collaborative filtering to weave an information tapestry","volume":"35","author":"Goldberg","year":"1992","journal-title":"Communications of the ACM"},{"key":"10.3233\/WEB-150324_ref18","unstructured":"[18]M.\u00a0Gori and A.\u00a0Pucci, Itemrank: A random-walk based scoring algorithm for recommender engines, in: Proc. of the 20th International Joint Conference on Artifical Intelligence (IJCAI\u201907), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2007, pp.\u00a02766\u20132771."},{"key":"10.3233\/WEB-150324_ref19","doi-asserted-by":"crossref","unstructured":"[19]G.\u00a0Grimmett and D.\u00a0Stirzaker, Probability and Random Processes, Oxford University Press, 2001.","DOI":"10.1093\/oso\/9780198572237.001.0001"},{"key":"10.3233\/WEB-150324_ref20","doi-asserted-by":"crossref","unstructured":"[20]J.L.\u00a0Herlocker, J.A.\u00a0Konstan, A.\u00a0Borchers and J.\u00a0Riedl, An algorithmic framework for performing collaborative filtering, in: Proc. of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR\u201999), ACM, New York, NY, USA, 1999, pp.\u00a0230\u2013237.","DOI":"10.1145\/312624.312682"},{"issue":"2","key":"10.3233\/WEB-150324_ref21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s12599-010-0092-x","article-title":"The impact of search and recommendation systems on sales in electronic commerce","volume":"2","author":"Hinz","year":"2010","journal-title":"Business & Information Systems Engineering"},{"key":"10.3233\/WEB-150324_ref22","doi-asserted-by":"crossref","unstructured":"[22]A.\u00a0Kamal and W.\u00a0van Stam, Tivo: Making show recommendations using a distributed collaborative filtering architecture, in: Proc. of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201904), ACM, New York, NY, USA, 2004, pp.\u00a0394\u2013401.","DOI":"10.1145\/1014052.1014097"},{"issue":"1","key":"10.3233\/WEB-150324_ref24","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.3233\/WEB-150324_ref25","unstructured":"[25]G.\u00a0Kollias and E.\u00a0Gallopoulos, Multidamping simulation framework for link-based ranking, in: Web Information Retrieval and Linear Algebra Algorithms, 2007."},{"issue":"9","key":"10.3233\/WEB-150324_ref26","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1109\/TKDE.2013.15","article-title":"Surfing the network for ranking by multidamping","volume":"26","author":"Kollias","year":"2014","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/WEB-150324_ref27","doi-asserted-by":"crossref","unstructured":"[27]Y.\u00a0Koren and R.\u00a0Bell, Advances in collaborative filtering, in: Recommender Systems Handbook, F.\u00a0Ricci, L.\u00a0Rokach, B.\u00a0Shapira and P.B.\u00a0Kantor, eds, Springer US, 2011, pp.\u00a0145\u2013186.","DOI":"10.1007\/978-0-387-85820-3_5"},{"issue":"1","key":"10.3233\/WEB-150324_ref28","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","article-title":"Amazon.com recommendations: Item-to-item collaborative filtering","volume":"7","author":"Linden","year":"2003","journal-title":"IEEE Internet Computing"},{"issue":"1","key":"10.3233\/WEB-150324_ref29","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TSMCB.2011.2163711","article-title":"Enhancing collaborative filtering by user interest expansion via personalized ranking","volume":"42","author":"Liu","year":"2012","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"key":"10.3233\/WEB-150324_ref30","doi-asserted-by":"crossref","unstructured":"[30]B.M.\u00a0Marlin and R.S.\u00a0Zemel, Collaborative prediction and ranking with non-random missing data, in: Proc. of the Third ACM Conference on Recommender Systems (RecSys\u201909), ACM, 2009, pp.\u00a05\u201312.","DOI":"10.1145\/1639714.1639717"},{"issue":"4","key":"10.3233\/WEB-150324_ref31","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1137\/100804395","article-title":"Stochastic data clustering","volume":"33","author":"Meyer","year":"2012","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"10.3233\/WEB-150324_ref32","doi-asserted-by":"crossref","unstructured":"[32]A.N.\u00a0Nikolakopoulos and J.D.\u00a0Garofalakis, NCDawareRank: A novel ranking method that exploits the decomposable structure of the web, in: Proc. of the Sixth ACM International Conference on Web Search and Data Mining (WSDM\u201913), ACM, 2013, pp.\u00a0143\u2013152.","DOI":"10.1145\/2433396.2433415"},{"key":"10.3233\/WEB-150324_ref33","doi-asserted-by":"crossref","unstructured":"[33]A.N.\u00a0Nikolakopoulos and J.D.\u00a0Garofalakis, NCDREC: A decomposability inspired framework for top-n recommendation, in: 2014 IEEE\/WIC\/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Vol.\u00a01, 2014, pp.\u00a0183\u2013190.","DOI":"10.1109\/WI-IAT.2014.32"},{"key":"10.3233\/WEB-150324_ref34","doi-asserted-by":"crossref","unstructured":"[34]A.N.\u00a0Nikolakopoulos and J.D.\u00a0Garofalakis, Random surfing without teleportation, in: Algorithms, Probability, Networks and Games, C.\u00a0Zaroliagis, G.\u00a0Pantziou and S.\u00a0Kontogiannis, eds, Lecture Notes in Computer Science, Springer International Publishing, 2015, pp.\u00a0344\u2013357.","DOI":"10.1007\/978-3-319-24024-4_19"},{"key":"10.3233\/WEB-150324_ref35","doi-asserted-by":"crossref","unstructured":"[35]A.N.\u00a0Nikolakopoulos, M.\u00a0Kalantzi and J.D.\u00a0Garofalakis, On the use of Lanczos vectors for efficient latent factor-based top-n recommendation, in: Proc. of the 4th International Conference on Web Intelligence, Mining and Semantics (WIMS\u201914), ACM, New York, NY, USA, 2014, pp.\u00a028:1\u201328:6.","DOI":"10.1145\/2611040.2611078"},{"key":"10.3233\/WEB-150324_ref36","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.neucom.2014.09.082","article-title":"Hierarchical itemspace rank: Exploiting hierarchy to alleviate sparsity in ranking-based recommendation","volume":"163","author":"Nikolakopoulos","year":"2015","journal-title":"Neurocomputing"},{"issue":"2","key":"10.3233\/WEB-150324_ref37","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2753\/MIS0742-1222270205","article-title":"Empirical analysis of the impact of recommender systems on sales","volume":"27","author":"Pathak","year":"2010","journal-title":"Journal of Management Information Systems"},{"key":"10.3233\/WEB-150324_ref38","doi-asserted-by":"crossref","unstructured":"[38]P.\u00a0Resnick, N.\u00a0Iacovou, M.\u00a0Suchak, P.\u00a0Bergstrom and J.\u00a0Riedl, Grouplens: An open architecture for collaborative filtering of netnews, in: Proc. of the 1994 ACM Conference on Computer Supported Cooperative Work (CSCW\u201994), ACM, New York, NY, USA, 1994, pp.\u00a0175\u2013186.","DOI":"10.1145\/192844.192905"},{"key":"10.3233\/WEB-150324_ref39","doi-asserted-by":"crossref","unstructured":"[39]F.\u00a0Ricci, L.\u00a0Rokach and B.\u00a0Shapira, Introduction to Recommender Systems Handbook, Springer, 2011.","DOI":"10.1007\/978-0-387-85820-3"},{"key":"10.3233\/WEB-150324_ref40","doi-asserted-by":"crossref","unstructured":"[40]B.\u00a0Sarwar, G.\u00a0Karypis, J.\u00a0Konstan and J.\u00a0Riedl, Item-based collaborative filtering recommendation algorithms, in: Proc. of the 10th International Conference on World Wide Web (WWW\u201901), ACM, New York, NY, USA, 2001, pp.\u00a0285\u2013295.","DOI":"10.1145\/371920.372071"},{"key":"10.3233\/WEB-150324_ref41","doi-asserted-by":"crossref","unstructured":"[41]G.\u00a0Shani and A.\u00a0Gunawardana, Evaluating recommendation systems, in: Recommender Systems Handbook, F.\u00a0Ricci, L.\u00a0Rokach, B.\u00a0Shapira and P.B.\u00a0Kantor, eds, Springer US, 2011, pp.\u00a0257\u2013297.","DOI":"10.1007\/978-0-387-85820-3_8"},{"key":"10.3233\/WEB-150324_ref42","unstructured":"[42]S.\u00a0Siegel and N.J.\u00a0Castellan Jr., Nonparametric Statistics for the Behavioral Sciences, Mcgraw-Hill Book Company, 1988."},{"key":"10.3233\/WEB-150324_ref43","unstructured":"[43]H.A.\u00a0Simon, The Sciences of the Artificial, 3rd edn, MIT Press, 1996."},{"issue":"2","key":"10.3233\/WEB-150324_ref44","doi-asserted-by":"crossref","first-page":"111","DOI":"10.2307\/1909285","article-title":"Aggregation of variables in dynamic systems","volume":"29","author":"Simon","year":"1961","journal-title":"Econometrica"},{"issue":"2","key":"10.3233\/WEB-150324_ref45","first-page":"117","article-title":"On the enhancement of collaborative filtering by demographic data","volume":"4","author":"Vozalis","year":"2006","journal-title":"Web Intelligence and Agent Systems"},{"issue":"2","key":"10.3233\/WEB-150324_ref46","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":"Journal of the American Society for Information Science"},{"key":"10.3233\/WEB-150324_ref47","doi-asserted-by":"crossref","unstructured":"[47]H.\u00a0Yildirim and M.S.\u00a0Krishnamoorthy, A random walk method for alleviating the sparsity problem in collaborative filtering, in: Proc. of the 2008 ACM Conference on Recommender Systems (RecSys\u201908), ACM, 2008, pp.\u00a0131\u2013138.","DOI":"10.1145\/1454008.1454031"},{"issue":"9","key":"10.3233\/WEB-150324_ref48","doi-asserted-by":"crossref","first-page":"896","DOI":"10.14778\/2311906.2311916","article-title":"Challenging the long tail recommendation","volume":"5","author":"Yin","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.3233\/WEB-150324_ref49","doi-asserted-by":"crossref","unstructured":"[49]G.G.\u00a0Yin and Q.\u00a0Zhang, Continuous-Time Markov Chains and Applications: A Two-Time-Scale Approach, Vol.\u00a037, Springer, 2013.","DOI":"10.1007\/978-1-4614-4346-9"},{"key":"10.3233\/WEB-150324_ref50","doi-asserted-by":"crossref","unstructured":"[50]L.\u00a0Zhang, K.\u00a0Zhang and C.\u00a0Li, A topical pagerank based algorithm for recommender systems, in: Proc. of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR\u201908), ACM, 2008.","DOI":"10.1145\/1390334.1390465"}],"container-title":["Web Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/WEB-150324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:26:53Z","timestamp":1777613213000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/WEB-150324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,18]]},"references-count":49,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/web-150324","relation":{},"ISSN":["2405-6464","2405-6456"],"issn-type":[{"value":"2405-6464","type":"electronic"},{"value":"2405-6456","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11,18]]}}}