{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:05:39Z","timestamp":1778738739485,"version":"3.51.4"},"reference-count":63,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T00:00:00Z","timestamp":1610150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["No. IIS-1947203 and Grant No. IIS-2002540"],"award-info":[{"award-number":["No. IIS-1947203 and Grant No. IIS-2002540"]}],"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"}]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["FA8750-17-C-0153"],"award-info":[{"award-number":["FA8750-17-C-0153"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,4,30]]},"abstract":"<jats:p>\n            Modeling and exploring high-order connectivity patterns, also called network motifs, are essential for understanding the fundamental structures that control and mediate the behavior of many complex systems. For example, in social networks, triangles have been proven to play the fundamental role in understanding social network communities; in online transaction networks, detecting directed looped transactions helps identify money laundering activities; in personally identifiable information networks, the star-shaped structures may correspond to a set of synthetic identities. Despite the ubiquity of such high-order structures, many existing graph clustering methods are either not designed for the high-order connectivity patterns, or suffer from the prohibitive computational cost when modeling high-order structures in the large-scale networks. This article generalizes the challenges in multiple dimensions. First (\n            <jats:italic>Model<\/jats:italic>\n            ), we introduce the notion of high-order conductance, and define the high-order diffusion core, which is based on a high-order random walk induced by the\n            <jats:italic>user-specified high-order<\/jats:italic>\n            network structure. Second (\n            <jats:italic>Algorithm<\/jats:italic>\n            ), we propose a novel high-order\n            <jats:italic>structure-preserving<\/jats:italic>\n            graph clustering framework named\n            <jats:italic>HOSGRAP<\/jats:italic>\n            , which partitions the graph into\n            <jats:italic>structure-rich<\/jats:italic>\n            clusters in polylogarithmic time with respect to the number of edges in the graph. Third (\n            <jats:italic>Generalization<\/jats:italic>\n            ), we generalize our proposed algorithm to solve the real-world problems on various types of graphs, such as signed graphs, bipartite graphs, and multi-partite graphs. Experimental results on both synthetic and real graphs demonstrate the effectiveness and efficiency of the proposed algorithms.\n          <\/jats:p>","DOI":"10.1145\/3425637","type":"journal-article","created":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T11:17:08Z","timestamp":1610191028000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["High-Order Structure Exploration on Massive Graphs"],"prefix":"10.1145","volume":"15","author":[{"given":"Dawei","family":"Zhou","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, Illinois"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Si","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, Illinois"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehmet Yigit","family":"Yildirim","sequence":"additional","affiliation":[{"name":"Emailage Corp., Chandler, Arizona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Alcorn","sequence":"additional","affiliation":[{"name":"Early Warnings LLC, Scottsdale, Arizona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, Illinois"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan","family":"Davulcu","sequence":"additional","affiliation":[{"name":"Arizona State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingrui","family":"He","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, Illinois"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1988.tb01715.x"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 2015 IEEE International Conference on Data Mining. Charu C. Aggarwal, Zhi-Hua Zhou, Alexander Tuzhilin, Hui Xiong, and Xindong Wu (Eds.). IEEE Computer Society, 1--10","author":"Ahmed Nesreen K.","year":"2015","unstructured":"Nesreen K. Ahmed , Jennifer Neville , Ryan A. Rossi , and Nick G. Duffield . 2015. Efficient graphlet counting for large networks . In Proceedings of the 2015 IEEE International Conference on Data Mining. Charu C. Aggarwal, Zhi-Hua Zhou, Alexander Tuzhilin, Hui Xiong, and Xindong Wu (Eds.). IEEE Computer Society, 1--10 . DOI:https:\/\/doi.org\/10.1109\/ICDM. 2015 .141 10.1109\/ICDM.2015.141 Nesreen K. Ahmed, Jennifer Neville, Ryan A. Rossi, and Nick G. Duffield. 2015. Efficient graphlet counting for large networks. In Proceedings of the 2015 IEEE International Conference on Data Mining. Charu C. Aggarwal, Zhi-Hua Zhou, Alexander Tuzhilin, Hui Xiong, and Xindong Wu (Eds.). IEEE Computer Society, 1--10. DOI:https:\/\/doi.org\/10.1109\/ICDM.2015.141"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0365-y"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906)","author":"Andersen Reid","year":"2006","unstructured":"Reid Andersen , Fan R.K. Chung , and Kevin J. Lang . 2006. Local graph partitioning using PageRank vectors . In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906) . IEEE Computer Society, 475--486. DOI:https:\/\/doi.org\/10.1109\/FOCS. 2006 .44 10.1109\/FOCS.2006.44 Reid Andersen, Fan R.K. Chung, and Kevin J. Lang. 2006. Local graph partitioning using PageRank vectors. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906). IEEE Computer Society, 475--486. DOI:https:\/\/doi.org\/10.1109\/FOCS.2006.44"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph. Anthony Bonato and Fan R. K. Chung (Eds.)","volume":"4863","author":"Andersen Reid","unstructured":"Reid Andersen , Fan R. K. Chung , and Kevin J. Lang . 2007. Local partitioning for directed graphs using PageRank . In Proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph. Anthony Bonato and Fan R. K. Chung (Eds.) , Vol. 4863 . Springer, 166--178. DOI:https:\/\/doi.org\/10.1007\/978-3-540-77004-6_13 10.1007\/978-3-540-77004-6_13 Reid Andersen, Fan R. K. Chung, and Kevin J. Lang. 2007. Local partitioning for directed graphs using PageRank. In Proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph. Anthony Bonato and Fan R. K. Chung (Eds.), Vol. 4863. Springer, 166--178. DOI:https:\/\/doi.org\/10.1007\/978-3-540-77004-6_13"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856030"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.14"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1074023"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning,. Jennifer G. Dy and Andreas Krause (Eds.)","volume":"80","author":"Bojchevski Aleksandar","year":"2018","unstructured":"Aleksandar Bojchevski , Oleksandr Shchur , Daniel Z\u00fcgner , and Stephan G\u00fcnnemann . 2018 . NetGAN: Generating graphs via random walks . In Proceedings of the 35th International Conference on Machine Learning,. Jennifer G. Dy and Andreas Krause (Eds.) , Vol. 80 . PMLR, 609--618. Retrieved from http:\/\/proceedings.mlr.press\/v80\/bojchevski18a.html. Aleksandar Bojchevski, Oleksandr Shchur, Daniel Z\u00fcgner, and Stephan G\u00fcnnemann. 2018. NetGAN: Generating graphs via random walks. In Proceedings of the 35th International Conference on Machine Learning,. Jennifer G. Dy and Andreas Krause (Eds.), Vol. 80. PMLR, 609--618. Retrieved from http:\/\/proceedings.mlr.press\/v80\/bojchevski18a.html."},{"key":"e_1_2_1_10_1","volume-title":"Modern Graph Theory. Graduate Texts in Mathematics","author":"Bollob\u00e1s B\u00e9la","unstructured":"B\u00e9la Bollob\u00e1s . 2002. Modern Graph Theory. Graduate Texts in Mathematics , Vol. 184 . Springer . DOI:https:\/\/doi.org\/10.1007\/978-1-4612-0619-4 10.1007\/978-1-4612-0619-4 B\u00e9la Bollob\u00e1s. 2002. Modern Graph Theory. Graduate Texts in Mathematics, Vol. 184. Springer. DOI:https:\/\/doi.org\/10.1007\/978-1-4612-0619-4"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018732"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2903712"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2772880"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2419263"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2899366"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.104"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187919"},{"key":"e_1_2_1_18_1","volume-title":"Ng","author":"Ching Wai-Ki","year":"2006","unstructured":"Wai-Ki Ching and Michael K . Ng . 2006 . Markov Chains : Models, Algorithms and Applications. Springer . Wai-Ki Ching and Michael K. Ng. 2006. Markov Chains: Models, Algorithms and Applications. Springer."},{"key":"e_1_2_1_19_1","unstructured":"Kim-Kwang Raymond Choo. 2008. Money laundering risks of prepaid stored value cards. Retrieved from https:\/\/www.aic.gov.au\/publications\/tandi\/tandi363.  Kim-Kwang Raymond Choo. 2008. Money laundering risks of prepaid stored value cards. Retrieved from https:\/\/www.aic.gov.au\/publications\/tandi\/tandi363."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622263"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 8th IEEE International Conference on Data Mining (ICDM\u201908)","author":"Ding Chris H. Q.","year":"2008","unstructured":"Chris H. Q. Ding , Tao Li , and Michael I. Jordan . 2008. Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding . In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM\u201908) . IEEE Computer Society, 183--192. DOI:https:\/\/doi.org\/10.1109\/ICDM. 2008 .130 10.1109\/ICDM.2008.130 Chris H. Q. Ding, Tao Li, and Michael I. Jordan. 2008. Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding. In Proceedings of the 8th IEEE International Conference on Data Mining (ICDM\u201908). IEEE Computer Society, 183--192. DOI:https:\/\/doi.org\/10.1109\/ICDM.2008.130"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403081"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.85"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/140985160"},{"key":"e_1_2_1_26_1","article-title":"The MovieLens datasets: History and context","volume":"5","author":"Maxwell Harper F.","year":"2016","unstructured":"F. Maxwell Harper and Joseph A. Konstan . 2016 . The MovieLens datasets: History and context . ACM Transactions on Interactive Intelligent Systems 5 , 4 (2016), 19:1--19:19. DOI:https:\/\/doi.org\/10.1145\/2827872 10.1145\/2827872 F. Maxwell Harper and Joseph A. Konstan. 2016. The MovieLens datasets: History and context. ACM Transactions on Interactive Intelligent Systems 5, 4 (2016), 19:1--19:19. DOI:https:\/\/doi.org\/10.1145\/2827872","journal-title":"ACM Transactions on Interactive Intelligent Systems"},{"key":"e_1_2_1_27_1","volume-title":"Four Factor Index of Social Status","author":"Hollingshead August B.","unstructured":"August B. Hollingshead . 1975. Four Factor Index of Social Status . New Haven, CT . August B. Hollingshead. 1975. Four Factor Index of Social Status. New Haven, CT."},{"key":"e_1_2_1_28_1","first-page":"97","article-title":"Identity theft: Making the known unknowns known","volume":"21","author":"Hoofnagle Chris Jay","year":"2007","unstructured":"Chris Jay Hoofnagle . 2007 . Identity theft: Making the known unknowns known . Harvard Journal of Law and Technology 21 (2007), 97 . Chris Jay Hoofnagle. 2007. Identity theft: Making the known unknowns known. Harvard Journal of Law and Technology 21 (2007), 97.","journal-title":"Harvard Journal of Law and Technology"},{"key":"e_1_2_1_29_1","volume-title":"Kolda","author":"Klymko Christine","year":"2014","unstructured":"Christine Klymko , David F. Gleich , and Tamara G . Kolda . 2014 . Using triangles to improve community detection in directed networks. CoRR abs\/1404.5874 (2014). arxiv:1404.5874 http:\/\/arxiv.org\/abs\/1404.5874. Christine Klymko, David F. Gleich, and Tamara G. Kolda. 2014. Using triangles to improve community detection in directed networks. CoRR abs\/1404.5874 (2014). arxiv:1404.5874 http:\/\/arxiv.org\/abs\/1404.5874."},{"key":"e_1_2_1_30_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved from http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved from http:\/\/snap.stanford.edu\/data."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2018.2829906"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aaf775"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/299"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2013.777436"},{"key":"#cr-split#-e_1_2_1_35_1.1","doi-asserted-by":"crossref","unstructured":"Zhining Liu Dawei Zhou and Jingrui He. 2019. Towards explainable representation of time-evolving graphs via spatial-temporal graph attention networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. Wenwu Zhu Dacheng Tao Xueqi Cheng Peng Cui Elke A. Rundensteiner David Carmel Qi He and Jeffrey Xu Yu (Eds.). ACM 2137--2140. DOI:https:\/\/doi.org\/10.1145\/3357384.3358155 10.1145\/3357384.3358155","DOI":"10.1145\/3357384.3358155"},{"key":"#cr-split#-e_1_2_1_35_1.2","doi-asserted-by":"crossref","unstructured":"Zhining Liu Dawei Zhou and Jingrui He. 2019. Towards explainable representation of time-evolving graphs via spatial-temporal graph attention networks. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. Wenwu Zhu Dacheng Tao Xueqi Cheng Peng Cui Elke A. Rundensteiner David Carmel Qi He and Jeffrey Xu Yu (Eds.). ACM 2137--2140. DOI:https:\/\/doi.org\/10.1145\/3357384.3358155","DOI":"10.1145\/3357384.3358155"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5936"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89553"},{"key":"e_1_2_1_38_1","volume-title":"Random walks in a convex body and an improved","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1993","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz and Mikl\u00f3s Simonovits . 1993. Random walks in a convex body and an improved volume algorithm. Random Structures 8 Algorithms 4, 4 ( 1993 ), 359--412. DOI:https:\/\/doi.org\/10.1002\/rsa.3240040402 10.1002\/rsa.3240040402 L\u00e1szl\u00f3 Lov\u00e1sz and Mikl\u00f3s Simonovits. 1993. Random walks in a convex body and an improved volume algorithm. Random Structures 8 Algorithms 4, 4 (1993), 359--412. DOI:https:\/\/doi.org\/10.1002\/rsa.3240040402"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1985.tb01383.x"},{"key":"e_1_2_1_40_1","volume-title":"Introduction to Probability Models","author":"Ross Sheldon M.","unstructured":"Sheldon M. Ross . 2014. Introduction to Probability Models . Academic Press . Sheldon M. Ross. 2014. Introduction to Probability Models. Academic Press."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5630"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases. 361--377","author":"Shi Yu","year":"2019","unstructured":"Yu Shi , Xinwei He , Naijing Zhang , Carl Yang , and Jiawei Han . 2019 . User-guided clustering in heterogeneous information networks via motif-based comprehensive transcription . In Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases. 361--377 . DOI:https:\/\/doi.org\/10.1007\/978-3-030-46150-8_22 10.1007\/978-3-030-46150-8_22 Yu Shi, Xinwei He, Naijing Zhang, Carl Yang, and Jiawei Han. 2019. User-guided clustering in heterogeneous information networks via motif-based comprehensive transcription. In Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases. 361--377. DOI:https:\/\/doi.org\/10.1007\/978-3-030-46150-8_22"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science. Jir\u00ed Wiedermann, Gerard Tel, Jaroslav Pokorn\u00fd, M\u00e1ria Bielikov\u00e1, and Julius Stuller (Eds.)","volume":"3831","author":"S\u00edma Jir\u00ed","year":"2006","unstructured":"Jir\u00ed S\u00edma and Satu Elisa Schaeffer . 2006 . On the NP-completeness of some graph cluster measures . In Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science. Jir\u00ed Wiedermann, Gerard Tel, Jaroslav Pokorn\u00fd, M\u00e1ria Bielikov\u00e1, and Julius Stuller (Eds.) , Vol. 3831 . Springer, 530--537. DOI:https:\/\/doi.org\/10.1007\/11611257_51 10.1007\/11611257_51 Jir\u00ed S\u00edma and Satu Elisa Schaeffer. 2006. On the NP-completeness of some graph cluster measures. In Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science. Jir\u00ed Wiedermann, Gerard Tel, Jaroslav Pokorn\u00fd, M\u00e1ria Bielikov\u00e1, and Julius Stuller (Eds.), Vol. 3831. Springer, 530--537. DOI:https:\/\/doi.org\/10.1007\/11611257_51"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/080744888"},{"key":"e_1_2_1_46_1","volume-title":"Tsiarli","author":"Tsourakakis Charalampos E.","year":"2013","unstructured":"Charalampos E. Tsourakakis , Francesco Bonchi , Aristides Gionis , Francesco Gullo , and Maria A . Tsiarli . 2013 . Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Inderjit S. Dhillon, Yehuda Koren, Rayid Ghani, Ted E. Senator, Paul Bradley, Rajesh Parekh, Jingrui He, Robert L. Grossman, and Ramasamy Uthurusamy (Eds.). ACM , 104--112. DOI:https:\/\/doi.org\/10.1145\/2487575.2487645 10.1145\/2487575.2487645 Charalampos E. Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Maria A. Tsiarli. 2013. Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Inderjit S. Dhillon, Yehuda Koren, Rayid Ghani, Ted E. Senator, Paul Bradley, Rajesh Parekh, Jingrui He, Robert L. Grossman, and Ramasamy Uthurusamy (Eds.). ACM, 104--112. DOI:https:\/\/doi.org\/10.1145\/2487575.2487645"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems. Daniel D. Lee, Masashi Sugiyama, Ulrike von Luxburg, Isabelle Guyon, and Roman Garnett (Eds.). 2559--2567","author":"Wu Tao","unstructured":"Tao Wu , Austin R. Benson , and David F. Gleich . 2016. General tensor spectral co-clustering for higher-order data . In Proceedings of the Advances in Neural Information Processing Systems. Daniel D. Lee, Masashi Sugiyama, Ulrike von Luxburg, Isabelle Guyon, and Roman Garnett (Eds.). 2559--2567 . Retrieved from http:\/\/papers.nips.cc\/paper\/6376-general-tensor-spectral-co-clustering-for-higher-order-data. Tao Wu, Austin R. Benson, and David F. Gleich. 2016. General tensor spectral co-clustering for higher-order data. In Proceedings of the Advances in Neural Information Processing Systems. Daniel D. Lee, Masashi Sugiyama, Ulrike von Luxburg, Isabelle Guyon, and Roman Garnett (Eds.). 2559--2567. Retrieved from http:\/\/papers.nips.cc\/paper\/6376-general-tensor-spectral-co-clustering-for-higher-order-data."},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 555--564","author":"Yin Hao","unstructured":"Hao Yin , Austin R. Benson , Jure Leskovec , and David F. Gleich . 2017. Local higher-order graph clustering . In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 555--564 . DOI:https:\/\/doi.org\/10.1145\/3097983.3098069 10.1145\/3097983.3098069 Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich. 2017. Local higher-order graph clustering. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 555--564. DOI:https:\/\/doi.org\/10.1145\/3097983.3098069"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.64"},{"key":"#cr-split#-e_1_2_1_51_1.1","doi-asserted-by":"crossref","unstructured":"Dawei Zhou and Jingrui He. 2019. Gold panning from the mess: Rare category exploration exposition representation and interpretation. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery 8 Data Mining. Ankur Teredesai Vipin Kumar Ying Li R\u00f3mer Rosales Evimaria Terzi and George Karypis (Eds.). ACM 3213--3214. DOI:https:\/\/doi.org\/10.1145\/3292500.3332268 10.1145\/3292500.3332268","DOI":"10.1145\/3292500.3332268"},{"key":"#cr-split#-e_1_2_1_51_1.2","doi-asserted-by":"crossref","unstructured":"Dawei Zhou and Jingrui He. 2019. Gold panning from the mess: Rare category exploration exposition representation and interpretation. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery 8 Data Mining. Ankur Teredesai Vipin Kumar Ying Li R\u00f3mer Rosales Evimaria Terzi and George Karypis (Eds.). ACM 3213--3214. DOI:https:\/\/doi.org\/10.1145\/3292500.3332268","DOI":"10.1145\/3292500.3332268"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the 24th International Joint Conference on Artificial Intelligence. Qiang Yang and Michael J. Wooldridge (Eds.). AAAI Press, 4098--4104","author":"Zhou Dawei","year":"2015","unstructured":"Dawei Zhou , Jingrui He , K. Sel\u00e7uk Candan , and Hasan Davulcu . 2015 . MUVIR: Multi-view rare category detection . In Proceedings of the 24th International Joint Conference on Artificial Intelligence. Qiang Yang and Michael J. Wooldridge (Eds.). AAAI Press, 4098--4104 . http:\/\/ijcai.org\/Abstract\/15\/575 Dawei Zhou, Jingrui He, K. Sel\u00e7uk Candan, and Hasan Davulcu. 2015. MUVIR: Multi-view rare category detection. In Proceedings of the 24th International Joint Conference on Artificial Intelligence. Qiang Yang and Michael J. Wooldridge (Eds.). AAAI Press, 4098--4104. http:\/\/ijcai.org\/Abstract\/15\/575"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0083"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219968"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0478-6"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.120"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098015"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403082"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2019.00003"},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence. Subbarao Kambhampati (Ed.). IJCAI\/AAAI Press, 2435--2441","author":"Zhou Yao","year":"2016","unstructured":"Yao Zhou and Jingrui He . 2016 . Crowdsourcing via tensor augmentation and completion . In Proceedings of the 25th International Joint Conference on Artificial Intelligence. Subbarao Kambhampati (Ed.). IJCAI\/AAAI Press, 2435--2441 . Retrieved from http:\/\/www.ijcai.org\/Abstract\/16\/347. Yao Zhou and Jingrui He. 2016. Crowdsourcing via tensor augmentation and completion. In Proceedings of the 25th International Joint Conference on Artificial Intelligence. Subbarao Kambhampati (Ed.). IJCAI\/AAAI Press, 2435--2441. Retrieved from http:\/\/www.ijcai.org\/Abstract\/16\/347."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.65"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3425637","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3425637","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3425637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:55Z","timestamp":1750195915000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3425637"}},"subtitle":["A Local Graph Clustering Perspective"],"short-title":[],"issued":{"date-parts":[[2021,1,9]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4,30]]}},"alternative-id":["10.1145\/3425637"],"URL":"https:\/\/doi.org\/10.1145\/3425637","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,9]]},"assertion":[{"value":"2019-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}