{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:41:36Z","timestamp":1649162496162},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"DOI":"10.1145\/3442381.3449875","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:01:20Z","timestamp":1622746880000},"source":"Crossref","is-referenced-by-count":0,"title":["Effective and Scalable Clustering on Massive Attributed Graphs"],"prefix":"10.1145","author":[{"given":"Renchi","family":"Yang","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore"}]},{"given":"Jieming","family":"Shi","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Hong Kong"}]},{"given":"Yin","family":"Yang","sequence":"additional","affiliation":[{"name":"Hamad bin Khalifa University, Qatar"}]},{"given":"Keke","family":"Huang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Shiqi","family":"Zhang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685756"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Esra Akbas and Peixiang Zhao. 2017. Attributed graph clustering: An attribute-aware graph embedding approach. In ASONAM. Esra Akbas and Peixiang Zhao. 2017. Attributed graph clustering: An attribute-aware graph embedding approach. In ASONAM.","DOI":"10.1145\/3110025.3110092"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Aleksandar Bojchevski Johannes Klicpera Bryan Perozzi Amol Kapoor Martin Blais Benedek R\u00f3zemberczki Michal Lukasik and Stephan G\u00fcnnemann. 2020. Scaling Graph Neural Networks with Approximate PageRank. In SIGKDD. Aleksandar Bojchevski Johannes Klicpera Bryan Perozzi Amol Kapoor Martin Blais Benedek R\u00f3zemberczki Michal Lukasik and Stephan G\u00fcnnemann. 2020. Scaling Graph Neural Networks with Approximate PageRank. In SIGKDD.","DOI":"10.1145\/3394486.3403296"},{"key":"e_1_3_2_1_4_1","volume-title":"Clustering attributed graphs: models, measures and methods. Network Science","author":"Bothorel C\u00e9cile","year":"2015","unstructured":"C\u00e9cile Bothorel , Juan\u00a0David Cruz , Matteo Magnani , and Barbora Micenkova . 2015. Clustering attributed graphs: models, measures and methods. Network Science ( 2015 ). C\u00e9cile Bothorel, Juan\u00a0David Cruz, Matteo Magnani, and Barbora Micenkova. 2015. Clustering attributed graphs: models, measures and methods. Network Science (2015)."},{"key":"e_1_3_2_1_5_1","unstructured":"Petr Chunaev. 2019. Community detection in node-attributed social networks: a survey. arXiv preprint arXiv:1912.09816(2019). Petr Chunaev. 2019. Community detection in node-attributed social networks: a survey. arXiv preprint arXiv:1912.09816(2019)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Fan\u00a0RK Chung and Fan\u00a0Chung Graham. 1997. Spectral graph theory. Fan\u00a0RK Chung and Fan\u00a0Chung Graham. 1997. Spectral graph theory.","DOI":"10.1090\/cbms\/092"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"David Combe Christine Largeron El\u00f6d Egyed-Zsigmond and Mathias G\u00e9ry. 2012. Combining relations and text in scientific network clustering. In ASONAM. David Combe Christine Largeron El\u00f6d Egyed-Zsigmond and Mathias G\u00e9ry. 2012. Combining relations and text in scientific network clustering. In ASONAM.","DOI":"10.1109\/ASONAM.2012.215"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Peter Congdon. 2007. Bayesian statistical modelling. Peter Congdon. 2007. Bayesian statistical modelling.","DOI":"10.1002\/9780470035948"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"James\u00a0W Demmel. 1997. Applied numerical linear algebra. Siam. James\u00a0W Demmel. 1997. Applied numerical linear algebra. Siam.","DOI":"10.1137\/1.9781611971446"},{"key":"e_1_3_2_1_10_1","volume-title":"Anca: Attributed network clustering algorithm. In Complex Networks.","author":"Falih Issam","year":"2017","unstructured":"Issam Falih , Nistor Grozavu , Rushed Kanawati , and Youn\u00e8s Bennani . 2017 . Anca: Attributed network clustering algorithm. In Complex Networks. Issam Falih, Nistor Grozavu, Rushed Kanawati, and Youn\u00e8s Bennani. 2017. Anca: Attributed network clustering algorithm. In Complex Networks."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Issam Falih Nistor Grozavu Rushed Kanawati and Youn\u00e8s Bennani. 2018. Community detection in attributed network. In WWW. Issam Falih Nistor Grozavu Rushed Kanawati and Youn\u00e8s Bennani. 2018. Community detection in attributed network. In WWW.","DOI":"10.1145\/3184558.3191570"},{"key":"e_1_3_2_1_12_1","volume-title":"Community detection in graphs. Physics reports","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato . 2010. Community detection in graphs. Physics reports ( 2010 ). Santo Fortunato. 2010. Community detection in graphs. Physics reports (2010)."},{"key":"e_1_3_2_1_13_1","volume-title":"Galois lattices, and the structure of human social groups. Social networks","author":"Freeman C","year":"1996","unstructured":"Linton\u00a0 C Freeman . 1996. Cliques , Galois lattices, and the structure of human social groups. Social networks ( 1996 ). Linton\u00a0C Freeman. 1996. Cliques, Galois lattices, and the structure of human social groups. Social networks (1996)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Olivier Goldschmidt and Dorit\u00a0S Hochbaum. 1988. Polynomial algorithm for the k-cut problem. In FOCS. Olivier Goldschmidt and Dorit\u00a0S Hochbaum. 1988. Polynomial algorithm for the k-cut problem. In FOCS.","DOI":"10.1109\/SFCS.1988.21960"},{"key":"e_1_3_2_1_15_1","volume-title":"Functional cartography of complex metabolic networks. Nature","author":"Guimera Roger","year":"2005","unstructured":"Roger Guimera and Luis A\u00a0Nunes Amaral . 2005. Functional cartography of complex metabolic networks. Nature ( 2005 ). Roger Guimera and Luis A\u00a0Nunes Amaral. 2005. Functional cartography of complex metabolic networks. Nature (2005)."},{"key":"e_1_3_2_1_16_1","series-title":"SIAM review","volume-title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","author":"Halko Nathan","year":"2011","unstructured":"Nathan Halko , Per-Gunnar Martinsson , and Joel\u00a0 A Tropp . 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions . SIAM review ( 2011 ). Nathan Halko, Per-Gunnar Martinsson, and Joel\u00a0A Tropp. 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review (2011)."},{"key":"e_1_3_2_1_17_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS. Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_1_18_1","volume-title":"Co-clustering of biological networks and gene expression data. Bioinformatics","author":"Hanisch Daniel","year":"2002","unstructured":"Daniel Hanisch , Alexander Zien , Ralf Zimmer , and Thomas Lengauer . 2002. Co-clustering of biological networks and gene expression data. Bioinformatics ( 2002 ). Daniel Hanisch, Alexander Zien, Ralf Zimmer, and Thomas Lengauer. 2002. Co-clustering of biological networks and gene expression data. Bioinformatics (2002)."},{"key":"e_1_3_2_1_19_1","volume-title":"Algorithm AS 136: A k-means clustering algorithm. J R Stat Soc Ser C","author":"Hartigan A","year":"1979","unstructured":"John\u00a0 A Hartigan and Manchek\u00a0 A Wong . 1979. Algorithm AS 136: A k-means clustering algorithm. J R Stat Soc Ser C ( 1979 ). John\u00a0A Hartigan and Manchek\u00a0A Wong. 1979. Algorithm AS 136: A k-means clustering algorithm. J R Stat Soc Ser C (1979)."},{"key":"e_1_3_2_1_21_1","unstructured":"Dongxiao He Zhiyong Feng Di Jin Xiaobao Wang and Weixiong Zhang. 2017. Joint identification of network communities and semantics via integrative modeling of network topologies and node contents. In AAAI. Dongxiao He Zhiyong Feng Di Jin Xiaobao Wang and Weixiong Zhang. 2017. Joint identification of network communities and semantics via integrative modeling of network topologies and node contents. In AAAI."},{"key":"e_1_3_2_1_22_1","volume-title":"Community detection in networks: Structural communities versus ground truth. Physical Review E","author":"Hric Darko","year":"2014","unstructured":"Darko Hric , Richard\u00a0 K Darst , and Santo Fortunato . 2014. Community detection in networks: Structural communities versus ground truth. Physical Review E ( 2014 ). Darko Hric, Richard\u00a0K Darst, and Santo Fortunato. 2014. Community detection in networks: Structural communities versus ground truth. Physical Review E (2014)."},{"key":"e_1_3_2_1_23_1","unstructured":"Huimin Huang Hong Shen and Zaiqiao Meng. 2020. Community-based influence maximization in attributed networks. Applied Intelligence(2020). Huimin Huang Hong Shen and Zaiqiao Meng. 2020. Community-based influence maximization in attributed networks. Applied Intelligence(2020)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Xiao Huang Jundong Li and Xia Hu. 2017. Label informed attributed network embedding. In WSDM. Xiao Huang Jundong Li and Xia Hu. 2017. Label informed attributed network embedding. In WSDM.","DOI":"10.1145\/3018661.3018667"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW. Glen Jeh and Jennifer Widom. 2003. Scaling personalized web search. In WWW.","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_1_26_1","volume":"200","author":"Kossinets Gueorgi","unstructured":"Gueorgi Kossinets and Duncan\u00a0 J Watts. 200 6. Empirical analysis of an evolving social network. science (2006). Gueorgi Kossinets and Duncan\u00a0J Watts. 2006. Empirical analysis of an evolving social network. science (2006).","journal-title":"J Watts."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Timothy La\u00a0Fond and Jennifer Neville. 2010. Randomization tests for distinguishing social influence and homophily effects. In WWW. Timothy La\u00a0Fond and Jennifer Neville. 2010. Randomization tests for distinguishing social influence and homophily effects. In WWW.","DOI":"10.1145\/1772690.1772752"},{"key":"e_1_3_2_1_28_1","volume-title":"Community detection algorithms: a comparative analysis. Physical review E","author":"Lancichinetti Andrea","year":"2009","unstructured":"Andrea Lancichinetti and Santo Fortunato . 2009. Community detection algorithms: a comparative analysis. Physical review E ( 2009 ). Andrea Lancichinetti and Santo Fortunato. 2009. Community detection algorithms: a comparative analysis. Physical review E (2009)."},{"key":"e_1_3_2_1_29_1","unstructured":"Ye Li Chaofeng Sha Xin Huang and Yanchun Zhang. 2018. Community detection in attributed graphs: An embedding approach. In AAAI. Ye Li Chaofeng Sha Xin Huang and Yanchun Zhang. 2018. Community detection in attributed graphs: An embedding approach. In AAAI."},{"key":"e_1_3_2_1_30_1","volume-title":"Improved personalized recommendation based on user attributes clustering and score matrix filling. CSI","author":"Liji U","year":"2018","unstructured":"U Liji , Yahui Chai , and Jianrui Chen . 2018. Improved personalized recommendation based on user attributes clustering and score matrix filling. CSI ( 2018 ). U Liji, Yahui Chai, and Jianrui Chen. 2018. Improved personalized recommendation based on user attributes clustering and score matrix filling. CSI (2018)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Jie Liu Zhicheng He Lai Wei and Yalou Huang. 2018. Content to node: Self-translation network embedding. In SIGKDD. Jie Liu Zhicheng He Lai Wei and Yalou Huang. 2018. Content to node: Self-translation network embedding. In SIGKDD.","DOI":"10.1145\/3219819.3219988"},{"key":"e_1_3_2_1_32_1","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz 1993. Random walks on graphs: A survey. Combinatorics Paul erdos is eighty(1993). L\u00e1szl\u00f3 Lov\u00e1sz 1993. Random walks on graphs: A survey. Combinatorics Paul erdos is eighty(1993)."},{"key":"e_1_3_2_1_33_1","volume-title":"Coupled node similarity learning for community detection in attributed networks. Entropy","author":"Meng Fanrong","year":"2018","unstructured":"Fanrong Meng , Xiaobin Rui , Zhixiao Wang , Yan Xing , and Longbing Cao . 2018. Coupled node similarity learning for community detection in attributed networks. Entropy ( 2018 ). Fanrong Meng, Xiaobin Rui, Zhixiao Wang, Yan Xing, and Longbing Cao. 2018. Coupled node similarity learning for community detection in attributed networks. Entropy (2018)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Zaiqiao Meng Shangsong Liang Hongyan Bao and Xiangliang Zhang. 2019. Co-embedding attributed networks. In WSDM. Zaiqiao Meng Shangsong Liang Hongyan Bao and Xiangliang Zhang. 2019. Co-embedding attributed networks. In WSDM.","DOI":"10.1145\/3289600.3291015"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Leon Mirsky. 1975. A trace inequality of John von Neumann. Monatshefte f\u00fcr mathematik(1975). Leon Mirsky. 1975. A trace inequality of John von Neumann. Monatshefte f\u00fcr mathematik(1975).","DOI":"10.1007\/BF01647331"},{"key":"e_1_3_2_1_36_1","volume-title":"Intra graph clustering using collaborative similarity measure. DAPD","author":"Nawaz Waqas","year":"2015","unstructured":"Waqas Nawaz , Kifayat-Ullah Khan , Young-Koo Lee , and Sungyoung Lee . 2015. Intra graph clustering using collaborative similarity measure. DAPD ( 2015 ). Waqas Nawaz, Kifayat-Ullah Khan, Young-Koo Lee, and Sungyoung Lee. 2015. Intra graph clustering using collaborative similarity measure. DAPD (2015)."},{"key":"e_1_3_2_1_37_1","unstructured":"Jennifer Neville Micah Adler and David Jensen. 2003. Clustering relational data using attribute and link information. In IJCAI. Jennifer Neville Micah Adler and David Jensen. 2003. Clustering relational data using attribute and link information. In IJCAI."},{"key":"e_1_3_2_1_38_1","volume-title":"Finding and evaluating community structure in networks. Physical review E","author":"Newman EJ","year":"2004","unstructured":"Mark\u00a0 EJ Newman and Michelle Girvan . 2004. Finding and evaluating community structure in networks. Physical review E ( 2004 ). Mark\u00a0EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E (2004)."},{"key":"e_1_3_2_1_39_1","unstructured":"Andrew\u00a0Y Ng Michael\u00a0I Jordan and Yair Weiss. 2002. On spectral clustering: Analysis and an algorithm. In NeurIPS. Andrew\u00a0Y Ng Michael\u00a0I Jordan and Yair Weiss. 2002. On spectral clustering: Analysis and an algorithm. In NeurIPS."},{"key":"e_1_3_2_1_40_1","volume-title":"Estimation and prediction for stochastic blockstructures. J Am Stat Assoc","author":"Nowicki Krzysztof","year":"2001","unstructured":"Krzysztof Nowicki and Tom A\u00a0B Snijders . 2001. Estimation and prediction for stochastic blockstructures. J Am Stat Assoc ( 2001 ). Krzysztof Nowicki and Tom A\u00a0B Snijders. 2001. Estimation and prediction for stochastic blockstructures. J Am Stat Assoc (2001)."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Hae-Sang Park and Chi-Hyuck Jun. 2009. A simple and fast algorithm for K-medoids clustering. Expert systems with applications(2009). Hae-Sang Park and Chi-Hyuck Jun. 2009. A simple and fast algorithm for K-medoids clustering. Expert systems with applications(2009).","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Yiye Ruan David Fuhry and Srinivasan Parthasarathy. 2013. Efficient community detection in large networks using content and links. In WWW. Yiye Ruan David Fuhry and Srinivasan Parthasarathy. 2013. Efficient community detection in large networks using content and links. In WWW.","DOI":"10.1145\/2488388.2488483"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Heinz Rutishauser. 1969. Computational aspects of FL Bauer\u2019s simultaneous iteration method. Numer. Math. (1969). Heinz Rutishauser. 1969. Computational aspects of FL Bauer\u2019s simultaneous iteration method. Numer. Math. (1969).","DOI":"10.1007\/BF02165269"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Satu\u00a0Elisa Schaeffer. 2007. Graph clustering. Computer science review(2007). Satu\u00a0Elisa Schaeffer. 2007. Graph clustering. Computer science review(2007).","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_1_45_1","unstructured":"Karsten Steinhaeuser and Nitesh\u00a0V Chawla. 2008. Community detection in a large real-world social network. In SBP. Karsten Steinhaeuser and Nitesh\u00a0V Chawla. 2008. Community detection in a large real-world social network. In SBP."},{"key":"e_1_3_2_1_46_1","volume-title":"Personalized pagerank clustering: A graph clustering algorithm based on random walks. Physica A","author":"Tabrizi A","year":"2013","unstructured":"Shayan\u00a0 A Tabrizi , Azadeh Shakery , Masoud Asadpour , Maziar Abbasi , and Mohammad\u00a0Ali Tavallaie . 2013. Personalized pagerank clustering: A graph clustering algorithm based on random walks. Physica A ( 2013 ). Shayan\u00a0A Tabrizi, Azadeh Shakery, Masoud Asadpour, Maziar Abbasi, and Mohammad\u00a0Ali Tavallaie. 2013. Personalized pagerank clustering: A graph clustering algorithm based on random walks. Physica A (2013)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Hanghang Tong Christos Faloutsos and Jia-Yu Pan. 2006. Fast random walk with restart and its applications. In ICDM. Hanghang Tong Christos Faloutsos and Jia-Yu Pan. 2006. Fast random walk with restart and its applications. In ICDM.","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_1_48_1","volume-title":"Graph attention networks. ICLR","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107 , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Lio , and Yoshua Bengio . 2018. Graph attention networks. ICLR ( 2018 ). Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018. Graph attention networks. ICLR (2018)."},{"key":"e_1_3_2_1_49_1","volume-title":"Finding local communities in protein networks. BMC bioinformatics","author":"Voevodski Konstantin","year":"2009","unstructured":"Konstantin Voevodski , Shang-Hua Teng , and Yu Xia . 2009. Finding local communities in protein networks. BMC bioinformatics ( 2009 ). Konstantin Voevodski, Shang-Hua Teng, and Yu Xia. 2009. Finding local communities in protein networks. BMC bioinformatics (2009)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Ulrike Von\u00a0Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing(2007). Ulrike Von\u00a0Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing(2007).","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Dorothea Wagner and Frank Wagner. 1993. Between min cut and graph bisection. In MFCS. Dorothea Wagner and Frank Wagner. 1993. Between min cut and graph bisection. In MFCS.","DOI":"10.1007\/3-540-57182-5_65"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Chun Wang Shirui Pan Ruiqi Hu Guodong Long Jing Jiang and Chengqi Zhang. 2019. Attributed graph clustering: a deep attentional embedding approach. In IJCAI. Chun Wang Shirui Pan Ruiqi Hu Guodong Long Jing Jiang and Chengqi Zhang. 2019. Attributed graph clustering: a deep attentional embedding approach. In IJCAI.","DOI":"10.24963\/ijcai.2019\/509"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132967"},{"key":"e_1_3_2_1_54_1","unstructured":"Zhiqiang Xu Yiping Ke Yi Wang Hong Cheng and James Cheng. 2012. A model-based approach to attributed graph clustering. In SIGMOD. Zhiqiang Xu Yiping Ke Yi Wang Hong Cheng and James Cheng. 2012. A model-based approach to attributed graph clustering. In SIGMOD."},{"key":"e_1_3_2_1_55_1","unstructured":"Cheng Yang Zhiyuan Liu Deli Zhao Maosong Sun and Edward Chang. 2015. Network representation learning with rich text information. In AAAI. Cheng Yang Zhiyuan Liu Deli Zhao Maosong Sun and Edward Chang. 2015. Network representation learning with rich text information. In AAAI."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Hong Yang Shirui Pan Ling Chen Chuan Zhou and Peng Zhang. 2019. Low-Bit Quantization for Attributed Network Representation Learning. In IJCAI. Hong Yang Shirui Pan Ling Chen Chuan Zhou and Peng Zhang. 2019. Low-Bit Quantization for Attributed Network Representation Learning. In IJCAI.","DOI":"10.24963\/ijcai.2019\/562"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Hong Yang Shirui Pan Peng Zhang Ling Chen Defu Lian and Chengqi Zhang. 2018. Binarized attributed network embedding. In ICDM. Hong Yang Shirui Pan Peng Zhang Ling Chen Defu Lian and Chengqi Zhang. 2018. Binarized attributed network embedding. In ICDM.","DOI":"10.1109\/ICDM.2018.8626170"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Jaewon Yang Julian McAuley and Jure Leskovec. 2013. Community detection in networks with node attributes. In ICDM. Jaewon Yang Julian McAuley and Jure Leskovec. 2013. Community detection in networks with node attributes. In ICDM.","DOI":"10.1109\/ICDM.2013.167"},{"key":"e_1_3_2_1_59_1","volume-title":"Homogeneous network embedding for massive graphs via reweighted personalized PageRank. PVLDB","author":"Yang Renchi","year":"2020","unstructured":"Renchi Yang , Jieming Shi , Xiaokui Xiao , Yin Yang , and Sourav\u00a0 S Bhowmick . 2020. Homogeneous network embedding for massive graphs via reweighted personalized PageRank. PVLDB ( 2020 ). Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, and Sourav\u00a0S Bhowmick. 2020. Homogeneous network embedding for massive graphs via reweighted personalized PageRank. PVLDB (2020)."},{"key":"e_1_3_2_1_60_1","volume-title":"Scaling Attributed Network Embedding to Massive Graphs. PVLDB","author":"Yang Renchi","year":"2021","unstructured":"Renchi Yang , Jieming Shi , Xiaokui Xiao , Yin Yang , Juncheng Liu , and Sourav\u00a0 S. Bhowmick . 2021. Scaling Attributed Network Embedding to Massive Graphs. PVLDB ( 2021 ). Renchi Yang, Jieming Shi, Xiaokui Xiao, Yin Yang, Juncheng Liu, and Sourav\u00a0S. Bhowmick. 2021. Scaling Attributed Network Embedding to Massive Graphs. PVLDB (2021)."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Renchi Yang Xiaokui Xiao Zhewei Wei Sourav\u00a0S Bhowmick Jun Zhao and Rong-Hua Li. 2019. Efficient Estimation of Heat Kernel PageRank for Local Clustering. In SIGMOD. Renchi Yang Xiaokui Xiao Zhewei Wei Sourav\u00a0S Bhowmick Jun Zhao and Rong-Hua Li. 2019. Efficient Estimation of Heat Kernel PageRank for Local Clustering. In SIGMOD.","DOI":"10.1145\/3299869.3319886"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Tianbao Yang Rong Jin Yun Chi and Shenghuo Zhu. 2009. Combining link and content for community detection: a discriminative approach. In SIGKDD. Tianbao Yang Rong Jin Yun Chi and Shenghuo Zhu. 2009. Combining link and content for community detection: a discriminative approach. In SIGKDD.","DOI":"10.1145\/1557019.1557120"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Hugo Zanghi Stevenn Volant and Christophe Ambroise. 2010. Clustering based on random graph model embedding vertex features. Pattern Recognition Letters(2010). Hugo Zanghi Stevenn Volant and Christophe Ambroise. 2010. Clustering based on random graph model embedding vertex features. Pattern Recognition Letters(2010).","DOI":"10.1016\/j.patrec.2010.01.026"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Xiaotong Zhang Han Liu Qimai Li and Xiao-Ming Wu. 2019. Attributed graph clustering via adaptive graph convolution. In IJCAI. Xiaotong Zhang Han Liu Qimai Li and Xiao-Ming Wu. 2019. Attributed graph clustering via adaptive graph convolution. In IJCAI.","DOI":"10.24963\/ijcai.2019\/601"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-order proximity preserved network embedding. In SIGKDD. Ziwei Zhang Peng Cui Xiao Wang Jian Pei Xuanrong Yao and Wenwu Zhu. 2018. Arbitrary-order proximity preserved network embedding. In SIGKDD.","DOI":"10.1145\/3219819.3219969"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271741"},{"key":"e_1_3_2_1_67_1","volume-title":"Graph clustering based on structural\/attribute similarities. PVLDB","author":"Zhou Yang","year":"2009","unstructured":"Yang Zhou , Hong Cheng , and Jeffrey\u00a0Xu Yu. 2009. Graph clustering based on structural\/attribute similarities. PVLDB ( 2009 ). Yang Zhou, Hong Cheng, and Jeffrey\u00a0Xu Yu. 2009. Graph clustering based on structural\/attribute similarities. PVLDB (2009)."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Yang Zhou Hong Cheng and Jeffrey\u00a0Xu Yu. 2010. Clustering large attributed graphs: An efficient incremental approach. In ICDM. Yang Zhou Hong Cheng and Jeffrey\u00a0Xu Yu. 2010. Clustering large attributed graphs: An efficient incremental approach. In ICDM.","DOI":"10.1109\/ICDM.2010.41"}],"event":{"name":"WWW '21: The Web Conference 2021","location":"Ljubljana Slovenia","acronym":"WWW '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3449875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T04:01:29Z","timestamp":1647403289000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":67,"alternative-id":["10.1145\/3442381.3449875","10.1145\/3442381"],"URL":"http:\/\/dx.doi.org\/10.1145\/3442381.3449875","relation":{},"published":{"date-parts":[[2021,4,19]]}}}