請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/104118完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 王凡 | zh_TW |
| dc.contributor.advisor | Farn Wang | en |
| dc.contributor.author | 黃柏棟 | zh_TW |
| dc.contributor.author | Po-Tung Huang | en |
| dc.date.accessioned | 2026-08-21T16:48:13Z | - |
| dc.date.available | 2026-08-22 | - |
| dc.date.copyright | 2026-08-21 | - |
| dc.date.issued | 2026 | - |
| dc.date.submitted | 2026-08-11 13:06:10 | - |
| dc.identifier.citation | [AB00] Réka Albert and Albert-László Barabási. Topology of evolving networks: local events and universality. Physical review letters, 85(24):5234, 2000.
[ADD+93] Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81–100, 1993. [ALN+24] Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger. Bundling-aware graph drawing. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), pages 15–1. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2024. [BGLL08] Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10):P10008, 2008. [Bra01] Ulrik Brandes. A faster algorithm for betweenness centrality. Journal of mathematical sociology, 25(2):163–177, 2001. [BRH+16] Benjamin Bach, Nathalie Henry Riche, Christophe Hurter, Kim Marriott, and Tim Dwyer. Towards unambiguous edge bundling: Investigating confluent drawings for network visualization. IEEE transactions on visualization and computer graphics, 23(1):541–550, 2016. [BS16] Andrew Beveridge and Jie Shan. Network of thrones. Math Horizons, 23(4):18–22, 2016. [BSL+13] Joachim Böttger, Alexander Schäfer, Gabriele Lohmann, Arno Villringer, and Daniel S Margulies. Three-dimensional mean-shift edge bundling for the visualization of functional connectivity in the brain. IEEE transactions on visualization and computer graphics, 20(3):471–480, 2013. [CZQ+08] Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong, and Xiaoming Li. Geometry-based edge clustering for graph visualization. IEEE transactions on visualization and computer graphics, 14(6):1277–1284, 2008. [DCGT24] Maximilien Dreveton, Charbel Chucri, Matthias Grossglauser, and Patrick Thiran. Why the metric backbone preserves community structure. Advances in Neural Information Processing Systems, 37:37439–37472, 2024. [EHP+11] Ozan Ersoy, Christophe Hurter, Fernando Paulovich, Gabriel Cantareiro, and Alex Telea. Skeleton-based edge bundling for graph visualization. IEEE transactions on visualization and computer graphics, 17(12):2364–2373, 2011. [FH16] Santo Fortunato and Darko Hric. Community detection in networks: A user guide. Physics reports, 659:1–44, 2016. [GKN04] Emden R Gansner, Yehuda Koren, and Stephen North. Graph drawing by stress majorization. In International Symposium on Graph Drawing, pages 239–250. Springer, 2004. [GZPA15] Lin Guo, Wanli Zuo, Tao Peng, and Binod Kumar Adhikari. Attribute-based edge bundling for visualizing social networks. Physica A: Statistical Mechanics and its Applications, 438:48–55, 2015. [HB08] Cesar A Hidalgo and Albert-Laszlo Barabasi. Scale-free networks. Scholarpedia, 3(1):1716, 2008. [HET12] Christophe Hurter, Ozan Ersoy, and Alexandru Telea. Graph bundling by kernel density estimation. In Computer graphics forum, volume 31, pages 865–874. Wiley Online Library, 2012. [HLL83] Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt. Stochastic blockmodels: First steps. Social networks, 5(2):109–137, 1983. [Hol06] Danny Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on visualization and computer graphics, 12(5):741–748, 2006. [HVW09] Danny Holten and Jarke J Van Wijk. Force-directed edge bundling for graph visualization. In Computer graphics forum, volume 28, pages 983–990. Wiley Online Library, 2009. [KK93] Donald Ervin Knuth and Donald Knuth. The Stanford GraphBase: a platform for combinatorial computing, volume 1. AcM Press New York, 1993. [KRM+17] Johannes F Kruiger, Paulo E Rauber, Rafael Messias Martins, Andreas Kerren, Stephen Kobourov, and Alexandru C Telea. Graph layouts by t-sne. In Computer graphics forum, volume 36, pages 283–294. Wiley Online Library, 2017. [LBA10] Antoine Lambert, Romain Bourqui, and David Auber. Winding roads: Routing edges into bundles. In Computer graphics forum, volume 29, pages 853–862. Wiley Online Library, 2010. [LHT17a] Antoine Lhuillier, Christophe Hurter, and Alexandru Telea. Ffteb: Edge bundling of huge graphs by the fast fourier transform. In 2017 IEEE Pacific visualization symposium (PacificVis), pages 190–199. IEEE, 2017. [LHT17b] Antoine Lhuillier, Christophe Hurter, and Alexandru Telea. State of the art in edge and trail bundling techniques. In Computer Graphics Forum, volume 36, pages 619–645. Wiley Online Library, 2017. [LW19] Clement Lee and Darren J Wilkinson. A review of stochastic block models and extensions for graph clustering. Applied Network Science, 4(1):122, 2019. [LZHH19] Yi-Na Li, Kang Zhang, Dong-Ni Hu, and Mao Lin Huang. The influence of edge bundling on visual information search. Information Sciences, 495:234–246, 2019. [MD12] Fintan McGee and John Dingliana. An empirical study on the impact of edge bundling on user comprehension of graphs. In Proceedings of the International Working Conference on Advanced Visual Interfaces, pages 620–627, 2012. [NEH13] Quan Nguyen, Peter Eades, and Seok-Hee Hong. On the faithfulness of graph visualizations. In 2013 IEEE Pacific Visualization Symposium (PacificVis), pages 209–216. IEEE, 2013. [New06a] Mark EJ Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 74(3):036104, 2006. [New06b] Mark EJ Newman. Modularity and community structure in networks. Proceedings of the national academy of sciences, 103(23):8577–8582, 2006. [NHE11] Quan Nguyen, Seok-Hee Hong, and Peter Eades. Tgi-eb: A new framework for edge bundling integrating topology, geometry and importance. In International Symposium on Graph Drawing, pages 123–135. Springer, 2011. [NLCB13] Bobo Nick, Conrad Lee, Pádraig Cunningham, and Ulrik Brandes. Simmelian backbones: Amplifying hidden homophily in facebook networks. In Proceedings of the 2013 IEEE/ACM international conference on advances in social networks analysis and mining, pages 525–532, 2013. [PS89] David Peleg and Alejandro A Schäffer. Graph spanners. Journal of graph theory, 13(1):99–116, 1989. [SCR21] Tiago Simas, Rion Brattig Correia, and Luis M Rocha. The distance backbone of complex networks. Journal of Complex Networks, 9(6):cnab021, 2021. [SHH11] David Selassie, Brandon Heller, and Jeffrey Heer. Divided edge bundling for directional network data. IEEE Transactions on Visualization and Computer Graphics, 17(12):2354–2363, 2011. [SMO+03] Paul Shannon, Andrew Markiel, Owen Ozier, Nitin S Baliga, Jonathan T Wang, Daniel Ramage, Nada Amin, Benno Schwikowski, and Trey Ideker. Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome research, 13(11):2498, 2003. [TE10] Alexandru Telea and Ozan Ersoy. Image-based edge bundles: Simplified visualization of large graphs. In Computer Graphics Forum, volume 29, pages 843–852. Wiley Online Library, 2010. [Uni00] United States Census Bureau. County-to-county migration flows files: Census 2000. U.S. Census Bureau data table, 2000. [VDZCT16] Matthew Van Der Zwan, Valeriu Codreanu, and Alexandru Telea. Cubu: Universal real-time bundling for large graphs. IEEE transactions on visualization and computer graphics, 22(12):2550–2563, 2016. [WAA+21] Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, and Jaakko Peltonen. Edge-path bundling: A less ambiguous edge bundling approach. IEEE Transactions on visualization and computer graphics, 28(1):313–323, 2021. [WAA+23] Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, and Jaakko Peltonen. Faster edge-path bundling through graph spanners. In Computer Graphics Forum, volume 42, page e14789. Wiley Online Library, 2023. [WPT+25] Markus Wallinger, Tommaso Piselli, Alessandra Tappini, Daniel Archambault, Giuseppe Liotta, and Martin Nöllenburg. Bundling-aware graph drawing revisited. IEEE Transactions on Visualization and Computer Graphics, 2025. [WS98] Duncan J Watts and Steven H Strogatz. Collective dynamics of ‘small-world’networks. nature, 393(6684):440–442, 1998. [WZLY18] Jieting Wu, Feiyu Zhu, Xin Liu, and Hongfeng Yu. An information-theoretic framework for evaluating edge bundling visualization. Entropy, 20(9):625, 2018. [ZPG18] Jonathan X Zheng, Samraat Pawar, and Dan FM Goodman. Graph drawing by stochastic gradient descent. IEEE transactions on visualization and computer graphics, 25(9):2738–2748, 2018. [ZPG19] Jonathan X Zheng, Samraat Pawar, and Dan FM Goodman. Further towards unambiguous edge bundling: Investigating power-confluent drawings for network visualization. IEEE Transactions on Visualization and Computer Graphics, 27(3):2244–2249, 2019. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/104118 | - |
| dc.description.abstract | 邊綑綁是降低高密度節點連結圖中視覺雜亂的常用技術。然而,許多傳統方法將邊綑綁視為圖形佈局完成後的後處理步驟,可能造成路徑扭曲、視覺歧義,並削弱原始結構的可讀性。近年的 Bundling-Aware Graph Drawing 方法透過 Filter-Draw-Bundle 框架,將骨架選取、圖形佈局與邊綑綁共同納入考量,以改善此限制。然而,既有方法多著重於一般邊綑綁品質,對於最終結果中的社群結構保留則鮮少被明確探討。
本論文提出 CASEB,一種用於結構保留的社群感知骨架式邊綑綁方法。CASEB 以 Filter-Draw-Bundle 架構為基礎,將社群資訊納入骨架建構與佈局最佳化。首先,本研究使用 Metric Backbone 去除冗餘邊,同時保留基礎距離結構。接著,CASEB 結合 Neighboring Edge Betweenness、局部 Jaccard 相似度與社群權重,形成骨架建構的優先級分數。此外,本研究引入自適應伸縮因子與抗塌陷佈局策略,以降低社群重疊並改善高密度群集的視覺分離效果。 本研究於隨機區塊模型圖、真實圖資料與 scale-free networks 上進行實驗,並以 Ink Ratio、Distortion、Ambiguity 與 Entropy 四項指標,將 CASEB 與 EPB、EB-FDB、NEB-FDB 及 SW-FDB 進行比較。結果顯示,在代表性設定下,CASEB 具有較佳的整體表現。特別是,CASEB 能在維持優異的邊綑綁品質之餘,進一步提升社群結構的保留程度,顯示將社群資訊納入骨架選取與佈局設計,有助於提升邊綑綁圖形的結構可讀性。 | zh_TW |
| dc.description.abstract | Edge bundling is widely used to reduce visual clutter in dense node-link diagrams. However, many traditional methods treat bundling as a post-processing step after graph layout, which may introduce path distortion, visual ambiguity, and reduced structural readability. Recent Bundling-Aware Graph Drawing methods address this limitation through the Filter-Draw-Bundle framework, which jointly considers skeleton selection, layout, and edge bundling. Nevertheless, existing methods mainly focus on general bundling quality, while community-structure preservation is less explicitly considered.
This thesis proposes CASEB, a community-aware skeleton-based edge bundling method for structure preservation. CASEB extends the Filter-Draw-Bundle pipeline by incorporating community information into skeleton construction and layout optimization. It first uses Metric Backbone to remove redundant edges while preserving basic distance structures. It then combines Neighboring Edge Betweenness, local Jaccard similarity, and community weighting into a priority score for skeleton construction. In addition, an adaptive stretch factor and an anti-collapse layout strategy are introduced to reduce community overlap and improve visual separation among densely connected groups. Experiments on stochastic block model graphs, real-world graphs, and scale-free networks compare CASEB with EPB, EB-FDB, NEB-FDB, and SW-FDB using Ink Ratio, Distortion, Ambiguity, and Entropy. The results show that CASEB achieves better overall performance under the representative setting. In particular, CASEB improves community preservation while maintaining competitive bundling quality, indicating that community-aware skeleton selection and layout design can enhance the structural readability of bundled graph drawings. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2026-08-21T16:48:13Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2026-08-21T16:48:13Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | 致謝 i
摘要 ii Abstract iii 目次 iv 圖次 vi 表次 vii 演算法次 viii 1 Introduction 1 2 Literature Review 5 2.1 Development of Edge Bundling in Complex Network Visualization 5 2.2 From Post-Processing to Bundling-Aware Graph Drawing 6 2.3 Skeleton Selection and the Limitation of Community Preservation in the FDB Pipeline 8 2.4 Challenges of Community-Structure Preservation in Edge Bundling 9 2.5 Research Gap and Position of This Study 10 3 Preliminaries 11 3.1 Edge Bundling and the Filter-Draw-Bundle Framework 11 3.2 Graph Sparsification and Metric Backbone 15 3.3 Community Detection and Community Information 17 3.4 Graph Layout and Dimensionality Reduction Methods 20 3.5 Evaluation Metrics 23 3.6 Chapter Summary 26 4 Method 27 4.1 System Overview 28 4.2 Metric Backbone-Based Preprocessing 30 4.3 Community-Aware Adaptive Skeleton 31 4.4 Anti-Collapse Layout Engine 35 4.5 Edge Bundling 38 4.6 Chapter Summary 39 5 Experimental Evaluation 41 5.1 Experimental Datasets 41 5.2 RQ1: Does Community Weight Improve Community Preservation? 44 5.3 RQ2: Does the Adaptive Stretch Factor Outperform Fixed t? 46 5.4 RQ3: Does CASEB Outperform Existing Methods Under the Representative Setting? 49 5.5 RQ4: Performance Characteristic Analysis 55 5.6 Overall Discussion 59 5.7 Chapter Summary 60 6 Conclusion 61 Bibliography 65 | - |
| dc.language.iso | en | - |
| dc.subject | 邊綑綁 | - |
| dc.subject | 圖形視覺化 | - |
| dc.subject | 社群結構保留 | - |
| dc.subject | 骨架選取 | - |
| dc.subject | 圖形布局 | - |
| dc.subject | Edge Bundling | - |
| dc.subject | Graph Visualization | - |
| dc.subject | Community Preservation | - |
| dc.subject | Skeleton Selection | - |
| dc.subject | Graph Layout | - |
| dc.title | CASEB:基於社群感知骨架之結構保留式邊綑綁 | zh_TW |
| dc.title | CASEB: Community-Aware Skeleton-Based Edge Bundling for Structure Preservation | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 114-2 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 陳和麟;雷欽隆;王勝德 | zh_TW |
| dc.contributor.oralexamcommittee | Ho-Lin Chen;Chin-Laung Lei;Sheng-De Wang | en |
| dc.subject.keyword | 邊綑綁; 圖形視覺化; 社群結構保留; 骨架選取; 圖形布局 | zh_TW |
| dc.subject.keyword | Edge Bundling; Graph Visualization; Community Preservation; Skeleton Selection; Graph Layout | en |
| dc.relation.page | 70 | - |
| dc.identifier.doi | 10.6342/NTU202603791 | - |
| dc.rights.note | 未授權 | - |
| dc.date.accepted | 2026-08-13 | - |
| dc.contributor.author-college | 電機資訊學院 | - |
| dc.contributor.author-dept | 電機工程學系 | - |
| dc.date.embargo-lift | N/A | - |
| 顯示於系所單位: | 電機工程學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-114-2.pdf 未授權公開取用 | 9.29 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
