{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:25Z","timestamp":1750220905568,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,9,20]]},"DOI":"10.1145\/3356422.3356446","type":"proceedings-article","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T13:26:41Z","timestamp":1574083601000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Frequent Pattern-based Graph Exploration"],"prefix":"10.1145","author":[{"given":"Kai","family":"Yan","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, Harbin, Heilongjiang, China"}]},{"given":"Weiwei","family":"Cui","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Tiejun","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, Harbin, Heilongjiang, China"}]}],"member":"320","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Large Graph Exploration via Subgraph Discovery and Decomposition. arXiv:1808.04414 [cs] (Aug","author":"Abello James","year":"2018","unstructured":"James Abello , Fred Hohman , Varun Bezzam , and Duen Horng Chau . 2018. Large Graph Exploration via Subgraph Discovery and Decomposition. arXiv:1808.04414 [cs] (Aug . 2018 ). http:\/\/arxiv.org\/abs\/1808.04414 arXiv: 1808.04414. James Abello, Fred Hohman, Varun Bezzam, and Duen Horng Chau. 2018. Large Graph Exploration via Subgraph Discovery and Decomposition. arXiv:1808.04414 [cs] (Aug. 2018). http:\/\/arxiv.org\/abs\/1808.04414 arXiv: 1808.04414."},{"key":"e_1_3_2_1_2_1","volume-title":"Theodore L Willke, Rong Zhou, Xi-angnan Kong, and Hoda Eldardiry.","author":"Ahmed Nesreen K","year":"2018","unstructured":"Nesreen K Ahmed , Ryan Rossi , John Boaz Lee , Theodore L Willke, Rong Zhou, Xi-angnan Kong, and Hoda Eldardiry. 2018 . Learning role-based graph embeddings. arXiv preprint arXiv:1802.02896 (2018). Nesreen K Ahmed, Ryan Rossi, John Boaz Lee, Theodore L Willke, Rong Zhou, Xi-angnan Kong, and Hoda Eldardiry. 2018. Learning role-based graph embeddings. arXiv preprint arXiv:1802.02896 (2018)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90049-1"},{"key":"e_1_3_2_1_4_1","volume-title":"Role action embeddings: scalable representation of network positions. arXiv preprint arXiv:1811.08019","author":"Berry George","year":"2018","unstructured":"George Berry . 2018. Role action embeddings: scalable representation of network positions. arXiv preprint arXiv:1811.08019 ( 2018 ). George Berry. 2018. Role action embeddings: scalable representation of network positions. arXiv preprint arXiv:1811.08019 (2018)."},{"key":"e_1_3_2_1_5_1","volume-title":"Mining Large Networks with Subgraph Counting. In Eighth IEEE International Conference on Data Mining.","author":"Bordino I","year":"2009","unstructured":"I Bordino , D Donato , A Gionis , and S Leonardi . 2009 . Mining Large Networks with Subgraph Counting. In Eighth IEEE International Conference on Data Mining. I Bordino, D Donato, A Gionis, and S Leonardi. 2009. Mining Large Networks with Subgraph Counting. In Eighth IEEE International Conference on Data Mining."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2865139"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2466444"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2007.74"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45372-5_2"},{"key":"e_1_3_2_1_13_1","volume-title":"Finding frequent patterns in a large sparse graph. Data mining and knowledge discovery 11, 3","author":"Kuramochi Michihiro","year":"2005","unstructured":"Michihiro Kuramochi and George Karypis . 2005. Finding frequent patterns in a large sparse graph. Data mining and knowledge discovery 11, 3 ( 2005 ), 243--271. Michihiro Kuramochi and George Karypis. 2005. Finding frequent patterns in a large sparse graph. Data mining and knowledge discovery 11, 3 (2005), 243--271."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.138"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3025453.3025942"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40596-4_46"},{"key":"e_1_3_2_1_18_1","volume-title":"subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928","author":"Narayanan Annamalai","year":"2016","unstructured":"Annamalai Narayanan , Mahinthan Chandramohan , Lihui Chen , Yang Liu , and Santhoshkumar Saminathan . 2016. subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928 ( 2016 ). Annamalai Narayanan, Mahinthan Chandramohan, Lihui Chen, Yang Liu, and Santhoshkumar Saminathan. 2016. subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928 (2016)."},{"key":"e_1_3_2_1_19_1","volume-title":"subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928","author":"Narayanan Annamalai","year":"2016","unstructured":"Annamalai Narayanan , Mahinthan Chandramohan , Lihui Chen , Yang Liu , and Santhoshkumar Saminathan . 2016. subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928 ( 2016 ). Annamalai Narayanan, Mahinthan Chandramohan, Lihui Chen, Yang Liu, and Santhoshkumar Saminathan. 2016. subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928 (2016)."},{"key":"e_1_3_2_1_20_1","volume-title":"graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 (","author":"Narayanan Annamalai","year":"2017","unstructured":"Annamalai Narayanan , Mahinthan Chandramohan , Rajasekar Venkatesan , Lihui Chen , Yang Liu , and Shantanu Jaiswal . 2017. graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 ( 2017 ). Annamalai Narayanan, Mahinthan Chandramohan, Rajasekar Venkatesan, Lihui Chen, Yang Liu, and Shantanu Jaiswal. 2017. graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005 ( 2017)."},{"key":"e_1_3_2_1_21_1","volume-title":"Hanspeter Pfister, Dieter Schmalstieg, and Alexander Lex.","author":"Partl Christian","year":"2016","unstructured":"Christian Partl , Samuel Gratzl , Marc Streit , Anne Mai Wassermann , Hanspeter Pfister, Dieter Schmalstieg, and Alexander Lex. 2016 . Pathfinder : Visual analysis of paths in graphs. In Computer Graphics Forum, Vol. 35 . Wiley Online Library , 71--80. Christian Partl, Samuel Gratzl, Marc Streit, Anne Mai Wassermann, Hanspeter Pfister, Dieter Schmalstieg, and Alexander Lex. 2016. Pathfinder: Visual analysis of paths in graphs. In Computer Graphics Forum, Vol. 35. Wiley Online Library, 71--80."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1104-7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/35021BIGCOMP.2015.7072812"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.03.198"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.67"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346441"},{"key":"e_1_3_2_1_29_1","volume-title":"Structure-aware Fisheye Views for Efficient Large Graph Exploration","author":"Wang Yunhai","year":"2018","unstructured":"Yunhai Wang , Yanyan Wang , Haifeng Zhang , Yinqi Sun , Chi-Wing Fu , Michael Sedlmair , Baoquan Chen , and Oliver Deussen . 2018. Structure-aware Fisheye Views for Efficient Large Graph Exploration . IEEE transactions on visualization and computer graphics 25, 1 ( 2018 ), 566--575. Yunhai Wang, Yanyan Wang, Haifeng Zhang, Yinqi Sun, Chi-Wing Fu, Michael Sedlmair, Baoquan Chen, and Oliver Deussen. 2018. Structure-aware Fisheye Views for Efficient Large Graph Exploration. IEEE transactions on visualization and computer graphics 25, 1 (2018), 566--575."},{"key":"e_1_3_2_1_30_1","volume-title":"2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 721--724","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han . 2002 . gspan: Graph-based substructure pattern mining . In 2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 721--724 . Xifeng Yan and Jiawei Han. 2002. gspan: Graph-based substructure pattern mining. In 2002 IEEE International Conference on Data Mining, 2002. Proceedings. IEEE, 721--724."},{"key":"e_1_3_2_1_31_1","volume-title":"cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining. BMC bioinformatics 19, 4","author":"Yang Shunyun","year":"2018","unstructured":"Shunyun Yang , Runxin Guo , Rui Liu , Xiangke Liao , Quan Zou , Benyun Shi , and Shaoliang Peng . 2018. cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining. BMC bioinformatics 19, 4 ( 2018 ), 98. Shunyun Yang, Runxin Guo, Rui Liu, Xiangke Liao, Quan Zou, Benyun Shi, and Shaoliang Peng. 2018. cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining. BMC bioinformatics 19, 4 (2018), 98."},{"volume-title":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '17)","author":"Yin Hao","key":"e_1_3_2_1_32_1","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 (KDD '17) . ACM, New York, NY, USA, 555--564. 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 (KDD '17). ACM, New York, NY, USA, 555--564. https:\/\/doi.org\/10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.238"}],"event":{"name":"VINCI'2019: The 12th International Symposium on Visual Information Communication and Interaction","sponsor":["East China Normal University"],"location":"Shanghai China","acronym":"VINCI'2019"},"container-title":["Proceedings of the 12th International Symposium on Visual Information Communication and Interaction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3356422.3356446","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3356422.3356446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:52Z","timestamp":1750203892000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3356422.3356446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,20]]},"references-count":33,"alternative-id":["10.1145\/3356422.3356446","10.1145\/3356422"],"URL":"https:\/\/doi.org\/10.1145\/3356422.3356446","relation":{},"subject":[],"published":{"date-parts":[[2019,9,20]]},"assertion":[{"value":"2019-09-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}