{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:43:04Z","timestamp":1762324984559,"version":"3.41.0"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802128"],"award-info":[{"award-number":["61802128"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,8,31]]},"abstract":"<jats:p>Connectivity analysis between the components of large evolving systems can reveal significant patterns of interaction. The systems can be simulated by topological graph structures. However, such analysis becomes challenging on large and complex graphs. Tasks such as comparing, searching, and summarizing structures, are difficult due to the enormous number of calculations required. For time-varying graphs, the temporal dimension even intensifies the difficulty. In this article, we propose to reduce the complexity of analysis by focusing on subgraphs that are induced by closely related entities. To summarize the diverse structures of subgraphs, we build a supervised layout-based classification model. The main premise is that the graph structures can induce a unique appearance of the layout. In contrast to traditional graph theory-based and contemporary neural network-based methods of graph classification, our approach generates low costs and there is no need to learn informative graph representations. Combined with temporally stable visualizations, we can also facilitate the understanding of sub-structures and the tracking of graph evolution. The method is evaluated on two real-world datasets. The results show that our system is highly effective in carrying out visual-based analytics of large graphs.<\/jats:p>","DOI":"10.1145\/3441301","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T16:43:12Z","timestamp":1616776992000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Layout-Based Classification Method for Visualizing Time-Varying Graphs"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1755-6430","authenticated-orcid":false,"given":"Yunzhe","family":"Wang","sequence":"first","affiliation":[{"name":"The Hong Kong Polytechnic University, Huqiu, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Baciu","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University, Huqiu, Suzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenhui","family":"Li","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,3,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2008-00425-1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.254"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25501-4_20"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 3rd International AAAI Conference on Weblogs and Social Media.","author":"Bastian Mathieu","year":"2009","unstructured":"Mathieu Bastian , Sebastien Heymann , and Mathieu Jacomy . 2009 . Gephi: An open source software for exploring and manipulating networks . In Proceedings of the 3rd International AAAI Conference on Weblogs and Social Media. Mathieu Bastian, Sebastien Heymann, and Mathieu Jacomy. 2009. Gephi: An open source software for exploring and manipulating networks. In Proceedings of the 3rd International AAAI Conference on Weblogs and Social Media."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12791"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems. 585--591","author":"Belkin Mikhail","year":"2001","unstructured":"Mikhail Belkin and Partha Niyogi . 2001 . Laplacian eigenmaps and spectral techniques for embedding and clustering . In Proceedings of the Advances in Neural Information Processing Systems. 585--591 . Mikhail Belkin and Partha Niyogi. 2001. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Proceedings of the Advances in Neural Information Processing Systems. 585--591."},{"key":"e_1_2_1_7_1","volume-title":"NetSimile: A scalable approach to size-independent network similarity. Computer Science 12, 1","author":"Berlingerio Michele","year":"2012","unstructured":"Michele Berlingerio , Danai Koutra , Tina Eliassirad , and Christos Faloutsos . 2012. NetSimile: A scalable approach to size-independent network similarity. Computer Science 12, 1 ( 2012 ), 28(1--28). Michele Berlingerio, Danai Koutra, Tina Eliassirad, and Christos Faloutsos. 2012. NetSimile: A scalable approach to size-independent network similarity. Computer Science 12, 1 (2012), 28(1--28)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"volume-title":"Modern Graph Theory","author":"Bollob\u00e1s B\u00e9la","key":"e_1_2_1_9_1","unstructured":"B\u00e9la Bollob\u00e1s . 2013. Modern Graph Theory . Vol. 184 . Springer Science & Business Media . B\u00e9la Bollob\u00e1s. 2013. Modern Graph Theory. Vol. 184. Springer Science & Business Media."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.185"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190689"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2466971"},{"key":"e_1_2_1_13_1","volume-title":"7th International Conference on Learning Representations Workshop on Representation Learning on Graphs and Manifolds.","author":"Cai Chen","year":"2019","unstructured":"Chen Cai and Yusu Wang . 2019 . A simple yet effective baseline for non-attribute graph classification . In 7th International Conference on Learning Representations Workshop on Representation Learning on Graphs and Manifolds. Chen Cai and Yusu Wang. 2019. A simple yet effective baseline for non-attribute graph classification. In 7th International Conference on Learning Representations Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081948"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6215-6_19"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2466444"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01449.x"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2012.39"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.128"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.131"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1038262.1038799"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0086028"},{"key":"e_1_2_1_24_1","volume-title":"Clustering aggregation. ACM Transactions on Knowledge Discovery from Data 1, 1","author":"Gionis Aristides","year":"2007","unstructured":"Aristides Gionis , Heikki Mannila , and Panayiotis Tsaparas . 2007. Clustering aggregation. ACM Transactions on Knowledge Discovery from Data 1, 1 ( 2007 ), 4. Aristides Gionis, Heikki Mannila, and Panayiotis Tsaparas. 2007. Clustering aggregation. ACM Transactions on Knowledge Discovery from Data 1, 1 (2007), 4."},{"key":"e_1_2_1_25_1","volume-title":"Newman","author":"Girvan Michelle","year":"2002","unstructured":"Michelle Girvan and Mark E. J . Newman . 2002 . Community structure in social and biological networks. In Proceedings of the National Academy of Sciences. Vol. 99 . National Academy of Sciences , 7821--7826. Michelle Girvan and Mark E. J. Newman. 2002. Community structure in social and biological networks. In Proceedings of the National Academy of Sciences. Vol. 99. National Academy of Sciences, 7821--7826."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems. 1024--1034","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton , Rex Ying , and Jure Leskovec . 2017 . Representation learning on graphs: Methods and applications . In Proceedings of the Advances in Neural Information Processing Systems. 1024--1034 . William L. Hamilton, Rex Ying, and Jure Leskovec. 2017. Representation learning on graphs: Methods and applications. In Proceedings of the Advances in Neural Information Processing Systems. 1024--1034."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing.","volume":"95","author":"Hendrickson Bruce","year":"1995","unstructured":"Bruce Hendrickson and Robert Leland . 1995 . A multi-level algorithm for partitioning graphs . In Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing. Vol. 95 . 1--14. Bruce Hendrickson and Robert Leland. 1995. A multi-level algorithm for partitioning graphs. In Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing. Vol. 95. 1--14."},{"key":"e_1_2_1_29_1","first-page":"37","article-title":"Efficient, high-quality force-directed graph drawing","volume":"10","author":"Hu Yifan","year":"2005","unstructured":"Yifan Hu . 2005 . Efficient, high-quality force-directed graph drawing . Mathematica Journal 10 , 1 (2005), 37 -- 71 . Yifan Hu. 2005. Efficient, high-quality force-directed graph drawing. Mathematica Journal 10, 1 (2005), 37--71.","journal-title":"Mathematica Journal"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.981847"},{"key":"e_1_2_1_32_1","volume-title":"Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011","author":"Kobourov Stephen G.","year":"2012","unstructured":"Stephen G. Kobourov . 2012. Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011 ( 2012 ). Stephen G. Kobourov. 2012. Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011 (2012)."},{"key":"e_1_2_1_33_1","unstructured":"Gueorgi Kossinets. 2012. Processed Wikipedia edit history. Retrieved from http:\/\/snap.stanford.edu\/data\/bigdata\/wikipedia08\/enwiki-20080103.  Gueorgi Kossinets. 2012. Processed Wikipedia edit history. Retrieved from http:\/\/snap.stanford.edu\/data\/bigdata\/wikipedia08\/enwiki-20080103."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2743858"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219980"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SHPCC.1994.296707"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 4th International AAAI Conference on Weblogs and Social Media.","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec , Daniel Huttenlocher , and Jon Kleinberg . 2010 . Governance in social media: A case study of the wikipedia promotion process . In Proceedings of the 4th International AAAI Conference on Weblogs and Social Media. Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. 2010. Governance in social media: A case study of the wikipedia promotion process. In Proceedings of the 4th International AAAI Conference on Weblogs and Social Media."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818517.2818542"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the IEEE Conference on Visual Analytics Science and Technology (VAST\u201915)","author":"Liu Qingsong","year":"2015","unstructured":"Qingsong Liu , Yifan Hu , Lei Shi , Xinzhu Mu , Yutao Zhang , and Jie Tang . 2015 . EgoNetCloud: Event-based egocentric dynamic network visualization . In Proceedings of the IEEE Conference on Visual Analytics Science and Technology (VAST\u201915) . IEEE, 65--72. Qingsong Liu, Yifan Hu, Lei Shi, Xinzhu Mu, Yutao Zhang, and Jie Tang. 2015. EgoNetCloud: Event-based egocentric dynamic network visualization. In Proceedings of the IEEE Conference on Visual Analytics Science and Technology (VAST\u201915). IEEE, 65--72."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767925"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594262613"},{"key":"e_1_2_1_42_1","volume-title":"International Conference on Machine Learning. 4663--4673","author":"Murphy Ryan","year":"2019","unstructured":"Ryan Murphy , Balasubramaniam Srinivasan , Vinayak Rao , and Bruno Ribeiro . 2019 . Relational pooling for graph representations . In International Conference on Machine Learning. 4663--4673 . Ryan Murphy, Balasubramaniam Srinivasan, Vinayak Rao, and Bruno Ribeiro. 2019. Relational pooling for graph representations. In International Conference on Machine Learning. 4663--4673."},{"key":"e_1_2_1_43_1","volume-title":"Graph2Vec: Learning distributed representations of graphs. ArXiv abs\/1707.05005","author":"Narayanan Annamalai","year":"2017","unstructured":"Annamalai Narayanan , Mahinthan Chandramohan , Rajasekar Venkatesan , Lihui Chen , Yang P. Liu , and Shantanu Jaiswal . 2017. Graph2Vec: Learning distributed representations of graphs. ArXiv abs\/1707.05005 ( 2017 ). Annamalai Narayanan, Mahinthan Chandramohan, Rajasekar Venkatesan, Lihui Chen, Yang P. Liu, and Shantanu Jaiswal. 2017. Graph2Vec: Learning distributed representations of graphs. ArXiv abs\/1707.05005 (2017)."},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems. 849--856","author":"Ng Andrew","year":"2001","unstructured":"Andrew Ng , Michael I. Jordan , and Yair Weiss . 2001 . On spectral clustering: Analysis and an algorithm . In Proceedings of the Advances in Neural Information Processing Systems. 849--856 . Andrew Ng, Michael I. Jordan, and Yair Weiss. 2001. On spectral clustering: Analysis and an algorithm. In Proceedings of the Advances in Neural Information Processing Systems. 849--856."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975321.35"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2674999"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems. 8026--8037","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke , Sam Gross , Francisco Massa , Adam Lerer , James Bradbury , Gregory Chanan , Trevor Killeen , Zeming Lin , Natalia Gimelshein , Luca Antiga , Alban Desmaison , Andreas Kopf , Edward Yang , Zachary DeVito , Martin Raison , Alykhan Tejani , Sasank Chilamkurthy , Benoit Steiner , Lu Fang , Junjie Bai , and Soumith Chintala . 2019 . Pytorch: An imperative style, high-performance deep learning library . In Proceedings of the Advances in Neural Information Processing Systems. 8026--8037 . Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. Pytorch: An imperative style, high-performance deep learning library. In Proceedings of the Advances in Neural Information Processing Systems. 8026--8037."},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the International Symposium on Graph Drawing.","author":"Purchase Helen C.","year":"2006","unstructured":"Helen C. Purchase , Eve E. Hoggan , and Carsten G\u00f6rg . 2006 . How important is the \u201dmental map\u201d? - An empirical investigation of a dynamic graph layout algorithm . In Proceedings of the International Symposium on Graph Drawing. Helen C. Purchase, Eve E. Hoggan, and Carsten G\u00f6rg. 2006. How important is the \u201dmental map\u201d? - An empirical investigation of a dynamic graph layout algorithm. In Proceedings of the International Symposium on Graph Drawing."},{"key":"e_1_2_1_49_1","first-page":"036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan Usha Nandini","year":"2007","unstructured":"Usha Nandini Raghavan , R\u00e9ka Albert , and Soundar Kumara . 2007 . Near linear time algorithm to detect community structures in large-scale networks . Physical Review 76 , 3 Pt 2 (2007), 036106 . Usha Nandini Raghavan, R\u00e9ka Albert, and Soundar Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical Review 76, 3 Pt 2 (2007), 036106.","journal-title":"Physical Review"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3172867"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-016-5582-8"},{"key":"e_1_2_1_52_1","volume-title":"Bergstrom","author":"Rosvall Martin","year":"2008","unstructured":"Martin Rosvall and Carl T . Bergstrom . 2008 . Maps of random walks on complex networks reveal community structure. In Proceedings of the National Academy of Sciences of the United States of America. Vol. 105 . 1118--1123. Martin Rosvall and Carl T. Bergstrom. 2008. Maps of random walks on complex networks reveal community structure. In Proceedings of the National Academy of Sciences of the United States of America. Vol. 105. 1118--1123."},{"key":"e_1_2_1_53_1","volume-title":"6th International Workshop on Social Network Mining and Analysis.","author":"Shang Jiaxing","year":"2012","unstructured":"Jiaxing Shang , Lianchen Liu , Feng Xie , Zhen Chen , Jiajia Miao , Xuelin Fang , and Cheng Wu . 2012 . A real-time detecting algorithm for tracking community structure of dynamic networks . In 6th International Workshop on Social Network Mining and Analysis. Jiaxing Shang, Lianchen Liu, Feng Xie, Zhen Chen, Jiajia Miao, Xuelin Fang, and Cheng Wu. 2012. A real-time detecting algorithm for tracking community structure of dynamic networks. In 6th International Workshop on Social Network Mining and Analysis."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078187"},{"volume-title":"Proceedings of the 12th International Conference on Artificial Intelligence and Statistics. 488--495","author":"Shervashidze Nino","key":"e_1_2_1_55_1","unstructured":"Nino Shervashidze , S. V. N. Vishwanathan , Tobias Petri , Kurt Mehlhorn , and Karsten M. Borgwardt . 2009. Efficient graphlet kernels for large graph comparison . In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics. 488--495 . Nino Shervashidze, S. V. N. Vishwanathan, Tobias Petri, Kurt Mehlhorn, and Karsten M. Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics. 488--495."},{"key":"e_1_2_1_56_1","volume-title":"Robust spectral ensemble clustering via rank minimization. ACM Transactions on Knowledge Discovery from Data 13, 1","author":"Tao Zhiqiang","year":"2019","unstructured":"Zhiqiang Tao , Hongfu Liu , Sheng Li , Zhengming Ding , and Yun Fu. 2019. Robust spectral ensemble clustering via rank minimization. ACM Transactions on Knowledge Discovery from Data 13, 1 ( 2019 ), 4.1--4.25. Zhiqiang Tao, Hongfu Liu, Sheng Li, Zhengming Ding, and Yun Fu. 2019. Robust spectral ensemble clustering via rank minimization. ACM Transactions on Knowledge Discovery from Data 13, 1 (2019), 4.1--4.25."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12512"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12872"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.25"},{"key":"e_1_2_1_60_1","first-page":"3236","article-title":"Multiple structure-view learning for graph classification","volume":"29","author":"Wu Jia","year":"2018","unstructured":"Jia Wu , Shirui Pan , Xingquan Zhu , Chengqi Zhang , and Philip S. Yu . 2018 . Multiple structure-view learning for graph classification . IEEE Transactions on Neural Networks and Learning Systems 29 , 7 (2018), 3236 -- 3251 . Jia Wu, Shirui Pan, Xingquan Zhu, Chengqi Zhang, and Philip S. Yu. 2018. Multiple structure-view learning for graph classification. IEEE Transactions on Neural Networks and Learning Systems 29, 7 (2018), 3236--3251.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2468151"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the Advances in Neural Information Processing Systems.","volume":"32","author":"Ying Zhitao","year":"2019","unstructured":"Zhitao Ying , Dylan Bourgeois , Jiaxuan You , Marinka Zitnik , and Jure Leskovec . 2019 . GNNExplainer: Generating explanations for graph neural networks . In Proceedings of the Advances in Neural Information Processing Systems. Vol. 32 . 9244--9255. Zhitao Ying, Dylan Bourgeois, Jiaxuan You, Marinka Zitnik, and Jure Leskovec. 2019. GNNExplainer: Generating explanations for graph neural networks. In Proceedings of the Advances in Neural Information Processing Systems. Vol. 32. 9244--9255."},{"volume-title":"Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM\u201915)","author":"Zakrzewska Anita","key":"e_1_2_1_65_1","unstructured":"Anita Zakrzewska and David A. Bader . 2015. A dynamic algorithm for local community detection in graphs . In Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM\u201915) . 559--564. Anita Zakrzewska and David A. Bader. 2015. A dynamic algorithm for local community detection in graphs. In Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM\u201915). 559--564."},{"key":"e_1_2_1_66_1","volume-title":"Proceedings of the International Conference on Learning Representations.","author":"Zhang Xinyi","year":"2019","unstructured":"Xinyi Zhang and Lihui Chen . 2019 . Capsule graph neural network . In Proceedings of the International Conference on Learning Representations. Xinyi Zhang and Lihui Chen. 2019. Capsule graph neural network. In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3441301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:04Z","timestamp":1750197784000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8,31]]}},"alternative-id":["10.1145\/3441301"],"URL":"https:\/\/doi.org\/10.1145\/3441301","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"assertion":[{"value":"2020-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}