{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:31:34Z","timestamp":1648981894421},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014edp7334","type":"journal-article","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T15:11:50Z","timestamp":1427901110000},"page":"948-954","source":"Crossref","is-referenced-by-count":1,"title":["Personalized Recommendation of Item Category Using Ranking on Time-Aware Graphs"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Chen","family":"CHEN","sequence":"first","affiliation":[{"name":"College of Computer and Control Engineering, Nankai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunyan","family":"HOU","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, Tianjin University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"NIE","sequence":"additional","affiliation":[{"name":"College of Computer and Control Engineering, Nankai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojie","family":"YUAN","sequence":"additional","affiliation":[{"name":"College of Computer and Control Engineering, Nankai University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] T. Bogers, \u201cMovie recommendation using random walks over the contextual graph,\u201d Proc. 2nd Workshop on Context-Aware Recommender Systems, 2010."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] P. Cremonesi, Y. Koren, and R. Turrin, \u201cPerformance of recommender algorithms on top-n recommendation tasks,\u201d Proc. Fourth ACM Conference on Recommender Systems, pp.39-46, 2010.","DOI":"10.1145\/1864708.1864721"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] F. Fouss, A. Pirotte, J. Renders, and M. Saerens, \u201cRandom-walk computation of similarities between nodes of a graph with application to collaborative recommendation,\u201d IEEE Trans. Knowl. Data Eng., vol.19, no.3, pp.355-369, 2007.","DOI":"10.1109\/TKDE.2007.46"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T.H. Haveliwala, \u201cTopic-sensitive PageRank,\u201d Proc. 11th International Conference on World Wide Web, pp.517-526, 2002.","DOI":"10.1145\/511511.511513"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M. Jamali and M. Ester, \u201cTrustWalker: A random walk model for combining trust-based and item-based recommendation,\u201d Proc. 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.397-406, 2009.","DOI":"10.1145\/1557019.1557067"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] J.M. Kleinberg, \u201cAuthoritative sources in a hyperlinked environment,\u201d J. ACM, vol.46, no.5, pp.604-632, 1999.","DOI":"10.1145\/324133.324140"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Y. Koren, R. Bell, and C. Volinsky, \u201cMatrix factorization techniques for recommender systems,\u201d Computer, vol.42, no.8, pp.30-37, 2009.","DOI":"10.1109\/MC.2009.263"},{"key":"8","unstructured":"[8] D.D. Lee and H.S. Seung, \u201cAlgorithms for non-negative matrix factorization,\u201d Proc. Advances in Neural Information Processing Systems, pp.556-562, 2001."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J. Lee, S. Bengio, S. Kim, G. Lebanon, and Y. Singer, \u201cLocal collaborative ranking,\u201d Proc. 23rd International Conference on World Wide Web, pp.85-96, 2014.","DOI":"10.1145\/2566486.2567970"},{"key":"10","unstructured":"[10] J. Liu, M.Z.Q. Chen, J. Chen, F. Deng, H. Zhang, Z. Zhang, and T. Zhou, \u201cRecent advances in personal recommender systems,\u201d Int. J. Information and Systems Sciences, vol.5, no.2, pp.230-247, 2009."},{"key":"11","unstructured":"[11] A. Mnih and R. Salakhutdinov, \u201cProbabilistic matrix factorization,\u201d Proc. Advances in Neural Information Processing Systems, pp.1257-1264, 2007."},{"key":"12","unstructured":"[12] L. Page, S. Brin, R. Motwani, and T. Winograd, \u201cThe PageRank citation ranking: Bringing order to the Web,\u201d Technical Report, Standford Digital Library Technologies, 1998."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] D.R. Radev and G. Erkan, \u201cLexrank: Graph-based centrality as salience in text summarization,\u201d J. Artif. Intell. Res., vol.22, 2004.","DOI":"10.1613\/jair.1523"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J.D.M. Rennie and N. Srebro, \u201cFast maximum margin matrix factorization for collaborative prediction,\u201d Proc. 22nd International Conference on Machine Learning, pp.713-719, 2005.","DOI":"10.1145\/1102351.1102441"},{"key":"15","unstructured":"[15] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl, \u201cGroupLens: An open architecture for collaborative filtering of netnews,\u201d Proc. 1994 ACM Conference on Computer Supported Cooperative Work, pp.175-186, 1994."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] Y. Rong, X. Wen, and H. Cheng, \u201cA Monte Carlo algorithm for cold start recommendation,\u201d Proc. 23rd Int. Conf. World Wide Web, pp.327-336, 2014.","DOI":"10.1145\/2566486.2567978"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, \u201cItem-based collaborative filtering recommendation algorithms,\u201d Proc. 10th International Conference on World Wide Web, pp.285-295, 2001.","DOI":"10.1145\/371920.372071"},{"key":"18","unstructured":"[18] X. Su and T.M. Khoshgoftaar, \u201cA survey of collaborative filtering techniques,\u201d Advances in Artificial Intelligence, vol.2009, p.19, 2009."},{"key":"19","unstructured":"[19] H. Yildirim and M.S. Krishnamoorthy, \u201cA random walk method for alleviating the sparsity problem in collaborative filtering,\u201d Proc. 2008 ACM Conference on Recommender Systems, pp.131-138, 2008."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/4\/E98.D_2014EDP7334\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T18:44:10Z","timestamp":1566499450000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/4\/E98.D_2014EDP7334\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014edp7334","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}