Part of the book series:Lecture Notes in Electrical Engineering ((LNEE,volume 810))
Included in the following conference series:
324Accesses
Abstract
In order to visualize the important information in the knowledge graph and visualize the graph data constituting the knowledge graph for visual analysis, this paper optimizes and combines the Louvain algorithm and the force-directed graph algorithm to propose a force-directed graph layout based on community discovery and clustering optimization for the graph data. This paper uses the pruning idea to optimize the calculation steps and the community merging in the Louvain algorithm and obtains a community discovery algorithm that is more efficient and more conducive to optimizing the effect of graph layout, and introduces group elements into the force-directed graph layout to represent the community structure in graph data and implement group-based clustering optimization, so that the force-directed graph layout can clearly display the discovered community structure analyzed by the community discovery algorithm when displaying graph data, and optimize the effect and readability of the graph layout for visual analysis.
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 28599
- Price includes VAT (Japan)
- Softcover Book
- JPY 35749
- Price includes VAT (Japan)
- Hardcover Book
- JPY 35749
- Price includes VAT (Japan)
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Yan J, Wang C, Cheng W, et al.: A retrospective of knowledge graphs. Frontiers of Computer Science 12(1), (2018).
Ren L, Du Y, Ma S, et al.: Visual analytics towards big data. Ruan Jian Xue Bao/Journal of Software 25(9), 1909–1936 (2014).
Wang Yongchao, Luo Shengwen, Yang Yingbao, et al.: A Survey on Knowledge Graph Visualization. Journal of Computer-Aided Design & Computer Graphics 31(10), 1666–1676 (2019).
Liu, S., Xiao, Z., You, X. and Su, R., 2022. Multistrategy boosted multicolony whale virtual parallel optimization approaches. Knowledge-Based Systems, 242, p. 108341.
Wang Y, Wang Y, Sun Y, et al.: Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization. IEEE Transactions on Visualization and Computer Graphics 24(1), 489–499 (2018).
Ashley Suh, Mustafa Hajij, Bei Wang, et al.: Persistent Homology Guided Force-Directed Graph Layouts. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 26(1), 697–707 (2020).
Jochen Gortler, Christoph Schulz, Daniel Weiskopf, et al.: Bubble Treemaps for Uncertainty Visualization. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 24(1), 719–728 (2018).
Ge H.A, Yong L.B, Xu T.C, et al.: PLANET: A radial layout algorithm for network visualization. Physica A 539, (2020).
Holger Stitz, Samuel Gratzl, Harald Piringer, et al.: KnowledgePearls: Provenance-Based Visualization Retrieval. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 25(1) 120–130 (2019).
Timothy M, Basole R C: Graphicle: Exploring Units, Networks, and Context in a Blended Visualization Approach. IEEE Transactions on Visualization and Computer Graphics 25(1), 576–585 (2019).
Su R., Gu, Q. and Wen, T., 2014. Optimization of high-speed train control strategy for traction energy saving using an improved genetic algorithm. Journal of Applied Mathematics, 2014.
Rieck B, Fugacci U, Lukasczyk J, et al.: Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks. IEEE Transactions on Visualization & Computer Graphics 24(1), 822–831 (2018).
VINCENT D B, GUILLAUME J L, RENAUD L, et al.: Fast unfolding of communities in large network. Journal of Statistical Mechanics: Theory and Experiment 10, 1–12 (2008).
WU Zu-feng, WANG Peng-fei, QIN Zhi-guang, et al.: Improved Algorithm of Louvain Communities Dipartition. Journal of University of Electronic Science and Technology of China 42(1), 105–108 (2013).
EADES P: A heuristic for graph drawing. Congressus numerantium 42, 149–160 (1984).
KAMADA T, KAWAI S, et al.: An algorithm for drawing general undirected graphs. Information processing letters 31(1), 7–15 (1989).
FRUCHTERMAN T M J, REINGOLD E M: Graph drawing by force-directed placement. Software Practice & Experience 21(1) 1129–1164 (1991).
Khoury M, Hu Y, Krishnan S, et al.: Drawing Large Graphs by Low-Rank Stress Majorization. Computer Graphics Forum, (2012).
Yoghourdjian V, Dwyer T, Klein K, et al.: Graph Thumbnails: Identifying and Comparing Multiple Graphs at a Glance. IEEE Transactions on Visualization and Computer Graphics 24(12), 3081–3095 (2018).
Yunhai Wang, Mingliang Xue, Yanyan, et al.: Wang Interactive Structure-aware Blending of Diverse Edge Bundling Visualizations. IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 26(1), 687–696 (2020).
Wu Yu, Li Zaoxu, Li Hongbo, et al.: A community-gravity directed algorithm for showing community structure of complex networks. Journal of Computer-Aided Design & Computer Graphics 27(8), 1460–1467 (2015).
Hao Runqian, Wu Yu, Chen Xin: An Algorithm for Large-scale Social Network Community Detection and Visualization. Journal of Computer-Aided Design & Computer Graphics 29(2), (2017).
Author information
Authors and Affiliations
Northeastern University, Shenyang, Liaoning, China
Linshan Han, Beilei Wang & Songyao Wang
- Linshan Han
You can also search for this author inPubMed Google Scholar
- Beilei Wang
You can also search for this author inPubMed Google Scholar
- Songyao Wang
You can also search for this author inPubMed Google Scholar
Corresponding author
Correspondence toBeilei Wang.
Editor information
Editors and Affiliations
Department of Computer Sciences and Engineering, Shanghai Jiao Tong University, Shanghai, China
Ruidan Su
Department of Informatics, University of Leicester, Leicester, UK
Yudong Zhang
College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, Guangdong, China
Han Liu
Computational Medicine, University of Manchester, Manchester, UK
Alejandro F Frangi
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Han, L., Wang, B., Wang, S. (2023). Force-Directed Graph Layout Based on Community Discovery and Clustering Optimization. In: Su, R., Zhang, Y., Liu, H., F Frangi, A. (eds) Medical Imaging and Computer-Aided Diagnosis. MICAD 2022. Lecture Notes in Electrical Engineering, vol 810. Springer, Singapore. https://doi.org/10.1007/978-981-16-6775-6_46
Download citation
Published:
Publisher Name:Springer, Singapore
Print ISBN:978-981-16-6774-9
Online ISBN:978-981-16-6775-6
eBook Packages:MedicineMedicine (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative