{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T17:11:27Z","timestamp":1790183487812,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"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":["1947135,1947203,1939725"],"award-info":[{"award-number":["1947135,1947203,1939725"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","award":["17STQAC00001-03-03"],"award-info":[{"award-number":["17STQAC00001-03-03"]}],"id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403080","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:17:27Z","timestamp":1597965447000},"page":"379-389","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["InFoRM: Individual Fairness on Graph Mining"],"prefix":"10.1145","author":[{"given":"Jian","family":"Kang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingrui","family":"He","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ross","family":"Maciejewski","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Community detection in social networks. WIREs DMKD","author":"Bedi Punam","year":"2016","unstructured":"Punam Bedi and Chhavi Sharma . 2016. Community detection in social networks. WIREs DMKD ( 2016 ). Punam Bedi and Chhavi Sharma. 2016. Community detection in social networks. WIREs DMKD (2016)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Asia J Biega Krishna P Gummadi and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In SIGIR. 405--414.  Asia J Biega Krishna P Gummadi and Gerhard Weikum. 2018. Equity of attention: Amortizing individual fairness in rankings. In SIGIR. 405--414.","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_1_3_1","volume-title":"Hamilton","author":"Bose Avishek Joey","year":"2019","unstructured":"Avishek Joey Bose and William L . Hamilton . 2019 . Compositional Fairness Constraints for Graph Embeddings. In ICML. Avishek Joey Bose and William L. Hamilton. 2019. Compositional Fairness Constraints for Graph Embeddings. In ICML."},{"key":"e_1_3_2_1_4_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029--5037.  Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029--5037."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold and Richard Zemel. 2012. Fairness through awareness. In ITCS. 214--226.  Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold and Richard Zemel. 2012. Fairness through awareness. In ITCS. 214--226.","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Michael Feldman Sorelle A Friedler John Moeller Carlos Scheidegger and Suresh Venkatasubramanian. 2015. Certifying and removing disparate impact. In KDD.  Michael Feldman Sorelle A Friedler John Moeller Carlos Scheidegger and Suresh Venkatasubramanian. 2015. Certifying and removing disparate impact. In KDD.","DOI":"10.1145\/2783258.2783311"},{"key":"e_1_3_2_1_7_1","volume-title":"Van Loan","author":"Golub Gene H.","year":"1996","unstructured":"Gene H. Golub and Charles F . Van Loan . 1996 . Matrix Computations third ed.). The Johns Hopkins University Press . Gene H. Golub and Charles F. Van Loan. 1996. Matrix Computations third ed.). The Johns Hopkins University Press."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In KDD. 855--864.  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_9_1","unstructured":"Moritz Hardt Eric Price Nati Srebro etal 2016. Equality of opportunity in supervised learning. In NIPS. 3315--3323.  Moritz Hardt Eric Price Nati Srebro et al. 2016. Equality of opportunity in supervised learning. In NIPS. 3315--3323."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2002. SimRank: a measure of structural-context similarity. In KDD. 538--543.  Glen Jeh and Jennifer Widom. 2002. SimRank: a measure of structural-context similarity. In KDD. 538--543.","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_11_1","unstructured":"Toshihiro Kamishima Shotaro Akaho Hideki Asoh and Jun Sakuma. 2012. Enhancement of the Neutrality in Recommendation.  Toshihiro Kamishima Shotaro Akaho Hideki Asoh and Jun Sakuma. 2012. Enhancement of the Neutrality in Recommendation."},{"key":"e_1_3_2_1_12_1","unstructured":"Jian Kang and Hanghang Tong. 2019. N2N: Network Derivative Mining. In CIKM. 861--870.  Jian Kang and Hanghang Tong. 2019. N2N: Network Derivative Mining. In CIKM. 861--870."},{"key":"e_1_3_2_1_13_1","volume-title":"AURORA: Auditing PageRank on Large Graphs. In Big Data. 713--722.","author":"Kang Jian","year":"2018","unstructured":"Jian Kang , Meijia Wang , Nan Cao , Yinglong Xia , Wei Fan , and Hanghang Tong . 2018 . AURORA: Auditing PageRank on Large Graphs. In Big Data. 713--722. Jian Kang, Meijia Wang, Nan Cao, Yinglong Xia, Wei Fan, and Hanghang Tong. 2018. AURORA: Auditing PageRank on Large Graphs. In Big Data. 713--722."},{"key":"e_1_3_2_1_14_1","unstructured":"Michael Kim Omer Reingold and Guy Rothblum. 2018. Fairness through computationally-bounded awareness. In NeurIPS. 4842--4852.  Michael Kim Omer Reingold and Guy Rothblum. 2018. Fairness through computationally-bounded awareness. In NeurIPS. 4842--4852."},{"key":"e_1_3_2_1_15_1","unstructured":"Matthaus Kleindessner Samira Samadi Pranjal Awasthi and Jamie Morgenstern. 2019. Guarantees for Spectral Clustering with Fairness Constraints. In ICML.  Matthaus Kleindessner Samira Samadi Pranjal Awasthi and Jamie Morgenstern. 2019. Guarantees for Spectral Clustering with Fairness Constraints. In ICML."},{"key":"e_1_3_2_1_16_1","unstructured":"Danai Koutra Ankur Parikh Aaditya Ramdas and Jing Xiang. 2011. Algorithms for graph similarity and subgraph matching.  Danai Koutra Ankur Parikh Aaditya Ramdas and Jing Xiang. 2011. Algorithms for graph similarity and subgraph matching."},{"key":"e_1_3_2_1_17_1","volume-title":"Operationalizing Individual Fairness with Pairwise Fair Representations. PVLDB","author":"Lahoti Preethi","year":"2019","unstructured":"Preethi Lahoti , Krishna P Gummadi , and Gerhard Weikum . 2019. Operationalizing Individual Fairness with Pairwise Fair Representations. PVLDB ( 2019 ). Preethi Lahoti, Krishna P Gummadi, and Gerhard Weikum. 2019. Operationalizing Individual Fairness with Pairwise Fair Representations. PVLDB (2019)."},{"key":"e_1_3_2_1_18_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Shike Mei and Xiaojin Zhu. 2015. Using machine teaching to identify optimal training-set attacks on machine learners. In AAAI.  Shike Mei and Xiaojin Zhu. 2015. Using machine teaching to identify optimal training-set attacks on machine learners. In AAAI.","DOI":"10.1609\/aaai.v29i1.9569"},{"key":"e_1_3_2_1_20_1","unstructured":"Andrew Y Ng Michael I Jordan and Yair Weiss. 2002. On spectral clustering: Analysis and an algorithm. In NIPS. 849--856.  Andrew Y Ng Michael I Jordan and Yair Weiss. 2002. On spectral clustering: Analysis and an algorithm. In NIPS. 849--856."},{"key":"e_1_3_2_1_22_1","volume-title":"MONET: Debiasing Graph Embeddings via the Metadata-Orthogonal Training Unit. arXiv preprint arXiv:1909.11793","author":"Palowitch John","year":"2019","unstructured":"John Palowitch and Bryan Perozzi . 2019 . MONET: Debiasing Graph Embeddings via the Metadata-Orthogonal Training Unit. arXiv preprint arXiv:1909.11793 (2019). John Palowitch and Bryan Perozzi. 2019. MONET: Debiasing Graph Embeddings via the Metadata-Orthogonal Training Unit. arXiv preprint arXiv:1909.11793 (2019)."},{"key":"e_1_3_2_1_23_1","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.  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."},{"key":"e_1_3_2_1_24_1","volume-title":"Fairwalk: Towards Fair Graph Embedding. In IJCAI.","author":"Rahman Tahleen","year":"2019","unstructured":"Tahleen Rahman , Bartlomiej Surma , Michael Backes , and Yang Zhang . 2019 . Fairwalk: Towards Fair Graph Embedding. In IJCAI. Tahleen Rahman, Bartlomiej Surma, Michael Backes, and Yang Zhang. 2019. Fairwalk: Towards Fair Graph Embedding. In IJCAI."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Sahil Verma and Julia Rubin. 2018. Fairness definitions explained. In FairWare.  Sahil Verma and Julia Rubin. 2018. Fairness definitions explained. In FairWare.","DOI":"10.1145\/3194770.3194776"},{"key":"e_1_3_2_1_27_1","volume-title":"JMLR","volume":"11","author":"Vishwanathan S Vichy N","year":"2010","unstructured":"S Vichy N Vishwanathan , Nicol N Schraudolph , Risi Kondor , and Karsten M Borgwardt . 2010 . Graph kernels . JMLR , Vol. 11 , Apr (2010), 1201--1242. S Vichy N Vishwanathan, Nicol N Schraudolph, Risi Kondor, and Karsten M Borgwardt. 2010. Graph kernels. JMLR, Vol. 11, Apr (2010), 1201--1242."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Fei Wang Tao Li and Changshui Zhang. 2008. Semi-Supervised Clustering via Matrix Factorization. In SDM.  Fei Wang Tao Li and Changshui Zhang. 2008. Semi-Supervised Clustering via Matrix Factorization. In SDM.","DOI":"10.1137\/1.9781611972788.1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Jianshu Weng Ee-Peng Lim Jing Jiang and Qi He. 2010. Twitterrank: finding topic-sensitive influential twitterers. In WSDM. ACM 261--270.  Jianshu Weng Ee-Peng Lim Jing Jiang and Qi He. 2010. Twitterrank: finding topic-sensitive influential twitterers. In WSDM. ACM 261--270.","DOI":"10.1145\/1718487.1718520"},{"key":"e_1_3_2_1_30_1","unstructured":"Yongkai Wu Lu Zhang Xintao Wu and Hanghang Tong. 2019. PC-Fairness: A Unified Framework for Measuring Causality-Based Fairness. In NeurIPS.  Yongkai Wu Lu Zhang Xintao Wu and Hanghang Tong. 2019. PC-Fairness: A Unified Framework for Measuring Causality-Based Fairness. In NeurIPS."},{"key":"e_1_3_2_1_31_1","unstructured":"Sirui Yao and Bert Huang. 2017. Beyond parity: Fairness objectives for collaborative filtering. In NIPS. 2921--2930.  Sirui Yao and Bert Huang. 2017. Beyond parity: Fairness objectives for collaborative filtering. In NIPS. 2921--2930."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Yuan Yao Hanghang Tong Guo Yan Feng Xu Xiang Zhang Boleslaw K Szymanski and Jian Lu. 2014. Dual-regularized one-class collaborative filtering. In CIKM.  Yuan Yao Hanghang Tong Guo Yan Feng Xu Xiang Zhang Boleslaw K Szymanski and Jian Lu. 2014. Dual-regularized one-class collaborative filtering. In CIKM.","DOI":"10.1145\/2661829.2662042"},{"key":"e_1_3_2_1_33_1","volume-title":"Rothblum","author":"Yona Gal","year":"2018","unstructured":"Gal Yona and Guy N . Rothblum . 2018 . Probably Approximately Metric-Fair Learning. In ICML. 5666--5674. Gal Yona and Guy N. Rothblum. 2018. Probably Approximately Metric-Fair Learning. In ICML. 5666--5674."},{"key":"e_1_3_2_1_34_1","unstructured":"Rich Zemel Yu Wu Kevin Swersky Toni Pitassi and Cynthia Dwork. 2013. Learning fair representations. In ICML. 325--333.  Rich Zemel Yu Wu Kevin Swersky Toni Pitassi and Cynthia Dwork. 2013. Learning fair representations. In ICML. 325--333."},{"key":"e_1_3_2_1_35_1","unstructured":"Rui Zhang and Hanghang Tong. 2019. Robust Principal Component Analysis with Adaptive Neighbors. In NeurIPS. 6959--6967.  Rui Zhang and Hanghang Tong. 2019. Robust Principal Component Analysis with Adaptive Neighbors. In NeurIPS. 6959--6967."},{"key":"e_1_3_2_1_36_1","volume-title":"Graph convolutional networks: a comprehensive review. Computational Social Networks","author":"Zhang Si","year":"2019","unstructured":"Si Zhang , Hanghang Tong , Jiejun Xu , and Ross Maciejewski . 2019. Graph convolutional networks: a comprehensive review. Computational Social Networks ( 2019 ). Si Zhang, Hanghang Tong, Jiejun Xu, and Ross Maciejewski. 2019. Graph convolutional networks: a comprehensive review. Computational Social Networks (2019)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219968"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403080","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403080","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:38Z","timestamp":1750200098000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":36,"alternative-id":["10.1145\/3394486.3403080","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403080","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}