SideKnot： Edge Bundling for Uncovering Relation Patterns in Graphs
The node-link diagram is an intuitive way to depict a graph and present relationships between entities. Addressing the visual clutter induced by edge crossing and node-edge overlapping is a challenging task as the size of graph outgrows the visualization space. Many edge bundling methods are propose...
Gespeichert in:
| Veröffentlicht in: | Tsinghua science and technology 2012-08, Vol.17 (4), p.399-408 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 408 |
|---|---|
| container_issue | 4 |
| container_start_page | 399 |
| container_title | Tsinghua science and technology |
| container_volume | 17 |
| creator | Peng, Dichao Lu, Neng Chen, Guangyu Zuo, Wuheng Chen, Wei Peng, Qunsheng |
| description | The node-link diagram is an intuitive way to depict a graph and present relationships between entities. Addressing the visual clutter induced by edge crossing and node-edge overlapping is a challenging task as the size of graph outgrows the visualization space. Many edge bundling methods are proposed to disclose high-level edge patterns. Though previous methods can successfully reveal the skeleton graph structure, the relation patterns at the individual node level can be overlooked. In addition, most edge bundling algorithms are computationally complex, which prevents them from scaling up for extremely large graphs. In this article, we extend SideKnot, an efficient edge bundling method to cluster and knot edges at the node side. Our proposed method is light, runs faster than most existing algorithms, and can reveal the relation patterns at the individual node level. Our results show that SideKnot can disclose a node＇s standing in the graph as well as the directional connection patterns to its peers. |
| doi_str_mv | 10.1109/TST.2012.6297586 |
| format | Article |
| fullrecord | <record><control><sourceid>wanfang_jour_proqu</sourceid><recordid>TN_cdi_wanfang_journals_qhdxxb_e201204004</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>42995967</cqvip_id><wanfj_id>qhdxxb_e201204004</wanfj_id><sourcerecordid>qhdxxb_e201204004</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2044-c1ac4c7481f3a947d3e5fa227c188d3fd2421b922b9890d9a2a44e7cb7a221583</originalsourceid><addsrcrecordid>eNo9kEFOwzAQRS0EEqWwZxl2sEixHSe2l1BKQVQC0XZtOY7Tpkrt1k6gXIWzcCeugKNWrGZGev-P9AC4RHCAEOS3s-lsgCHCgwxzmrLsCPQQoyymGcyOww4hjSFG5BSceb-CMMlSmvTAw7Qq9Iuxze_PdzQqFjq6b01RV2YRldZFc6Psh3bd-a5r2VTWRG-yabQzPqpMNHZys_Tn4KSUtdcXh9kH88fRbPgUT17Hz8O7SawwJCRWSCqiKGGoTCQntEh0WkqMqUKMFUlZYIJRzjHOOeOw4BJLQjRVOQ0QSlnSBzf73k9pSmkWYmVbZ8JHsV0Wu10udGcAEghJYK_37MbZbat9I9aVV7qupdG29QIRzFkaRKGAwj2qnPXe6VJsXLWW7ksgKDq5IsgVXbU4yA2Rq0Nkac1iG_z8Z0IvT3lGkz-5I3eL</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1429855861</pqid></control><display><type>article</type><title>SideKnot： Edge Bundling for Uncovering Relation Patterns in Graphs</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Peng, Dichao ; Lu, Neng ; Chen, Guangyu ; Zuo, Wuheng ; Chen, Wei ; Peng, Qunsheng</creator><creatorcontrib>Peng, Dichao ; Lu, Neng ; Chen, Guangyu ; Zuo, Wuheng ; Chen, Wei ; Peng, Qunsheng</creatorcontrib><description>The node-link diagram is an intuitive way to depict a graph and present relationships between entities. Addressing the visual clutter induced by edge crossing and node-edge overlapping is a challenging task as the size of graph outgrows the visualization space. Many edge bundling methods are proposed to disclose high-level edge patterns. Though previous methods can successfully reveal the skeleton graph structure, the relation patterns at the individual node level can be overlooked. In addition, most edge bundling algorithms are computationally complex, which prevents them from scaling up for extremely large graphs. In this article, we extend SideKnot, an efficient edge bundling method to cluster and knot edges at the node side. Our proposed method is light, runs faster than most existing algorithms, and can reveal the relation patterns at the individual node level. Our results show that SideKnot can disclose a node＇s standing in the graph as well as the directional connection patterns to its peers.</description><identifier>ISSN: 1007-0214</identifier><identifier>EISSN: 1878-7606</identifier><identifier>EISSN: 1007-0214</identifier><identifier>DOI: 10.1109/TST.2012.6297586</identifier><language>eng</language><publisher>State Key Lab of CAD&CG, Zhejiang University, Hangzhou 310054, China%Zhijiang College of Zhejiang University of Technology, Hangzhou 310024, China</publisher><subject>Algorithms ; 可视化 ; 开关 ; 曲线图 ; 模式图 ; 边缘节点 ; 运行速度 ; 连接模式 ; 链接图</subject><ispartof>Tsinghua science and technology, 2012-08, Vol.17 (4), p.399-408</ispartof><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/85782X/85782X.jpg</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Peng, Dichao</creatorcontrib><creatorcontrib>Lu, Neng</creatorcontrib><creatorcontrib>Chen, Guangyu</creatorcontrib><creatorcontrib>Zuo, Wuheng</creatorcontrib><creatorcontrib>Chen, Wei</creatorcontrib><creatorcontrib>Peng, Qunsheng</creatorcontrib><title>SideKnot： Edge Bundling for Uncovering Relation Patterns in Graphs</title><title>Tsinghua science and technology</title><addtitle>Tsinghua Science and Technology</addtitle><description>The node-link diagram is an intuitive way to depict a graph and present relationships between entities. Addressing the visual clutter induced by edge crossing and node-edge overlapping is a challenging task as the size of graph outgrows the visualization space. Many edge bundling methods are proposed to disclose high-level edge patterns. Though previous methods can successfully reveal the skeleton graph structure, the relation patterns at the individual node level can be overlooked. In addition, most edge bundling algorithms are computationally complex, which prevents them from scaling up for extremely large graphs. In this article, we extend SideKnot, an efficient edge bundling method to cluster and knot edges at the node side. Our proposed method is light, runs faster than most existing algorithms, and can reveal the relation patterns at the individual node level. Our results show that SideKnot can disclose a node＇s standing in the graph as well as the directional connection patterns to its peers.</description><subject>Algorithms</subject><subject>可视化</subject><subject>开关</subject><subject>曲线图</subject><subject>模式图</subject><subject>边缘节点</subject><subject>运行速度</subject><subject>连接模式</subject><subject>链接图</subject><issn>1007-0214</issn><issn>1878-7606</issn><issn>1007-0214</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNo9kEFOwzAQRS0EEqWwZxl2sEixHSe2l1BKQVQC0XZtOY7Tpkrt1k6gXIWzcCeugKNWrGZGev-P9AC4RHCAEOS3s-lsgCHCgwxzmrLsCPQQoyymGcyOww4hjSFG5BSceb-CMMlSmvTAw7Qq9Iuxze_PdzQqFjq6b01RV2YRldZFc6Psh3bd-a5r2VTWRG-yabQzPqpMNHZys_Tn4KSUtdcXh9kH88fRbPgUT17Hz8O7SawwJCRWSCqiKGGoTCQntEh0WkqMqUKMFUlZYIJRzjHOOeOw4BJLQjRVOQ0QSlnSBzf73k9pSmkWYmVbZ8JHsV0Wu10udGcAEghJYK_37MbZbat9I9aVV7qupdG29QIRzFkaRKGAwj2qnPXe6VJsXLWW7ksgKDq5IsgVXbU4yA2Rq0Nkac1iG_z8Z0IvT3lGkz-5I3eL</recordid><startdate>20120801</startdate><enddate>20120801</enddate><creator>Peng, Dichao</creator><creator>Lu, Neng</creator><creator>Chen, Guangyu</creator><creator>Zuo, Wuheng</creator><creator>Chen, Wei</creator><creator>Peng, Qunsheng</creator><general>State Key Lab of CAD&CG, Zhejiang University, Hangzhou 310054, China%Zhijiang College of Zhejiang University of Technology, Hangzhou 310024, China</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>7TB</scope><scope>7U5</scope><scope>8BQ</scope><scope>8FD</scope><scope>FR3</scope><scope>JG9</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>20120801</creationdate><title>SideKnot： Edge Bundling for Uncovering Relation Patterns in Graphs</title><author>Peng, Dichao ; Lu, Neng ; Chen, Guangyu ; Zuo, Wuheng ; Chen, Wei ; Peng, Qunsheng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2044-c1ac4c7481f3a947d3e5fa227c188d3fd2421b922b9890d9a2a44e7cb7a221583</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>可视化</topic><topic>开关</topic><topic>曲线图</topic><topic>模式图</topic><topic>边缘节点</topic><topic>运行速度</topic><topic>连接模式</topic><topic>链接图</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Peng, Dichao</creatorcontrib><creatorcontrib>Lu, Neng</creatorcontrib><creatorcontrib>Chen, Guangyu</creatorcontrib><creatorcontrib>Zuo, Wuheng</creatorcontrib><creatorcontrib>Chen, Wei</creatorcontrib><creatorcontrib>Peng, Qunsheng</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Tsinghua science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Peng, Dichao</au><au>Lu, Neng</au><au>Chen, Guangyu</au><au>Zuo, Wuheng</au><au>Chen, Wei</au><au>Peng, Qunsheng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SideKnot： Edge Bundling for Uncovering Relation Patterns in Graphs</atitle><jtitle>Tsinghua science and technology</jtitle><addtitle>Tsinghua Science and Technology</addtitle><date>2012-08-01</date><risdate>2012</risdate><volume>17</volume><issue>4</issue><spage>399</spage><epage>408</epage><pages>399-408</pages><issn>1007-0214</issn><eissn>1878-7606</eissn><eissn>1007-0214</eissn><abstract>The node-link diagram is an intuitive way to depict a graph and present relationships between entities. Addressing the visual clutter induced by edge crossing and node-edge overlapping is a challenging task as the size of graph outgrows the visualization space. Many edge bundling methods are proposed to disclose high-level edge patterns. Though previous methods can successfully reveal the skeleton graph structure, the relation patterns at the individual node level can be overlooked. In addition, most edge bundling algorithms are computationally complex, which prevents them from scaling up for extremely large graphs. In this article, we extend SideKnot, an efficient edge bundling method to cluster and knot edges at the node side. Our proposed method is light, runs faster than most existing algorithms, and can reveal the relation patterns at the individual node level. Our results show that SideKnot can disclose a node＇s standing in the graph as well as the directional connection patterns to its peers.</abstract><pub>State Key Lab of CAD&CG, Zhejiang University, Hangzhou 310054, China%Zhijiang College of Zhejiang University of Technology, Hangzhou 310024, China</pub><doi>10.1109/TST.2012.6297586</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1007-0214 |
| ispartof | Tsinghua science and technology, 2012-08, Vol.17 (4), p.399-408 |
| issn | 1007-0214 1878-7606 1007-0214 |
| language | eng |
| recordid | cdi_wanfang_journals_qhdxxb_e201204004 |
| source | EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithms 可视化 开关 曲线图 模式图 边缘节点 运行速度 连接模式 链接图 |
| title | SideKnot： Edge Bundling for Uncovering Relation Patterns in Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T15%3A41%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SideKnot%EF%BC%9A%20Edge%20Bundling%20for%20Uncovering%20Relation%20Patterns%20in%20Graphs&rft.jtitle=Tsinghua%20science%20and%20technology&rft.au=Peng,%20Dichao&rft.date=2012-08-01&rft.volume=17&rft.issue=4&rft.spage=399&rft.epage=408&rft.pages=399-408&rft.issn=1007-0214&rft.eissn=1878-7606&rft_id=info:doi/10.1109/TST.2012.6297586&rft_dat=%3Cwanfang_jour_proqu%3Eqhdxxb_e201204004%3C/wanfang_jour_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1429855861&rft_id=info:pmid/&rft_cqvip_id=42995967&rft_wanfj_id=qhdxxb_e201204004&rfr_iscdi=true |