{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T01:41:27Z","timestamp":1765503687012,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","funder":[{"name":"the Science and Technology Development Fund, Macau SAR","award":["0126\/2024\/RIA2, 001\/2024\/SKL"],"award-info":[{"award-number":["0126\/2024\/RIA2, 001\/2024\/SKL"]}]},{"name":"GDST","award":["2020B1212030003, 2023A0505030013"],"award-info":[{"award-number":["2020B1212030003, 2023A0505030013"]}]},{"name":"Nansha District","award":["2023ZD001"],"award-info":[{"award-number":["2023ZD001"]}]},{"name":"UMDF","award":["MYRG-GRG2023-00186-FST-UMDF"],"award-info":[{"award-number":["MYRG-GRG2023-00186-FST-UMDF"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3761346","type":"proceedings-article","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T00:18:04Z","timestamp":1762561084000},"page":"2610-2620","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Structure-Adaptive Graph Filtering for Collaborative Filtering"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8804-2697","authenticated-orcid":false,"given":"Yijun","family":"Sheng","sequence":"first","affiliation":[{"name":"University of Macau, Macau SAR, Macao"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8356-6198","authenticated-orcid":false,"given":"Ximing","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Macau, Macau SAR, Macao"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9762-4008","authenticated-orcid":false,"given":"Yanyan","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Macau, Macau SAR, Macao"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6771-4598","authenticated-orcid":false,"given":"Pui Ieng","family":"Lei","sequence":"additional","affiliation":[{"name":"University of Macau, Macau SAR, Macao"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8149-9879","authenticated-orcid":false,"given":"Zhiguo","family":"Gong","sequence":"additional","affiliation":[{"name":"University of Macau, Macau SAR, Macao"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Laplacian eigenmaps for dimensionality reduction and data representation. Neural computation","author":"Belkin Mikhail","year":"2003","unstructured":"Mikhail Belkin and Partha Niyogi. 2003. Laplacian eigenmaps for dimensionality reduction and data representation. Neural computation, Vol. 15, 6 (2003), 1373-1396."},{"key":"e_1_3_2_2_2_1","volume-title":"Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263","author":"van den Berg Rianne","year":"2017","unstructured":"Rianne van den Berg, Thomas N Kipf, and Max Welling. 2017. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017)."},{"key":"e_1_3_2_2_3_1","volume-title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation. In The Eleventh International Conference on Learning Representations (ICLR '23)","author":"Cai Xuheng","year":"2023","unstructured":"Xuheng Cai, Chao Huang, Lianghao Xia, and Xubin Ren. 2023. LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation. In The Eleventh International Conference on Learning Representations (ICLR '23). https:\/\/openreview.net\/forum?id=FKXVK9dyMM"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591645"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482449"},{"volume-title":"Spectral graph theory","author":"Chung Fan RK","key":"e_1_3_2_2_6_1","unstructured":"Fan RK Chung. 1997. Spectral graph theory. Vol. 92. American Mathematical Soc."},{"key":"e_1_3_2_2_7_1","volume-title":"AAAI Workshop on Deep Learning on Graphs: Methods and Applications (AAAI '21)","author":"Dwivedi Vijay Prakash","year":"2021","unstructured":"Vijay Prakash Dwivedi and Xavier Bresson. 2021. A Generalization of Transformer Networks to Graphs. In AAAI Workshop on Deep Learning on Graphs: Methods and Applications (AAAI '21)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Wenqi Fan Yao Ma Qing Li Yuan He Eric Zhao Jiliang Tang and Dawei Yin. 2019. Graph neural networks for social recommendation. In The world wide web conference. 417-426.","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_2_9_1","first-page":"4776","article-title":"How powerful are k-hop message passing graph neural networks","volume":"35","author":"Feng Jiarui","year":"2022","unstructured":"Jiarui Feng, Yixin Chen, Fuhai Li, Anindya Sarkar, and Muhan Zhang. 2022. How powerful are k-hop message passing graph neural networks. Advances in Neural Information Processing Systems, Vol. 35 (2022), 4776-4790.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3294771.3294869"},{"key":"e_1_3_2_2_11_1","volume-title":"The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis)","author":"Maxwell Harper F","year":"2015","unstructured":"F Maxwell Harper and Joseph A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis), Vol. 5, 4 (2015), 1-19."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_2_14_1","unstructured":"Charilaos Kanatsoulis and Jure Leskovec. 2024. Spectral Perspective of message-passing GNNs. https:\/\/web.stanford.edu\/class\/cs224w\/slides\/07-theory2.pdf."},{"volume-title":"Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations (ICLR '17)","author":"Thomas","key":"e_1_3_2_2_15_1","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations (ICLR '17). https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3540261.3541915"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Richard B Lehoucq Danny C Sorensen and Chao Yang. 1998. ARPACK users' guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. SIAM.","DOI":"10.1137\/1.9780898719628"},{"key":"e_1_3_2_2_18_1","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Leman Andrei","year":"1968","unstructured":"Andrei Leman and Boris Weisfeiler. 1968. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsiya, Vol. 2, 9 (1968), 12-16.","journal-title":"Nauchno-Technicheskaya Informatsiya"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449986"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583466"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482291"},{"key":"e_1_3_2_2_22_1","volume-title":"Smooth minimization of non-smooth functions. Mathematical programming","author":"Nesterov Yu","year":"2005","unstructured":"Yu Nesterov. 2005. Smooth minimization of non-smooth functions. Mathematical programming, Vol. 103, 1 (2005), 127-152."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671789"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532014"},{"key":"e_1_3_2_2_26_1","first-page":"452","volume-title":"Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (Montreal","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (Montreal, Quebec, Canada) (UAI '09). AUAI Press, Arlington, Virginia, USA, 452-461."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/192844.192905"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_2_2_29_1","volume-title":"Graph Attention Networks. In International Conference on Learning Representations (ICLR '18)","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph Attention Networks. In International Conference on Learning Representations (ICLR '18). https:\/\/openreview.net\/forum?id=rJXMpikCZ"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Pauli Virtanen Ralf Gommers Travis E Oliphant Matt Haberland Tyler Reddy David Cournapeau Evgeni Burovski Pearu Peterson Warren Weckesser Jonathan Bright et al. 2020. SciPy 1.0: fundamental algorithms for scientific computing in Python. Nature methods Vol. 17 3 (2020) 261-272.","DOI":"10.1038\/s41592-020-0772-5"},{"key":"e_1_3_2_2_31_1","first-page":"77","article-title":"The trec-8 question answering track report","volume":"99","author":"Voorhees Ellen M","year":"1999","unstructured":"Ellen M Voorhees et al., 1999. The trec-8 question answering track report.. In Trec, Vol. 99. 77-82.","journal-title":"Trec"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2540128.2540520"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_3_2_2_34_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"6871","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying Graph Convolutional Networks. In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 97), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR, 6861-6871. https:\/\/proceedings.mlr.press\/v97\/wu19e.html"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"e_1_3_2_2_36_1","volume-title":"Proceedings of the 41st International Conference on Machine Learning","author":"Xu Haobo","year":"2024","unstructured":"Haobo Xu, Yuchen Yan, Dingsu Wang, Zhe Xu, Zhichen Zeng, Tarek F. Abdelzaher, Jiawei Han, and Hanghang Tong. 2024. SLOG: an inductive spectral graph neural network beyond polynomial filter. In Proceedings of the 41st International Conference on Machine Learning (Vienna, Austria) (ICML '24). JMLR.org, Article 2282, 23 pages."},{"key":"e_1_3_2_2_37_1","volume-title":"International Conference on Learning Representations (ICLR '19)","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In International Conference on Learning Representations (ICLR '19). https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3701716.3715594"},{"key":"e_1_3_2_2_39_1","volume-title":"Thirty-seventh Conference on Neural Information Processing Systems (NeurIPS '23)","author":"Yan Yuchen","year":"2023","unstructured":"Yuchen Yan, Yuzhong Chen, Huiyuan Chen, Minghua Xu, Mahashweta Das, Hao Yang, and Hanghang Tong. 2023. From Trainable Negative Depth to Edge Heterophily in Graphs. In Thirty-seventh Conference on Neural Information Processing Systems (NeurIPS '23). https:\/\/openreview.net\/forum?id=p8lowHbuv8"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481952"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_2_42_1","first-page":"913","article-title":"XSimGCL: Towards extremely simple graph contrastive learning for recommendation","volume":"36","author":"Yu Junliang","year":"2023","unstructured":"Junliang Yu, Xin Xia, Tong Chen, Lizhen Cui, Nguyen Quoc Viet Hung, and Hongzhi Yin. 2023. XSimGCL: Towards extremely simple graph contrastive learning for recommendation. IEEE Transactions on Knowledge and Data Engineering, Vol. 36, 2 (2023), 913-926.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_2_43_1","volume-title":"Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 1294-1303","author":"Yu Junliang","year":"2022","unstructured":"Junliang Yu, Hongzhi Yin, Xin Xia, Tong Chen, Lizhen Cui, and Quoc Viet Hung Nguyen. 2022a. Are graph augmentations necessary? simple graph contrastive learning for recommendation. In Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 1294-1303."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525952"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20878"}],"event":{"name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Seoul Republic of Korea","acronym":"CIKM '25"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3761346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T01:37:27Z","timestamp":1765503447000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3761346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":45,"alternative-id":["10.1145\/3746252.3761346","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3761346","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}