{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:31:37Z","timestamp":1783737097346,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T00:00:00Z","timestamp":1644537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1955851"],"award-info":[{"award-number":["1955851"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,11]]},"DOI":"10.1145\/3488560.3498398","type":"proceedings-article","created":{"date-parts":[[2022,2,15]],"date-time":"2022-02-15T21:42:57Z","timestamp":1644961377000},"page":"1007-1015","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Friend Story Ranking with Edge-Contextual Local Graph Convolutions"],"prefix":"10.1145","author":[{"given":"Xianfeng","family":"Tang","sequence":"first","affiliation":[{"name":"Amazon, Palo Alto, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yozen","family":"Liu","sequence":"additional","affiliation":[{"name":"Snap Inc., Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinran","family":"He","sequence":"additional","affiliation":[{"name":"Snap Inc., Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suhang","family":"Wang","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil","family":"Shah","sequence":"additional","affiliation":[{"name":"Snap Inc., Los Angeles, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,2,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Sami Abu-El-Haija Bryan Perozzi and Rami Al-Rfou. 2017. Learning edge representations via low-rank asymmetric projections. In KDD . 1787--1796.","DOI":"10.1145\/3132847.3132959"},{"key":"e_1_3_2_1_2_1","volume-title":"Oddball: Spotting anomalies in weighted graphs","author":"Akoglu Leman","year":"2010","unstructured":"Leman Akoglu, Mary McGlohon, and Christos Faloutsos. 2010. Oddball: Spotting anomalies in weighted graphs. In PAKDD. Springer, 410--421."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_1_4_1","volume-title":"Matteo Magnani, and Barbora Micenkova.","author":"Bothorel C\u00e9cile","year":"2015","unstructured":"C\u00e9cile Bothorel, Juan David Cruz, Matteo Magnani, and Barbora Micenkova. 2015. Clustering attributed graphs: models, measures and methods. arXiv preprint arXiv:1501.01676 (2015)."},{"key":"e_1_3_2_1_5_1","volume-title":"Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203","author":"Bruna Joan","year":"2013","unstructured":"Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun. 2013. Spectral networks and locally connected networks on graphs. arXiv preprint arXiv:1312.6203 (2013)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Chong Chen Min Zhang Yiqun Liu and Shaoping Ma. 2019. Social attentional memory network: Modeling aspect-and friend-level differences in recommendation. In WSDM. 177--185.","DOI":"10.1145\/3289600.3290982"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Yuxiao Dong Nitesh V Chawla and Ananthram Swami. 2017. metapath2vec: Scalable representation learning for heterogeneous networks. In KDD . 135--144.","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220040"},{"key":"e_1_3_2_1_10_1","volume-title":"Ego network betweenness. Social networks","author":"Everett Martin","year":"2005","unstructured":"Martin Everett and Stephen P Borgatti. 2005. Ego network betweenness. Social networks , Vol. 27, 1 (2005), 31--38."},{"key":"e_1_3_2_1_11_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 TheWebConf .","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_1_13_1","unstructured":"Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural message passing for quantum chemistry. In ICML. PMLR."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Liyu Gong and Qiang Cheng. 2019. Exploiting edge features for graph neural networks. In CVPR. 9211--9219.","DOI":"10.1109\/CVPR.2019.00943"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_16_1","unstructured":"William L. Hamilton Rex Ying and Jure Leskovec. 2017a. Inductive Representation Learning on Large Graphs. In NIPS ."},{"key":"e_1_3_2_1_17_1","volume-title":"Representation learning on graphs: Methods and applications. arXiv preprint arXiv:1709.05584","author":"Hamilton William L","year":"2017","unstructured":"William L Hamilton, Rex Ying, and Jure Leskovec. 2017b. Representation learning on graphs: Methods and applications. arXiv preprint arXiv:1709.05584 (2017)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Xiangnan He Lizi Liao Hanwang Zhang Liqiang Nie Xia Hu and Tat-Seng Chua. 2017. Neural collaborative filtering. In WWW. 173--182.","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Hong Huang Jie Tang Sen Wu Lu Liu and Xiaoming Fu. 2014. Mining triadic closure patterns in social networks. In WWW. 499--504.","DOI":"10.1145\/2567948.2576940"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Meng Jiang Peng Cui Rui Liu Qiang Yang Fei Wang Wenwu Zhu and Shiqiang Yang. 2012. Social contextual recommendation. In CIKM. 45--54.","DOI":"10.1145\/2396761.2396771"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Parisa Kaghazgaran Maarten Bos Leonardo Neves and Neil Shah. 2020. Social Factors in Closed-Network Content Consumption. In CIKM. 595--604.","DOI":"10.1145\/3340531.3411935"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-2958.1991.tb00529.x"},{"key":"e_1_3_2_1_24_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016a. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_25_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016b. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.012320"},{"key":"e_1_3_2_1_27_1","volume-title":"Vog: Summarizing and understanding large graphs","author":"Koutra Danai","year":"2014","unstructured":"Danai Koutra, U Kang, Jilles Vreeken, and Christos Faloutsos. 2014. Vog: Summarizing and understanding large graphs. In SDM. SIAM, 91--99."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412049"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Daniel Huttenlocher and Jon Kleinberg. 2010. Signed networks in social media. In CHI. 1361--1370.","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2957306"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/89\/58007"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Yozen Liu Xiaolin Shi Lucas Pierce and Xiang Ren. 2019. Characterizing and forecasting user engagement with in-app action graph: A case study of snapchat. In KDD. 2023--2031.","DOI":"10.1145\/3292500.3330750"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499907.2499908"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Hao Ma Haixuan Yang Michael R Lyu and Irwin King. 2008. Sorec: social recommendation using probabilistic matrix factorization. In CIKM . 931--940.","DOI":"10.1145\/1458082.1458205"},{"key":"e_1_3_2_1_36_1","volume-title":"A unified view on graph neural networks as graph signal denoising. arXiv preprint arXiv:2010.01777","author":"Ma Yao","year":"2020","unstructured":"Yao Ma, Xiaorui Liu, Tong Zhao, Yozen Liu, Jiliang Tang, and Neil Shah. 2020. A unified view on graph neural networks as graph signal denoising. arXiv preprint arXiv:2010.01777 (2020)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Yao Ma Suhang Wang Charu C Aggarwal and Jiliang Tang. 2019. Graph convolutional networks with eigenpooling. In KDD. 723--731.","DOI":"10.1145\/3292500.3330982"},{"key":"e_1_3_2_1_38_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology , Vol. 27, 1 (2001)."},{"key":"e_1_3_2_1_39_1","volume-title":"Distributed representations of words and phrases and their compositionality. arXiv preprint arXiv:1310.4546","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Distributed representations of words and phrases and their compositionality. arXiv preprint arXiv:1310.4546 (2013)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Jiezhong Qiu Yuxiao Dong Hao Ma Jian Li Kuansan Wang and Jie Tang. 2018. Network embedding as matrix factorization: Unifying deepwalk line pte and node2vec. In WSDM . 459--467.","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_1_42_1","volume-title":"Heterogeneous network motifs. arXiv preprint arXiv:1901.10026","author":"Rossi Ryan A","year":"2019","unstructured":"Ryan A Rossi, Nesreen K Ahmed, Aldo Carranza, David Arbour, Anup Rao, Sungchul Kim, and Eunyee Koh. 2019. Heterogeneous network motifs. arXiv preprint arXiv:1901.10026 (2019)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Aravind Sankar Yozen Liu Jun Yu and Neil Shah. 2021 a. Graph Neural Networks for Friend Ranking in Large-scale Social Platforms. In TheWebConf .","DOI":"10.1145\/3442381.3450120"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450120"},{"key":"e_1_3_2_1_45_1","volume-title":"Edgecentric: Anomaly detection in edge-attributed networks. In ICDMW. 327--334.","author":"Shah Neil","year":"2016","unstructured":"Neil Shah, Alex Beutel, Bryan Hooi, Leman Akoglu, Stephan Gunnemann, Disha Makhija, Mohit Kumar, and Christos Faloutsos. 2016. Edgecentric: Anomaly detection in edge-attributed networks. In ICDMW. 327--334."},{"key":"e_1_3_2_1_46_1","volume-title":"A novel framework for node\/edge attributed graph embedding","author":"Sun Guolei","unstructured":"Guolei Sun and Xiangliang Zhang. 2019. A novel framework for node\/edge attributed graph embedding. In PAKDD. Springer, 169--182."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371851"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Xianfeng Tang Yozen Liu Neil Shah Xiaolin Shi Prasenjit Mitra and Suhang Wang. 2020 b. Knowing your FATE: Friendship Action and Temporal Explanations for User Engagement Prediction on Social Apps. In KDD. 2269--2279.","DOI":"10.1145\/3394486.3403276"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411872"},{"key":"e_1_3_2_1_51_1","volume-title":"Attention is all you need. arXiv preprint arXiv:1706.03762","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. arXiv preprint arXiv:1706.03762 (2017)."},{"key":"e_1_3_2_1_52_1","unstructured":"Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR ."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural deep network embedding. In KDD. 1225--1234.","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_2_1_54_1","volume-title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Carl Yang Xiaolin Shi Luo Jie and Jiawei Han. 2018. I know you'll be back: Interpretable new user clustering and churn prediction on a mobile social application. In KDD. 914--922.","DOI":"10.1145\/3219819.3219821"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.04.102"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Rex Ying Ruining He Kaifeng Chen Pong Eksombatchai William L Hamilton and Jure Leskovec. 2018a. Graph convolutional neural networks for web-scale recommender systems. In KDD . 974--983.","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_2_1_58_1","volume-title":"Hierarchical graph representation learning with differentiable pooling. arXiv preprint arXiv:1806.08804","author":"Ying Rex","year":"2018","unstructured":"Rex Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L Hamilton, and Jure Leskovec. 2018b. Hierarchical graph representation learning with differentiable pooling. arXiv preprint arXiv:1806.08804 (2018)."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Ke Zhang and Konstantinos Pelechrinis. 2014. Understanding spatial homophily: the case of peer influence and social selection. In WWW . 271--282.","DOI":"10.1145\/2566486.2567990"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"crossref","unstructured":"Muhan Zhang and Yixin Chen. 2017. Weisfeiler-lehman neural machine for link prediction. In KDD. 575--583.","DOI":"10.1145\/3097983.3097996"},{"key":"e_1_3_2_1_61_1","volume-title":"Link prediction based on graph neural networks. arXiv preprint arXiv:1802.09691","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. arXiv preprint arXiv:1802.09691 (2018)."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411977"}],"event":{"name":"WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining","location":"Virtual Event AZ USA","acronym":"WSDM '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3488560.3498398","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488560.3498398","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488560.3498398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:51Z","timestamp":1750191531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488560.3498398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,11]]},"references-count":61,"alternative-id":["10.1145\/3488560.3498398","10.1145\/3488560"],"URL":"https:\/\/doi.org\/10.1145\/3488560.3498398","relation":{},"subject":[],"published":{"date-parts":[[2022,2,11]]},"assertion":[{"value":"2022-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}