{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T11:16:58Z","timestamp":1761218218888},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2020,9,1]]},"DOI":"10.1587\/transcom.2019ebp3230","type":"journal-article","created":{"date-parts":[[2020,3,15]],"date-time":"2020-03-15T22:04:49Z","timestamp":1584309889000},"page":"951-959","source":"Crossref","is-referenced-by-count":1,"title":["Top-N Recommendation Using Low-Rank Matrix Completion and Spectral Clustering"],"prefix":"10.23919","volume":"E103.B","author":[{"given":"Qian","family":"WANG","sequence":"first","affiliation":[{"name":"Network and Information Center, AnHui University of Technology"}]},{"given":"Qingmei","family":"ZHOU","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, AnHui University of Technology"}]},{"given":"Wei","family":"ZHAO","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, AnHui University of Technology"},{"name":"Anhui Engineering Laboratory for Intelligent Applications and Security of Industrial Internet, AnHui University of Technology"}]},{"given":"Xuangou","family":"WU","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, AnHui University of Technology"},{"name":"Anhui Engineering Laboratory for Intelligent Applications and Security of Industrial Internet, AnHui University of Technology"}]},{"given":"Xun","family":"SHAO","sequence":"additional","affiliation":[{"name":"School of Regional Innovation and Social Design Engineering, Kitami Institute of Technology"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] P. Wongthongtham and B.A. Salih, \u201cOntology-based approach for identifying the credibility domain in social big data,\u201d J. Org. Comp. Elect. Com., vol.28, no.4, pp.354-377, 2018. 10.1080\/10919392.2018.1517481","DOI":"10.1080\/10919392.2018.1517481"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] L. L\u00fc, M. Medo, C.H. Yeung, Y.C. Zhang, Z.K. Zhang, and T. Zhou, \u201cRecommender systems,\u201d Physics Reports, vol.519, no.1, pp.1-49, 2012. 10.1016\/j.physrep.2012.02.006","DOI":"10.1016\/j.physrep.2012.02.006"},{"key":"3","unstructured":"[3] Y. Shoham, Fab: Content-Based, Collaborative Recommendation, ACM, 1997."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[5] J. Wang, A.P. de Vries, and M.J.T. Reinders, \u201cUnifying user-based and item-based collaborative filtering approaches by similarity fusion,\u201d Proc. 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval-SIGIR'06, pp.501-508, 2006. 10.1145\/1148170.1148257","DOI":"10.1145\/1148170.1148257"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[6] G.F. Sun, W.U. Le, Q. Liu, C. Zhu, and E.H. Chen, \u201cRecommendations based on collaborative filtering by exploiting sequential behaviors,\u201d J. Software, vol.24, no.11, pp.2721-2733, 2013. 10.3724\/sp.j.1001.2013.04478","DOI":"10.3724\/SP.J.1001.2013.04478"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[7] E. Palumbo, G. Rizzo, and R. Troncy, \u201centity2rec: Learning user-item relatedness from knowledge graphs for top-n item recommendation,\u201d Eleventh ACM Conference on Recommender Systems, pp.32-36, 2017. 10.1145\/3109859.3109889","DOI":"10.1145\/3109859.3109889"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[8] N.N. Liu and Q. Yang, \u201cEigenRank: A ranking-oriented approach to collaborative filtering,\u201d International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.83-90, 2008. 10.1145\/1390334.1390351","DOI":"10.1145\/1390334.1390351"},{"key":"8","unstructured":"[9] M. Partridge and M. Jabri, \u201cRobust principal component analysis,\u201d Neural Networks for Signal Processing X, 2000. Proc. 2000 IEEE Signal Processing Society Workshop, vol.1, pp.289-298, 2002. 10.1109\/nnsp.2000.889420"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, \u201cItem-based collaborative filtering recommendation algorithms,\u201d International Conference on World Wide Web, pp.285-295, 2001. 10.1145\/371920.372071","DOI":"10.1145\/371920.372071"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[11] J.B. Schafer, F. Dan, J. Herlocker, and S. Sen, \u201cCollaborative filtering recommender systems,\u201d Acm Trans. Inf. Syst., vol.22, no.1, pp.5-53, 2007. 10.1007\/978-3-540-72079-9_9","DOI":"10.1145\/963770.963772"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] R. Burke, \u201cHybrid recommender systems: Survey and experiments,\u201d Interaction, pp.331-370, 2002. 10.1023\/a:1021240730564","DOI":"10.1023\/A:1021240730564"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] W.U. Hu, Y.J. Wang, Z. Wang, X.L. Wang, and S.-Z. Du, \u201cTwo-phase collaborative filtering algorithm based on co-clustering,\u201d J. Software, vol.21, no.5, pp.1042-1054, 2010. 10.3724\/sp.j.1001.2010.03758","DOI":"10.3724\/SP.J.1001.2010.03758"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] T. Di Noia and V.C. Ostuni, Recommender Systems and Linked Open Data, Springer International Publishing, 2015.","DOI":"10.1007\/978-3-319-21768-0_4"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] V.C. Ostuni, T. Di Noia, E. Di Sciascio, and R. Mirizzi, \u201cTop-n recommendations from implicit feedback leveraging linked open data,\u201d ACM Conference on Recommender Systems, pp.85-92, 2013. 10.1145\/2507157.2507172","DOI":"10.1145\/2507157.2507172"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[17] X. Wang, W. Pan, and C. Xu, \u201cHGMF: Hierarchical group matrix factorization for collaborative recommendation,\u201d ACM International Conference on Conference on Information and Knowledge Management, pp.769-778, 2014. 10.1145\/2661829.2662021","DOI":"10.1145\/2661829.2662021"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[18] J. Noel, S. Sanner, K.N. Tran, P. Christen, L. Xie, E.V. Bonilla, E. Abbasnejad, and N.D. Penna, New objective functions for social collaborative filtering, pp.859-868, ACM, 2012. 10.1145\/2187836.2187952","DOI":"10.1145\/2187836.2187952"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[19] X. Liu and K. Aberer, \u201cSoCo: A social network aided context-aware recommender system,\u201d Proc. 22nd International Conference on World Wide Web-WWW'13, pp.781-802, 2013. 10.1145\/2488388.2488457","DOI":"10.1145\/2488388.2488457"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[20] A. Karatzoglou, X. Amatriain, L. Baltrunas, and N. Oliver, \u201cMultiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering, ACM Conference on Recommender Systems, Recsys 2010, pp.79-86, Barcelona, Spain, Sept. 2010. 10.1145\/1864708.1864727","DOI":"10.1145\/1864708.1864727"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[21] H. Ma, D. Zhou, C. Liu, M.R. Lyu, and I. King, \u201cRecommender systems with social regularization,\u201d Proc. 4th ACM International Conference on Web Search and Data Mining-WSDM'11, pp.287-296, 2011. 10.1145\/1935826.1935877","DOI":"10.1145\/1935826.1935877"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[22] B. Abu-Salih, P. Wongthongtham, K.Y. Chan, and D. Zhu, \u201cCredSaT: Credibility ranking of users in big social data incorporating semantic analysis and temporal factor, J. Inform. Sci., vol.45, no.2, 2018. 10.1177\/0165551518790424","DOI":"10.1177\/0165551518790424"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[23] E.J. Candes and Y. Plan, \u201cMatrix completion with noise,\u201d Proc. IEEE, vol.98, no.6, pp.925-936, 2010. 10.1109\/jproc.2009.2035722","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"22","unstructured":"[24] J. Wright, A. Ganesh, S. Rao, and Y. Ma, \u201cRobust principal component analysis: Exact recovery of corrupted low-rank matrices,\u201d Advances in Neural Information Processing Systems, 87(4):20:320:56, 2009."},{"key":"23","doi-asserted-by":"publisher","unstructured":"[25] E. Cand\u00e9s and B. Recht, \u201cExact matrix completion via convex optimization,\u201d Commun. ACM, vol.55, no.6, 2012. 10.1145\/2184319.2184343","DOI":"10.1145\/2184319.2184343"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[26] J.L. Herlocker, J.A. Konstan, and J. Riedl, \u201cExplaining collaborative filtering recommendations,\u201d Proc. 2000 ACM conference on Computer Supported Cooperative Work, pp.241-250, ACM, 2000. 10.1145\/358916.358995","DOI":"10.1145\/358916.358995"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[27] U. Luxburg, \u201cA tutorial on spectral clustering,\u201d Stat. Comput., vol.17, no.4, pp.395-416, 2007. 10.1007\/s11222-007-9033-z","DOI":"10.1007\/s11222-007-9033-z"},{"key":"26","unstructured":"[28] F.R.K. Chung, \u201cSpectral graph theory,\u201d Published for the Conference Board of the Mathematical Sciences by the American Mathematical Society, vol.92, 1997. 10.1090\/cbms\/092"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[29] A. Grover and J. Leskovec, \u201cnode2vec: Scalable feature learning for networks,\u201d ACM SIGKDD International Conference on Knowledge Discovery, Data Mining, pp.855-864, 2016. 10.1145\/2939672.2939754","DOI":"10.1145\/2939672.2939754"},{"key":"28","unstructured":"[30] Movie dataset: https:\/\/movielens.org"},{"key":"29","unstructured":"[31] N. Xia and G. Karypis, \u201cSLIM: Sparse linear methods for top-n recommender systems,\u201d 2011 IEEE 11th International Conference on Data Mining, pp.497-506, 2011. 10.1109\/icdm.2011.134"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[32] P. Cremonesi, Y. Koren, and R. Turrin, \u201cPerformance of recommender algorithms on top-n recommendation tasks, ACM Conference on Recommender Systems, pp.39-46, 2010. 10.1145\/1864708.1864721","DOI":"10.1145\/1864708.1864721"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[33] D.-D. Tu, C.C. Shu, and H.-Y. Yu, \u201cUsing unified probabilistic matrix factorization for contextual advertisement recommendation,\u201d J. Software, vol.24, no.3, pp.454-464, 2013. 10.3724\/sp.j.1001.2013.04238","DOI":"10.3724\/SP.J.1001.2013.04238"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[34] Y. Koren, R. Bell, and C. Volinsky, \u201cMatrix factorization techniques for recommender systems,\u201d Computer, vol.42, no.8, pp.30-37, 2009. 10.1109\/mc.2009.263","DOI":"10.1109\/MC.2009.263"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[35] R. Salakhutdinov and A. Mnih, \u201cBayesian probabilistic matrix factorization using Markov chain Monte Carlo,\u201d International Conference on Machine Learning, pp.880-887, 2008. 10.1145\/1390156.1390267","DOI":"10.1145\/1390156.1390267"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[36] E. Christakopoulou and G. Karypis, \u201cLocal item-item models for top-n recommendation,\u201d ACM Conference on Recommender Systems, pp.67-74, 2016. 10.1145\/2959100.2959185","DOI":"10.1145\/2959100.2959185"},{"key":"35","doi-asserted-by":"publisher","unstructured":"[37] J. Bobadilla, F. Ortega, and A. Hernando, \u201cRecommender systems survey,\u201d Knowledge-Based Syst., vol.46, no.1, pp.109-132, 2013. 10.1016\/j.knosys.2013.03.012","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"36","doi-asserted-by":"publisher","unstructured":"[38] A. Eriksson and A. Van Den Hengel, \u201cEfficient computation of robust weighted low-rank matrix approximations using the L_1 norm,\u201d IEEE Trans. Pattern Anal. Mach. Intell., vol.34, no.9, pp.1681-1690, 2012. 10.1109\/tpami.2012.116","DOI":"10.1109\/TPAMI.2012.116"},{"key":"37","unstructured":"[39] A. Krishnamurthy and A. Singh, \u201cLow-rank matrix and tensor completion via adaptive sampling,\u201d Proc. 26th International Conference on Neural Information Processing Systems, NIPS'13, pp.836-844, 2013."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E103.B\/9\/E103.B_2019EBP3230\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T15:02:52Z","timestamp":1704898972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E103.B\/9\/E103.B_2019EBP3230\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,1]]},"references-count":37,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2019ebp3230","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,1]]}}}