{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T01:11:52Z","timestamp":1754183512144,"version":"3.41.2"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2025,8,1]]},"DOI":"10.1587\/transinf.2024dap0006","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T17:10:26Z","timestamp":1733764226000},"page":"906-916","source":"Crossref","is-referenced-by-count":0,"title":["AdaCF: Adaptively Updating Adjacency Matrix in Collaborative Filtering"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Chi","family":"ZHANG","sequence":"first","affiliation":[{"name":"The University of Tokyo"}]},{"given":"Luwei","family":"ZHANG","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]},{"given":"Toshihiko","family":"YAMASAKI","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua, \u201cNeural graph collaborative filtering,\u201d Proc. 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.165-174, 2019. 10.1145\/3331184.3331267","DOI":"10.1145\/3331184.3331267"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, \u201cLightgcn: Simplifying and powering graph convolution network for recommendation,\u201d Proc. 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, p.639-648, 2020. 10.1145\/3397271.3401063","DOI":"10.1145\/3397271.3401063"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] F.M. Harper and J.A. Konstan, \u201cThe movielens datasets: History and context,\u201d Acm Trans. interactive intelligent systems (tiis), vol.5, no.4, pp.1-19, 2015. 10.1145\/2827872","DOI":"10.1145\/2827872"},{"key":"4","unstructured":"[4] N. Asghar, \u201cYelp dataset challenge: Review rating prediction,\u201d arXiv preprint arXiv:1605.05362, 2016."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] G. Linden, B. Smith, and J. York, \u201cAmazon.com recommendations: Item-to-item collaborative filtering,\u201d IEEE Internet Computing, vol.7, no.1, pp.76-80, 2003. 10.1109\/mic.2003.1167344","DOI":"10.1109\/MIC.2003.1167344"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Y. Shen, Y. Wu, Y. Zhang, C. Shan, J. Zhang, B.K. Letaief, and D. Li, \u201cHow powerful is graph convolution for recommendation?,\u201d Proc. 30th ACM Int. Conf. information &amp; knowledge management, pp.1619-1629, 2021. 10.1145\/3459637.3482264","DOI":"10.1145\/3459637.3482264"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] C. Wang, Y. Yu, W. Ma, M. Zhang, C. Chen, Y. Liu, and S. Ma, \u201cTowards representation alignment and uniformity in collaborative filtering,\u201d Proc. 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp.1816-1825, 2022. 10.1145\/3534678.3539253","DOI":"10.1145\/3534678.3539253"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] J. Wu, X. Wang, F. Feng, X. He, L. Chen, J. Lian, and X. Xie, \u201cSelf-supervised graph learning for recommendation,\u201d Proc. 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.726-735, 2021. 10.1145\/3404835.3462862","DOI":"10.1145\/3404835.3462862"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] D. Goldberg, D. Nichols, B.M. Oki, and D. Terry, \u201cUsing collaborative filtering to weave an information tapestry,\u201d Communications of the ACM, vol.35, no.12, pp.61-70, 1992. 10.1145\/138859.138867","DOI":"10.1145\/138859.138867"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] 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":"11","unstructured":"[11] M. Defferrard, X. Bresson, and P. Vandergheynst, \u201cConvolutional neural networks on graphs with fast localized spectral filtering,\u201d Advances in Neural Information Processing Systems, vol.29, 2016."},{"key":"12","unstructured":"[12] R.v.d. Berg, T.N. Kipf, and M. Welling, \u201cGraph convolutional matrix completion,\u201d arXiv preprint arXiv:1706.02263, 2017."},{"key":"13","unstructured":"[13] S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, \u201cBpr: Bayesian personalized ranking from implicit feedback,\u201d Proc. Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, p.452-461, 2009."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Z. Gao, Z. Cheng, F. P\u00e9rez, J. Sun, and M. Volkovs, \u201cMcl: Mixed-centric loss for collaborative filtering,\u201d Proc. ACM Web Conference 2022, pp.2339-2347, 2022. 10.1145\/3485447.3512106","DOI":"10.1145\/3485447.3512106"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] K. Mao, J. Zhu, J. Wang, Q. Dai, Z. Dong, X. Xiao, and X. He, \u201cSimplex: A simple and strong baseline for collaborative filtering,\u201d Proc. 30th ACM Int. Conf. Information &amp; Knowledge Management, pp.1243-1252, 2021. 10.1145\/3459637.3482297","DOI":"10.1145\/3459637.3482297"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S. Park, M. Yoon, J.-W. Lee, H. Park, and J. Lee, \u201cToward a better understanding of loss functions for collaborative filtering,\u201d Proc. 32nd ACM Int. Conf. Information and Knowledge Management, pp.2034-2043, 2023. 10.1145\/3583780.3615086","DOI":"10.1145\/3583780.3615086"},{"key":"17","unstructured":"[17] W. Fan, X. Liu, W. Jin, X. Zhao, J. Tang, and Q. Li, \u201cGraph trend networks for recommendations,\u201d arXiv preprint arXiv:2108.05552, 2021."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] J. Choi, J. Jeon, and N. Park, \u201cLt-ocf: learnable-time ode-based collaborative filtering,\u201d Proc. 30th ACM Int. Conf. Information &amp; Knowledge Management, pp.251-260, 2021. 10.1145\/3459637.3482449","DOI":"10.1145\/3459637.3482449"},{"key":"19","unstructured":"[19] I. Chami, Z. Ying, C. R\u00e9, and J. Leskovec, \u201cHyperbolic graph convolutional neural networks,\u201d Advances in Neural Information Processing Systems, vol.32, 2019."},{"key":"20","unstructured":"[20] P. Khosla, P. Teterwak, C. Wang, A. Sarna, Y. Tian, P. Isola, A. Maschinot, C. Liu, and D. Krishnan, \u201cSupervised contrastive learning,\u201d Advances in neural information processing systems, vol.33, pp.18661-18673, 2020."},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] X. Liu, F. Zhang, Z. Hou, L. Mian, Z. Wang, J. Zhang, and J. Tang, \u201cSelf-supervised learning: Generative or contrastive,\u201d IEEE Trans. knowledge and data engineering, vol.35, no.1, pp.857-876, 2021. 10.1109\/tkde.2021.3090866","DOI":"10.1109\/TKDE.2021.3090866"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] J. Yu, H. Yin, X. Xia, T. Chen, L. Cui, and Q.V.H. Nguyen, \u201cAre graph augmentations necessary? simple graph contrastive learning for recommendation,\u201d Proc. 45th international ACM SIGIR conference on research and development in information retrieval, pp.1294-1303, 2022. 10.1145\/3477495.3531937","DOI":"10.1145\/3477495.3531937"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] J. Yu, X. Xia, T. Chen, L. Cui, N.Q.V. Hung, and H. Yin, \u201cXsimgcl: Towards extremely simple graph contrastive learning for recommendation,\u201d IEEE Trans. Knowledge and Data Engineering, 2023. 10.1109\/tkde.2023.3288135","DOI":"10.1109\/TKDE.2023.3288135"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] M. Liu, M. Jian, G. Shi, Y. Xiang, and L. Wu, \u201cGraph contrastive learning on complementary embedding for recommendation,\u201d Proc. 2023 ACM Int. Conf. Multimedia Retrieval, pp.576-580, 2023. 10.1145\/3591106.3592222","DOI":"10.1145\/3591106.3592222"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] Z. Lin, C. Tian, Y. Hou, and W.X. Zhao, \u201cImproving graph collaborative filtering with neighborhood-enriched contrastive learning,\u201d Proc. ACM web conference 2022, pp.2320-2329, 2022. 10.1145\/3485447.3512104","DOI":"10.1145\/3485447.3512104"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] J. Yu, H. Yin, X. Xia, T. Chen, J. Li, and Z. Huang, \u201cSelf-supervised learning for recommender systems: A survey,\u201d IEEE Trans. Knowledge and Data Engineering, vol.36, no.1, pp.335-355, 2024. 10.1109\/tkde.2023.3282907","DOI":"10.1109\/TKDE.2023.3282907"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/8\/E108.D_2024DAP0006\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T03:28:24Z","timestamp":1754105304000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/8\/E108.D_2024DAP0006\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024dap0006","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"article-number":"2024DAP0006"}}