Kai Yan
ABSTRACT
Visual graph exploration can help the users have an intuitive impression about a dataset for the first time. However, it is better to provide some guidance so that the users can quickly locate the "interesting" or "informative" area in the graph. Then they can start the next stage of sense-making. We propose a visual exploration system which provides some frequent sub-graphs extracted from the whole graph, and the relationship between them. Thus, users can raise their study questions more quickly when they first confront a graph dataset. We evaluate our exploration system with two datasets. Specifically, we demonstrate how to raise a question and find the answer with our system, which validates the effectiveness of this project.
- 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.Google Scholar
- 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).Google Scholar
- H. G. Barrow and R. M. Burstall. 1976. Subgraph isomorphism, matching relational structures and maximal cliques. Inform. Process. Lett. 4, 4 (1976), 83--84.Google ScholarCross Ref
- George Berry. 2018. Role action embeddings: scalable representation of network positions. arXiv preprint arXiv:1811.08019 (2018).Google Scholar
- I Bordino, D Donato, A Gionis, and S Leonardi. 2009. Mining Large Networks with Subgraph Counting. In Eighth IEEE International Conference on Data Mining.Google Scholar
- Wei Chen, Fangzhou Guo, Dongming Han, Jacheng Pan, Xiaotao Nie, Jiazhi Xia, and Xiaolong Zhang. 2019. Structure-Based Suggestive Exploration: A New Approach for Effective Exploration of Large Networks. IEEE Transactions on Visualization and Computer Graphics 25, 1 (Jan. 2019), 555--565. https://doi.org/10.1109/TVCG.2018.2865139Google ScholarDigital Library
- Cody Dunne and Ben Shneiderman. 2013. Motif Simplification: Improving Network Visualization Readability with Fan, Connector, and Clique Glyphs. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI '13). ACM, New York, NY, USA, 3247--3256. https://doi.org/10.1145/2470654.2466444Google ScholarDigital Library
- Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. 2014. GraMi: Frequent Subgraph and Pattern Mining in a Single Large Graph. Proc. VLDB Endow. 7, 7 (March 2014), 517--528. https://doi.org/10.14778/2732286.2732289Google ScholarDigital Library
- Mathias Fiedler and Christian Borgelt. 2007. Subgraph support in a single large graph. In Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007). IEEE, 399--404.Google ScholarDigital Library
- Palash Goyal and Emilio Ferrara. 2018. Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Systems 151 (2018), 78--94.Google ScholarCross Ref
- Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 855--864.Google ScholarDigital Library
- Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. 2000. An apriori-based algorithm for mining frequent substructures from graph data. In European conference on principles of data mining and knowledge discovery. Springer, 13--23.Google ScholarCross Ref
- Michihiro Kuramochi and George Karypis. 2005. Finding frequent patterns in a large sparse graph. Data mining and knowledge discovery 11, 3 (2005), 243--271.Google Scholar
- Jure Leskovec, Jon Kleinberg, and Christos Faloutsos. 2007. Graph Evolution: Densification and Shrinking Diameters. ACM Trans. Knowl. Discov. Data 1, 1, Article 2 (March 2007). https://doi.org/10.1145/1217299.1217301Google ScholarDigital Library
- Gori Marco, Maggini Marco, and Sarti Lorenzo. 2005. Exact and approximate graph matching using random walks. IEEE Transactions on Pattern Analysis & Machine Intelligence 27, 7 (2005), 1100--1111.Google ScholarDigital Library
- Gonzalo Gabriel Méndez, Uta Hinrichs, and Miguel A Nacenta. 2017. Bottom-up vs. top-down: trade-offs in efficiency, understanding, freedom and creativity with InfoVis tools. In Proceedings of the 2017 CHI conference on human factors in computing systems. ACM, 841--852.Google ScholarDigital Library
- Mohamed Moussaoui, Montaceur Zaghdoud, and Jalel Akaichi. 2016. Posgrami: possibilistic frequent subgraph mining in a single large graph. In International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems. Springer, 549--561.Google ScholarCross Ref
- 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).Google Scholar
- 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).Google Scholar
- 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).Google Scholar
- 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.Google Scholar
- Zhe Peng, Tongtong Wang, Wei Lu, Hao Huang, Xiaoyong Du, Feng Zhao, and Anthony KH Tung. 2018. Mining frequent subgraphs from tremendous amount of small graphs using MapReduce. Knowledge and Information Systems 56, 3 (2018), 663--690.Google ScholarDigital Library
- Robert Pienta, James Abello, Minsuk Kahng, and Duen Horng Chau. 2015. Scalable graph exploration and visualization: Sensemaking challenges and opportunities. In 2015 International Conference on Big Data and Smart Computing (BIGCOMP). IEEE, 271--278.Google ScholarCross Ref
- T Ramraj and R Prabhakar. 2015. Frequent Subgraph Mining Algorithms-A Survey. Procedia Computer Science 47 (2015), 197--204.Google ScholarCross Ref
- Leonardo FR Ribeiro, Pedro HP Saverese, and Daniel R Figueiredo. 2017. struc2vec: Learning node representations from structural identity. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 385--394.Google ScholarDigital Library
- Robert Pienta, Minsuk Kahng, Zhiyuan Lin, Jilles Vreeken, Partha Talukdar, James Abello, Ganesh Parameswaran, and Duen Horng Chau. 2017. FACETS: Adaptive Local Exploration of Large Graphs. In Proceedings of the 2017 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, Philadelphia, PA, 597--605. https://doi.org/doi:10.1137/1.9781611974973.67Google ScholarCross Ref
- Zhao Sun, Hongzhi Wang, Haixun Wang, Bin Shao, and Jianzhong Li. 2012. Efficient subgraph matching on billion node graphs. Proceedings of the Vldb Endowment 5, 9 (2012), 788--799.Google ScholarDigital Library
- Stef Van den Elzen and Jarke J Van Wijk. 2014. Multivariate network exploration and presentation: From detail to overview via selections and aggregations. IEEE Transactions on Visualization and Computer Graphics 20, 12 (2014), 2310--2319.Google ScholarCross Ref
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.3098069Google ScholarDigital Library
- Michael Zinsmaier, Ulrik Brandes, Oliver Deussen, and Hendrik Strobelt. 2012. Interactive level-of-detail rendering of large graphs. IEEE Transactions on Visualization and Computer Graphics 18, 12 (2012), 2486--2495.Google ScholarDigital Library
Index Terms
- Frequent Pattern-based Graph Exploration
Recommendations
Graph Exploration: From Users to Large Graphs
SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of DataThe increasing interest in social networks, knowledge graphs, protein-interaction, and many other types of networks has raised the question how users can explore such large and complex graph structures easily. Current tools focus on graph management, ...
iSphere: Focus+Context Sphere Visualization for Interactive Large Graph Exploration
CHI '17: Proceedings of the 2017 CHI Conference on Human Factors in Computing SystemsInteractive exploration plays a critical role in large graph visualization. Existing techniques, such as zoom-and-pan on a 2D plane and hyperbolic browser facilitate large graph exploration by showing both the details of a focal area and its surrounding ...
Graph Mining Framework for Finding and Visualizing Substructures Using Graph Database
ASONAM '09: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and MiningIn the scientific and commercial domains, graph as a data structure has become increasingly important for modeling sophisticated structures especially the interactions within them. Mining the knowledge from graph data has become a major research topic ...
Comments