{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:23:25Z","timestamp":1760239405837,"version":"build-2065373602"},"reference-count":47,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Graph visualization has been successfully applied in a wide range of problems and applications. Although different approaches are available to create visual representations, most of them suffer from clutter when faced with many nodes and\/or edges. Among the techniques that address this problem, edge bundling has attained relative success in improving node-link layouts by bending and aggregating edges. Despite their success, most approaches perform the bundling based only on visual space information. There is no explicit connection between the produced bundled visual representation and the underlying data (edges or vertices attributes). In this paper, we present a novel edge bundling technique, called Similarity-Driven Edge Bundling (SDEB), to address this issue. Our method creates a similarity hierarchy based on a multilevel partition of the data, grouping edges considering the similarity between nodes to guide the bundling. The novel features introduced by SDEB are explored in different application scenarios, from dynamic graph visualization to multilevel exploration. Our results attest that SDEB produces layouts that consistently follow the similarity relationships found in the graph data, resulting in semantically richer presentations that are less cluttered than the state-of-the-art.<\/jats:p>","DOI":"10.3390\/a13110290","type":"journal-article","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T14:10:41Z","timestamp":1605017441000},"page":"290","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Similarity-Driven Edge Bundling: Data-Oriented Clutter Reduction in Graphs Layouts"],"prefix":"10.3390","volume":"13","author":[{"given":"Fabio","family":"Sikansi","sequence":"first","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e de Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo, S\u00e3o Carlos, SP 13566-590, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato R. O.","family":"da Silva","sequence":"additional","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e de Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo, S\u00e3o Carlos, SP 13566-590, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel D.","family":"Cantareira","sequence":"additional","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e de Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo, S\u00e3o Carlos, SP 13566-590, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elham","family":"Etemad","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS B3H 4R2, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2316-760X","authenticated-orcid":false,"given":"Fernando V.","family":"Paulovich","sequence":"additional","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e de Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo, S\u00e3o Carlos, SP 13566-590, Brazil"},{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS B3H 4R2, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,11,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1093\/bioinformatics\/bth494","article-title":"ProViz: Protein interaction visualization and exploration","volume":"21","author":"Iragne","year":"2004","journal-title":"Bioinformatics"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Martin, A., Ochagavia, M., Rabasa, L., Miranda, J., Fern\u00e1ndez-de Cossio, J., and Bringas, R. (2010). BisoGenet: A new tool for gene network building, visualization and analysis. BMC Bioinform., 11.","DOI":"10.1186\/1471-2105-11-91"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s11390-012-1265-5","article-title":"Multidimensional Projections for Visual Analysis of Social Networks","volume":"27","author":"Martins","year":"2012","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/2945.841119","article-title":"Graph visualization and navigation in information visualization: A survey","volume":"6","author":"Herman","year":"2000","journal-title":"Vis. Comput. Graph. IEEE Trans."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J.J., Fekete, J.D., and Fellner, D.W. (2011). Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges, Wiley Online Library. Computer Graphics Forum.","DOI":"10.1111\/j.1467-8659.2011.01898.x"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/TVCG.2007.70535","article-title":"A taxonomy of clutter reduction for information visualisation","volume":"13","author":"Ellis","year":"2007","journal-title":"Vis. Comput. Graph. IEEE Trans."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TST.2013.6509098","article-title":"Edge bundling in information visualization","volume":"18","author":"Zhou","year":"2013","journal-title":"Tsinghua Sci. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1111\/cgf.13213","article-title":"State of the Art in Edge and Trail Bundling Techniques","volume":"36","author":"Lhuillier","year":"2017","journal-title":"Comput. Graph. Forum"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TVCG.2016.2598958","article-title":"Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization","volume":"23","author":"Bach","year":"2017","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Holten, D., and Van Wijk, J.J. (2009). Force-Directed Edge Bundling for Graph Visualization, Wiley Online Library. Computer Graphics Forum.","DOI":"10.1111\/j.1467-8659.2009.01450.x"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1109\/TVCG.2006.147","article-title":"Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data","volume":"12","author":"Holten","year":"2006","journal-title":"Vis. Comput. Graph. IEEE Trans."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2354","DOI":"10.1109\/TVCG.2011.190","article-title":"Divided edge bundling for directional network data","volume":"17","author":"Selassie","year":"2011","journal-title":"Vis. Comput. Graph. IEEE Trans."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1109\/TVCG.2008.135","article-title":"Geometry-based edge clustering for graph visualization","volume":"14","author":"Cui","year":"2008","journal-title":"Vis. Comput. Graph. IEEE Trans."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Lambert, A., Bourqui, R., and Auber, D. (2010). Winding Roads: Routing Edges into Bundles, Wiley Online Library. Computer Graphics Forum.","DOI":"10.1111\/j.1467-8659.2009.01700.x"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Gansner, E.R., Hu, Y., North, S., and Scheidegger, C. (2011, January 1\u20134). Multilevel agglomerative edge bundling for visualizing large graphs. Proceedings of the 2011 IEEE Pacific Visualization Symposium (PacificVis), Hong Kong, China.","DOI":"10.1109\/PACIFICVIS.2011.5742389"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Bouts, Q.W., and Speckmann, B. (2015, January 14\u201317). Clustered edge routing. Proceedings of the 2015 IEEE Pacific Visualization Symposium (PacificVis), Hangzhou, China.","DOI":"10.1109\/PACIFICVIS.2015.7156356"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Telea, A., and Ersoy, O. (2010). Image-Based Edge Bundles: Simplified Visualization of Large Graphs, Wiley Online Library. Computer Graphics Forum.","DOI":"10.1111\/j.1467-8659.2009.01680.x"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2364","DOI":"10.1109\/TVCG.2011.233","article-title":"Skeleton-based edge bundling for graph visualization","volume":"17","author":"Ersoy","year":"2011","journal-title":"Vis. Comput. Graph. IEEE Trans."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Hurter, C., Ersoy, O., and Telea, A. (2012). Graph Bundling by Kernel Density Estimation, Wiley Online Library. Computer Graphics Forum.","DOI":"10.1111\/j.1467-8659.2012.03079.x"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Peysakhovich, V., Hurter, C., and Telea, A. (2015, January 14\u201317). Attribute-Driven Edge Bundling for General Graphs with Applications in Trail Analysis. Proceedings of the 2015 IEEE Pacific Visualization Symposium (PacificVis), Hangzhou, China.","DOI":"10.1109\/PACIFICVIS.2015.7156354"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.physa.2015.06.015","article-title":"Attribute-based edge bundling for visualizing social networks","volume":"438","author":"Guo","year":"2015","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_22","first-page":"138","article-title":"Edge Bundling in Multi-attributed Graphs","volume":"Volume 9172","author":"Yamamoto","year":"2015","journal-title":"Human Interface and the Management of Information. Information and Knowledge Design"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/TVCG.2015.2467813","article-title":"Biset: Semantic edge bundling with biclusters for sensemaking","volume":"22","author":"Sun","year":"2015","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_24","first-page":"379","article-title":"MLSEB: Edge Bundling Using Moving Least Squares Approximation","volume":"Volume 10692","author":"Frati","year":"2017","journal-title":"Proceedings of the Graph Drawing and Network Visualization\u201425th International Symposium, GD 2017"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s00371-018-1509-7","article-title":"Visualizing Large Graphs by Layering and Bundling Graph Edges","volume":"35","author":"Cai","year":"2019","journal-title":"Vis. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TVCG.2017.2744338","article-title":"Functional Decomposition for Bundled Simplification of Trail Sets","volume":"24","author":"Hurter","year":"2018","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"van der Zwan, M., Codreanu, V., and Telea, A. (2016). CUBu: Universal real-time bundling for large graphs. IEEE Trans. Vis. Comput. Graph.","DOI":"10.1109\/TVCG.2016.2515611"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Lhuillier, A., Hurter, C., and Telea, A. (2017, January 18\u201321). FFTEB: Edge bundling of huge graphs by the Fast Fourier Transform. Proceedings of the 2017 IEEE Pacific Visualization Symposium (PacificVis), Seoul, Korea.","DOI":"10.1109\/PACIFICVIS.2017.8031594"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Kienreich, W., and Seifert, C. (2010, January 26\u201329). An application of edge bundling techniques to the visualization of media analysis results. Proceedings of the 2010 14th International Conference Information Visualisation, London, UK.","DOI":"10.1109\/IV.2010.58"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Nguyen, Q., Hong, S.H., and Eades, P. (2011). TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance, Springer. Graph Drawing.","DOI":"10.1007\/978-3-642-25878-7_13"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the History of the Minimum Spanning Tree Problem","volume":"7","author":"Graham","year":"1985","journal-title":"IEEE Ann. Hist. Comput."},{"key":"ref_32","first-page":"1409","article-title":"A statistical method for evaluating systematic relationships","volume":"28","author":"Sokal","year":"1958","journal-title":"Univ. Kans. Sci. Bull."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Lemey, P., Salemi, M., and Vandamme, A. (2009). The Phylogenetic Handbook: A Practical Approach to Phylogenetic Analysis and Hypothesis Testing, Cambridge University Press.","DOI":"10.1017\/CBO9780511819049"},{"key":"ref_34","first-page":"406","article-title":"The neighbor-joining method: A new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol."},{"key":"ref_35","unstructured":"Steinbach, M., Karypis, G., and Kumar, V. (2000, January 20\u201323). A comparison of document clustering techniques. Proceedings of the KDD Workshop on Text Mining, Boston, MA, USA."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawings of trees","volume":"2","author":"Reingold","year":"1981","journal-title":"Softw. Eng. IEEE Trans."},{"key":"ref_37","unstructured":"Shiloach, Y. (1976). Arrangements of Planar Graphs on the Planar Lattices. [Ph.D. Thesis, Weizmann Institute of Science]."},{"key":"ref_38","unstructured":"Asuncion, A., and Newman, D. (2020, November 10). UCI Machine Learning Repository, Available online: https:\/\/archive.ics.uci.edu\/ml\/index.php."},{"key":"ref_39","unstructured":"R Core Team (2013). R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Paulovich, F.V., Oliveira, M.C.F., and Minghim, R. (2007, January 7\u201310). The Projection Explorer: A Flexible Tool for Projection-based Multidimensional Visualization. Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007), Belo Horizonte, Brazil.","DOI":"10.1109\/SIBGRAPI.2007.21"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02289565","article-title":"Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis","volume":"29","author":"Kruskal","year":"1964","journal-title":"Psychometrika"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"88","DOI":"10.2307\/1412159","article-title":"The Proof and Measurement of Association Between Two Things","volume":"15","author":"Spearman","year":"1904","journal-title":"Am. J. Psychol."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Nguyen, Q., Eades, P., and Hong, S.H. (2013). StreamEB: Stream Edge Bundling, Springer. Graph Drawing.","DOI":"10.1007\/978-3-642-36763-2_36"},{"key":"ref_44","unstructured":"Isenberg, P., Heimerl, F., Koch, S., Isenberg, T., Xu, P., Stolper, C., Sedlmair, M., Chen, J., M\u00f6ller, T., and Stasko, J. (2020, November 10). Visualization Publication Dataset. Available online: http:\/\/vispubdata.org\/."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Boyandin, I., Bertini, E., and Lalanne, D. (2012). A Qualitative Study on the Exploration of Temporal Changes in Flow Maps with Animation and Small-Multiples, Wiley Online Library. Computer Graphics Forum.","DOI":"10.1111\/j.1467-8659.2012.03093.x"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TVCG.2010.78","article-title":"Animation, small multiples, and the effect of mental map preservation in dynamic graphs","volume":"17","author":"Archambault","year":"2011","journal-title":"Vis. Comput. Graph. IEEE Trans."},{"key":"ref_47","unstructured":"Leskovec, J., and Krevl, A. (2020, November 10). SNAP Datasets: Stanford Large Network Dataset Collection. Available online: http:\/\/snap.stanford.edu\/data."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/11\/290\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:31:44Z","timestamp":1760178704000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/11\/290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,10]]},"references-count":47,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2020,11]]}},"alternative-id":["a13110290"],"URL":"https:\/\/doi.org\/10.3390\/a13110290","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,11,10]]}}}