Enhancing Algorithmic Techniques for Streamlined Complex Graph Structures in Big Data Visualization
Received: 27 November 2024 | Revised: 23 December 2024 | Accepted: 1 January 2025 | Online: 3 April 2025
Corresponding author: Khalid Hamad Alnafisah
Abstract
With the rapid expansion of data applications, particularly in large and complex graph structures, effective visualization and analysis tools are essential. This paper addresses the "Hair Ball" problem, where excessive node and edge intersections hinder the clear interpretation of networks. To mitigate this issue, an efficient algorithm based on the K3,4 bipartite graph model is proposed. The model is systematically compressed to reduce intersecting edges while preserving essential structural relationships. The algorithm was tested on various datasets, ranging from small synthetic networks to large real-world graphs. The results demonstrate significant reductions in visual complexity and improved clarity. Key performance metrics, including edge density reduction and observer feedback, validate the scalability and practical applicability of the proposed approach in big data environments. By simplifying intricate graph structures, this method offers a versatile and effective solution for applications in network analysis, data visualization, and related fields.
Keywords:
big data visualization, hair ball problem, graph simplification, K3,4 bipartite model, network clarity, data visualization algorithmDownloads
References
A. K. O’Hair, "The Geometric Structure of Spanning Trees and Applications to Multiobjective Optimization," B.S. thesis, UCLA College of Letters and Science, Los Angeles, CA, USA, 2009.
K. H. Rosen, "Graphs", in Discrete mathematics and its applications, 5th ed. New York, NY, USA: McGraw Hill, 2003.
L. Spadavecchia, "A Network-based Asynchronous Architecture for Cryptographic Devices," PhD Thesis, Institute of Computing System Architecture, University of Edinburgh, Edinburgh, UK, 2006.
C. L. Vidal-Silva et al., "Advantages of Giraph over Hadoop in Graph Processing," Engineering, Technology & Applied Science Research, vol. 9, no. 3, pp. 4112–4115, 2019.
R. Admiraal and M. S. Handcock, "networksis: A Package to Simulate Bipartite Graphs with Fixed Marginals Through Sequential Importance Sampling," Journal of statistical software, vol. 24, no. 8, Feb. 2008.
F. Akutsah, "Minimum spanning tree route for major tourist centers in the Brong Ahafo Region of Ghana." PhD dissertation., Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana, 2011.
C. T. Butts, "Network: A Package for Managing Relational Data in R," Journal of Statistical Software, vol. 24, no. 2, May 2008.
K. Cherven, Mastering Gephi Network Visualization, 1st ed. Brimingham, UK: Packt Publishing Ltd, 2015.
K. H. Alnafisah, "An Algorithmic Solution for the ‘Hair Ball’ Problem in Data Visualization," Journal of Engineering Sciences & Information Technology, vol. 2, no. 4, pp. 66–86, Dec. 2018.
T. Awal and Md. S. Rahman, "A linear algorithm for resource four-partitioning four-connected planar graphs," in International Conference on Electrical & Computer Engineering (ICECE 2010), Dhaka, Bangladesh, Dec. 2010, pp. 526–529.
B. B. Bai, W. Chen, K. B. Letaief, and Z. Cao, "Diversity-Multiplexing Tradeoff in OFDMA Systems: An H-Matching Approach," IEEE Transactions on Wireless Communications, vol. 10, no. 11, pp. 3675–3687, Nov. 2011.
K. Cherven, Network Graph Analysis and Visualization with Gephi, 1st ed. Brimingham, UK: Packt Publishing, 2013.
C. F. Dormann, B. Gruber, and J. Fründ, "Introducing the bipartite package: analyzing ecological networks," interaction, vol. 8, no. 2, pp. 8–11, 2008.
Y. Egawa and M. Furuya, "Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order," Graphs and Combinatorics, vol. 30, no. 5, pp. 1149–1162, Sep. 2014.
K. Etemad, S. Carpendale, and F. Samavati, "Spirograph inspired visualization of ecological networks," in Proceedings of the Workshop on Computational Aesthetics, New York, NY, USA, Aug. 2014, pp. 81–91.
J. Gentry, R. Gentleman, and W. Huber, "How to plot a graph using rgraphviz," 2010.
E. J. Hartung, "The Linear and Cyclic Wirelength of Complete Bipartite Graphs," 2004.
L. Huang, G. Wang, Y. Wang, E. Blanzieri, and C. Su, "Link Clustering with Extended Link Similarity and EQ Evaluation Division," PLOS ONE, vol. 8, no. 6, Jun. 2013, Art. no. e66005.
A. Gibbons, Algorithmic Graph Theory, 1st ed. New York, NY, USA: Cambridge University Press, 1985.
M. S. Kelker, E. W. Debler, and I. A. Wilson, "Crystal Structure of Mouse Triggering Receptor Expressed on Myeloid Cells 1 (TREM-1) at 1.76 Å," Journal of Molecular Biology, vol. 344, no. 5, pp. 1175–1181, Dec. 2004.
S. Lehmann, M. Schwartz, and L. K. Hansen, "Biclique communities," Physical Review Journal, vol. 78, no. 1, Jul. 2008, Art. no. 016108.
K. Ognyanova, "Static and dynamic network visualization with R," 2023.
R. Said, N. Zitouni, V. Mînzu, and A. Mami, "Modeling and Simulation of a UV Water Treatment System Fed by a GPV Source Using the Bond Graph Approach," Engineering, Technology & Applied Science Research, vol. 12, no. 3, pp. 8559–8566, Jun. 2022.
M. L. Rizzo, Statistical Computing with R, 2nd ed. New York, NY, USA: Chapman and Hall/CRC, 2019.
A. N. Katov, A. Mihovska, and N. R. Prasad, "Hybrid SDN architecture for resource consolidation in MPLS networks," in 2015 Wireless Telecommunications Symposium (WTS), New York, NY, USA, Apr. 2015, pp. 1–8
K. Ognyanova, "Basic and advanced network visualization with R." 2016.
M. Parker and C. Lewis, "Why is big-O analysis hard?," in Proceedings of the 13th Koli Calling International Conference on Computing Education Research, New York, NY, USA, Nov. 2013, pp. 201–202.
Downloads
How to Cite
License
Copyright (c) 2025 Khalid Hamad Alnafisah
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain the copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) after its publication in ETASR with an acknowledgement of its initial publication in this journal.
