Dual Adjacency Matrix: Exploring Link Groups in Dense Networks
Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the grouping of links instead of nodes. Link communities, for example, are a form of link groups that describe high‐quality overlapping node communitie...
Saved in:
Published in | Computer graphics forum Vol. 34; no. 3; pp. 311 - 320 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Oxford
Blackwell Publishing Ltd
01.06.2015
|
Subjects | |
Online Access | Get full text |
ISSN | 0167-7055 1467-8659 |
DOI | 10.1111/cgf.12643 |
Cover
Loading…
Abstract | Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the grouping of links instead of nodes. Link communities, for example, are a form of link groups that describe high‐quality overlapping node communities. There is a conceptual gap between node groups and link groups that poses an interesting visualization challenge. We introduce the Dual Adjacency Matrix to bridge this gap. This matrix combines node and link group techniques via a generalization that also enables it to be coordinated with a node‐link‐contour diagram. These methods have been implemented in a prototype that we evaluated with an information scientist and neuroscientist via interviews and prototype walk‐throughs. We demonstrate this prototype with the analysis of a trade network and an fMRI correlation network. |
---|---|
AbstractList | Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the grouping of links instead of nodes. Link communities, for example, are a form of link groups that describe high-quality overlapping node communities. There is a conceptual gap between node groups and link groups that poses an interesting visualization challenge. We introduce the Dual Adjacency Matrix to bridge this gap. This matrix combines node and link group techniques via a generalization that also enables it to be coordinated with a node-link-contour diagram. These methods have been implemented in a prototype that we evaluated with an information scientist and neuroscientist via interviews and prototype walk-throughs. We demonstrate this prototype with the analysis of a trade network and an fMRI correlation network. |
Author | Dinkla, K. Riche, N. Henry Westenberg, M.A. |
Author_xml | – sequence: 1 givenname: K. surname: Dinkla fullname: Dinkla, K. organization: Microsoft Research, USA – sequence: 2 givenname: N. Henry surname: Riche fullname: Riche, N. Henry organization: Microsoft Research, USA – sequence: 3 givenname: M.A. surname: Westenberg fullname: Westenberg, M.A. organization: Eindhoven University of Technology, the Netherlands |
BookMark | eNp9kE9LwzAYh4MouKkHv0HBix7q8qdJWg_C3NwU5kRRBC8hTVPJ1iUzaXH79lanHgR9L-97eJ4fL78u2LbOagAOETxF7fTUS3mKMEvIFuighPE4ZTTbBh2I2ptDSndBN4QZhDDhjHbA-bCRVdQvZlJpq9bRjay9WZ1Fl6tl5byxL9HE2Hk09q5ZhsjYaKht0NFU12_Oz8M-2CllFfTB194Dj6PLh8FVPLkdXw_6k1glkJBYEsYxlhRRUrAkl0VWSIIKjjJMKS1VnmOMMOGlZKXWWZamKpeMF7xIWzEvyR443uQuvXttdKjFwgSlq0pa7ZogEOcpxBxh2KJHv9CZa7xtvxOIZRwnSYqTljrZUMq7ELwuxdKbhfRrgaD4aFK0TYrPJlu294tVppa1cbb20lT_GW-m0uu_o8VgPPo24o1hQq1XP4b0c8E44VQ8TcdiCO8G7PniXkDyDt01k2g |
CitedBy_id | crossref_primary_10_1111_cgf_12872 crossref_primary_10_1016_j_cag_2017_08_006 crossref_primary_10_1109_TVCG_2021_3114761 crossref_primary_10_1371_journal_pone_0295361 |
Cites_doi | 10.1111/j.1467-8659.2009.01452.x 10.1038/nature09182 10.1109/TVCG.2013.232 10.1007/978-3-662-04245-8 10.1109/PacificVis.2013.6596146 10.1109/TVCG.2009.122 10.1109/TVCG.2014.2346249 10.1111/j.1467-8659.2011.01898.x 10.1109/TVCG.2008.34 10.1109/TVCG.2013.198 10.1109/PACIFICVIS.2009.4906846 10.1109/IV.2012.19 10.1109/TVCG.2006.147 10.1109/TVCG.2014.2346248 10.1179/000870403235002042 10.1126/science.1073374 10.1109/INFVIS.2004.1 10.1109/TVCG.2013.76 10.1145/1168149.1168168 10.1109/TVCG.2006.76 10.1002/pmic.200300636 10.1109/TVCG.2013.184 10.1089/brain.2013.0205 10.1109/TVCG.2014.2346441 10.1109/2945.841119 10.1109/TVCG.2010.210 10.1093/bioinformatics/btl039 10.1111/j.1467-8659.2012.03080.x 10.1109/VAST.2011.6102440 |
ContentType | Journal Article |
Copyright | 2015 The Author(s) Computer Graphics Forum © 2015 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 2015 The Eurographics Association and John Wiley & Sons Ltd. |
Copyright_xml | – notice: 2015 The Author(s) Computer Graphics Forum © 2015 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. – notice: 2015 The Eurographics Association and John Wiley & Sons Ltd. |
DBID | BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
DOI | 10.1111/cgf.12643 |
DatabaseName | Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | Technology Research Database CrossRef Computer and Information Systems Abstracts |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1467-8659 |
EndPage | 320 |
ExternalDocumentID | 3747609811 10_1111_cgf_12643 CGF12643 ark_67375_WNG_D0QC6ZBR_0 |
Genre | article Feature |
GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHHS AANLZ AAONW AASGY AAXRX AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACFBH ACGFS ACPOU ACSCC ACXBN ACXQS ADBBV ADEOM ADIZJ ADKYN ADMGS ADOZA ADXAS ADZMN ADZOD AEEZP AEGXH AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFNX AFFPM AFGKR AFPWT AFZJQ AHBTC AHEFC AITYG AIURR AIWBW AJBDE AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WRC WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAHQN AAMMB AAMNL AANHP AAYCA ACRPL ACUHS ACYXJ ADMLS ADNMO AEFGJ AEYWJ AFWVQ AGHNM AGQPQ AGXDD AGYGG AHQJS AIDQK AIDYY ALVPJ AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 |
ID | FETCH-LOGICAL-c4033-a36722a5153d64bad9da31d7192555fcbb221237fa6fee9988cba67d7d8672bf3 |
IEDL.DBID | DR2 |
ISSN | 0167-7055 |
IngestDate | Thu Aug 07 14:45:16 EDT 2025 Fri Jul 25 23:43:39 EDT 2025 Thu Apr 24 22:53:38 EDT 2025 Thu Jul 03 08:37:09 EDT 2025 Wed Aug 20 07:25:02 EDT 2025 Wed Oct 30 09:52:08 EDT 2024 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 3 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c4033-a36722a5153d64bad9da31d7192555fcbb221237fa6fee9988cba67d7d8672bf3 |
Notes | ark:/67375/WNG-D0QC6ZBR-0 ArticleID:CGF12643 Supporting Information istex:A5AFD84DAC4AEA130963DD3D96FD4E517D34A1F5 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
OpenAccessLink | https://pure.tue.nl/ws/files/3994969/372215393117186.pdf |
PQID | 1697244824 |
PQPubID | 30877 |
PageCount | 10 |
ParticipantIDs | proquest_miscellaneous_1778027120 proquest_journals_1697244824 crossref_primary_10_1111_cgf_12643 crossref_citationtrail_10_1111_cgf_12643 wiley_primary_10_1111_cgf_12643_CGF12643 istex_primary_ark_67375_WNG_D0QC6ZBR_0 |
PublicationCentury | 2000 |
PublicationDate | 2015-06 June 2015 2015-06-00 20150601 |
PublicationDateYYYYMMDD | 2015-06-01 |
PublicationDate_xml | – month: 06 year: 2015 text: 2015-06 |
PublicationDecade | 2010 |
PublicationPlace | Oxford |
PublicationPlace_xml | – name: Oxford |
PublicationTitle | Computer graphics forum |
PublicationTitleAlternate | Computer Graphics Forum |
PublicationYear | 2015 |
Publisher | Blackwell Publishing Ltd |
Publisher_xml | – name: Blackwell Publishing Ltd |
References | Alsallakh B., Aigner W., Miksch S., Hauser H.: Radial sets: Interactive visual analysis of large overlapping sets. IEEE Trans. on Visualization and Computer Graphics 19, 12 (2013), 2496-2505. 2 Ahn Y.-Y., Bagrow J., Lehmann S.: Link communities reveal multiscale complexity in networks. Nature 466, 7307 (2010), 761-764. 2, 5, 8 Dinkla K., van Kreveld M.J., Speckmann B., Westenberg M.A.: Kelp diagrams: Point set membership visualization. Computer Graphics Forum 31, 3pt1 (2012), 875-884. 2 Holten D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Trans. on Visualization and Computer Graphics 12, 5 (2006), 741-748. 2 van den Elzen S., van Wijk J.: Multivariate network exploration and presentation: From detail to overview via selections and aggregations. IEEE Trans. on Visualization and Computer Graphics 20, 12 (2014), 2310-2319. 2 Yook S., Oltvai Z., Barabási A.: Functional and topological characterization of protein interaction networks. Proteomics 4, 4 (2004), 928-942. 2 Harrower M., Brewer C.A.: Colorbrewer.org: An online tool for selecting colour schemes for maps. The Cartographic Journal 40, 1 (2003), 27-37. 6 Herman I., Melançon G., Marshall M.: Graph visualization and navigation in information visualization: A survey. IEEE Trans. on Visualization and Computer Graphics 6, 1 (2000), 24-43. 2 De Berg M., Van Kreveld M., Overmars M., Schwarzkopf O.C.: Computational geometry. Springer, 2000. 5 Hadlak S., Schumann H., Cap C., Wollenberg T.: Supporting the visual analysis of dynamic networks by clustering associated temporal attributes. IEEE Trans. on Visualization and Computer Graphics 19, 12 (2013), 2267-2276. 2 von Landesberger T., Kuijper A., Schreck T., Kohlhammer J., van Wijk J., Fekete J.-D., Fellner D.: Visual analysis of large graphs: State-of-the-art and future research challenges. Computer Graphics Forum 30, 6 (2011), 1719-1749. 2 Ravasz E., Somera A., Mongru D., Oltvai Z., Barabási A.: Hierarchical organization of modularity in metabolic networks. Science 297, 5586 (2002), 1551-1555. 2 Madhyastha T.M., Grabowski T.J.: Age-related differences in the dynamic architecture of intrinsic networks. Brain connectivity 4, 4 (2014), 231-241. 8, 9 Adamcsek B., Palla G., Farkas I.J., Derényi I., Vicsek T.: Cfinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22, 8 (2006), 1021-1023. 2 Kosara R., Bendix F., Hauser H.: Parallel sets: interactive exploration and visual analysis of categorical data. IEEE Trans. on Visualization and Computer Graphics 12, 4 (2006), 558-568. 2 Vehlow C., Reinhardt T., Weiskopf D.: Visualizing fuzzy overlapping communities in networks. IEEE Trans. on Visualization and Computer Graphics 19, 12 (2013), 2486-2495. 2 Henry Riche N., Dwyer T.: Untangling Euler diagrams. IEEE Trans. on Visualization and Computer Graphics 16, 6 (2010), 1090-1099. 2 Simonetto P., Auber D., Archambault D.: Fully automatic visualisation of overlapping sets. Computer Graphics Forum 28, 3 (2009), 967-974. 2 Archambault D., Munzner T., Auber D.: GrouseFlocks: Steerable exploration of graph hierarchy space. IEEE Trans. on Visualization and Computer Graphics 14, 4 (2008), 900-913. 4 Meulemans W., Riche N., Speckmann B., Alper B., Dwyer T.: Kelpfusion: A hybrid set visualization technique. IEEE Trans. on Visualization and Computer Graphics 19, 11 (2013), 1846-1858. 2, 5 Collins C., Penn G., Carpendale S.: Bubble Sets: Revealing set relations with isocontours over existing visualizations. IEEE Trans. on Visualization and Computer Graphics 15, 6 (2009), 1009-1016. 2 Sadana R., Major T., Dove A., Stasko J.: Onset: A visualization technique for large-scale binary set data. IEEE Trans. on Visualization and Computer Graphics 20, 12 (2014), 1993-2002. 2 Lex A., Gehlenborg N., Strobelt H., Vuillemot R., Pfister H.: Upset: Visualization of intersecting sets. IEEE Trans. on Visualization and Computer Graphics 20, 12 (2014), 1983-1992. 2, 4 2010; 16 2000; 6 2006; 12 2012 2011 2002; 297 2010; 466 2008; 14 2009 2004; 4 2011; 30 2006 2004 2001; 1984 2012; 31 2014; 20 2009; 28 2013; 19 2014; 4 2000 2006; 22 2014 2013 2003; 40 2009; 15 Bertault F. (e_1_2_14_7_2) 2001 e_1_2_14_30_2 e_1_2_14_10_2 e_1_2_14_33_2 e_1_2_14_34_2 e_1_2_14_12_2 e_1_2_14_31_2 e_1_2_14_11_2 e_1_2_14_32_2 e_1_2_14_14_2 e_1_2_14_13_2 e_1_2_14_16_2 e_1_2_14_15_2 Kerren A. (e_1_2_14_19_2) 2013 e_1_2_14_28_2 e_1_2_14_29_2 e_1_2_14_5_2 e_1_2_14_4_2 e_1_2_14_6_2 e_1_2_14_9_2 e_1_2_14_8_2 e_1_2_14_3_2 e_1_2_14_2_2 e_1_2_14_22_2 e_1_2_14_23_2 e_1_2_14_20_2 e_1_2_14_21_2 e_1_2_14_26_2 e_1_2_14_27_2 e_1_2_14_24_2 e_1_2_14_25_2 e_1_2_14_18_2 e_1_2_14_17_2 |
References_xml | – reference: Dinkla K., van Kreveld M.J., Speckmann B., Westenberg M.A.: Kelp diagrams: Point set membership visualization. Computer Graphics Forum 31, 3pt1 (2012), 875-884. 2 – reference: Harrower M., Brewer C.A.: Colorbrewer.org: An online tool for selecting colour schemes for maps. The Cartographic Journal 40, 1 (2003), 27-37. 6 – reference: Yook S., Oltvai Z., Barabási A.: Functional and topological characterization of protein interaction networks. Proteomics 4, 4 (2004), 928-942. 2 – reference: Meulemans W., Riche N., Speckmann B., Alper B., Dwyer T.: Kelpfusion: A hybrid set visualization technique. IEEE Trans. on Visualization and Computer Graphics 19, 11 (2013), 1846-1858. 2, 5 – reference: Vehlow C., Reinhardt T., Weiskopf D.: Visualizing fuzzy overlapping communities in networks. IEEE Trans. on Visualization and Computer Graphics 19, 12 (2013), 2486-2495. 2 – reference: Holten D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Trans. on Visualization and Computer Graphics 12, 5 (2006), 741-748. 2 – reference: Archambault D., Munzner T., Auber D.: GrouseFlocks: Steerable exploration of graph hierarchy space. IEEE Trans. on Visualization and Computer Graphics 14, 4 (2008), 900-913. 4 – reference: Sadana R., Major T., Dove A., Stasko J.: Onset: A visualization technique for large-scale binary set data. IEEE Trans. on Visualization and Computer Graphics 20, 12 (2014), 1993-2002. 2 – reference: Lex A., Gehlenborg N., Strobelt H., Vuillemot R., Pfister H.: Upset: Visualization of intersecting sets. IEEE Trans. on Visualization and Computer Graphics 20, 12 (2014), 1983-1992. 2, 4 – reference: von Landesberger T., Kuijper A., Schreck T., Kohlhammer J., van Wijk J., Fekete J.-D., Fellner D.: Visual analysis of large graphs: State-of-the-art and future research challenges. Computer Graphics Forum 30, 6 (2011), 1719-1749. 2 – reference: Herman I., Melançon G., Marshall M.: Graph visualization and navigation in information visualization: A survey. IEEE Trans. on Visualization and Computer Graphics 6, 1 (2000), 24-43. 2 – reference: Henry Riche N., Dwyer T.: Untangling Euler diagrams. IEEE Trans. on Visualization and Computer Graphics 16, 6 (2010), 1090-1099. 2 – reference: Hadlak S., Schumann H., Cap C., Wollenberg T.: Supporting the visual analysis of dynamic networks by clustering associated temporal attributes. IEEE Trans. on Visualization and Computer Graphics 19, 12 (2013), 2267-2276. 2 – reference: Simonetto P., Auber D., Archambault D.: Fully automatic visualisation of overlapping sets. Computer Graphics Forum 28, 3 (2009), 967-974. 2 – reference: Collins C., Penn G., Carpendale S.: Bubble Sets: Revealing set relations with isocontours over existing visualizations. IEEE Trans. on Visualization and Computer Graphics 15, 6 (2009), 1009-1016. 2 – reference: van den Elzen S., van Wijk J.: Multivariate network exploration and presentation: From detail to overview via selections and aggregations. IEEE Trans. on Visualization and Computer Graphics 20, 12 (2014), 2310-2319. 2 – reference: Ravasz E., Somera A., Mongru D., Oltvai Z., Barabási A.: Hierarchical organization of modularity in metabolic networks. Science 297, 5586 (2002), 1551-1555. 2 – reference: Alsallakh B., Aigner W., Miksch S., Hauser H.: Radial sets: Interactive visual analysis of large overlapping sets. IEEE Trans. on Visualization and Computer Graphics 19, 12 (2013), 2496-2505. 2 – reference: Madhyastha T.M., Grabowski T.J.: Age-related differences in the dynamic architecture of intrinsic networks. Brain connectivity 4, 4 (2014), 231-241. 8, 9 – reference: De Berg M., Van Kreveld M., Overmars M., Schwarzkopf O.C.: Computational geometry. Springer, 2000. 5 – reference: Adamcsek B., Palla G., Farkas I.J., Derényi I., Vicsek T.: Cfinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22, 8 (2006), 1021-1023. 2 – reference: Ahn Y.-Y., Bagrow J., Lehmann S.: Link communities reveal multiscale complexity in networks. Nature 466, 7307 (2010), 761-764. 2, 5, 8 – reference: Kosara R., Bendix F., Hauser H.: Parallel sets: interactive exploration and visual analysis of categorical data. IEEE Trans. on Visualization and Computer Graphics 12, 4 (2006), 558-568. 2 – start-page: 48 year: 2012 end-page: 53 – volume: 14 start-page: 900 issue: 4 year: 2008 end-page: 913 article-title: GrouseFlocks: Steerable exploration of graph hierarchy space publication-title: IEEE Trans. on Visualization and Computer Graphics – start-page: 121 year: 2009 end-page: 128 – volume: 16 start-page: 1090 issue: 6 year: 2010 end-page: 1099 article-title: Untangling Euler diagrams publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 19 start-page: 2486 issue: 12 year: 2013 end-page: 2495 article-title: Visualizing fuzzy overlapping communities in networks publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 19 start-page: 2267 issue: 12 year: 2013 end-page: 2276 article-title: Supporting the visual analysis of dynamic networks by clustering associated temporal attributes publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 1984 start-page: 45 year: 2001 end-page: 76 – start-page: 201 year: 2013 end-page: 208 – year: 2000 – volume: 6 start-page: 24 issue: 1 year: 2000 end-page: 43 article-title: Graph visualization and navigation in information visualization: A survey publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 12 start-page: 741 issue: 5 year: 2006 end-page: 748 article-title: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 20 start-page: 1983 issue: 12 year: 2014 end-page: 1992 article-title: Upset: Visualization of intersecting sets publication-title: IEEE Trans. on Visualization and Computer Graphics – start-page: 17 year: 2004 end-page: 24 – year: 2014 – volume: 20 start-page: 2310 issue: 12 year: 2014 end-page: 2319 article-title: Multivariate network exploration and presentation: From detail to overview via selections and aggregations publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 40 start-page: 27 issue: 1 year: 2003 end-page: 37 article-title: Colorbrewer publication-title: The Cartographic Journal – volume: 19 start-page: 2496 issue: 12 year: 2013 end-page: 2505 article-title: Radial sets: Interactive visual analysis of large overlapping sets publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 20 start-page: 1993 issue: 12 year: 2014 end-page: 2002 article-title: Onset: A visualization technique for large‐scale binary set data publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 28 start-page: 967 issue: 3 year: 2009 end-page: 974 article-title: Fully automatic visualisation of overlapping sets publication-title: Computer Graphics Forum – volume: 22 start-page: 1021 issue: 8 year: 2006 end-page: 1023 article-title: Cfinder: locating cliques and overlapping modules in biological networks publication-title: Bioinformatics – volume: 12 start-page: 558 issue: 4 year: 2006 end-page: 568 article-title: Parallel sets: interactive exploration and visual analysis of categorical data publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 466 start-page: 761 issue: 7307 year: 2010 end-page: 764 article-title: Link communities reveal multiscale complexity in networks publication-title: Nature – volume: 31 start-page: 875 issue: 3pt1 year: 2012 end-page: 884 article-title: Kelp diagrams: Point set membership visualization publication-title: Computer Graphics Forum – volume: 19 start-page: 1846 issue: 11 year: 2013 end-page: 1858 article-title: Kelpfusion: A hybrid set visualization technique publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 4 start-page: 928 issue: 4 year: 2004 end-page: 942 article-title: Functional and topological characterization of protein interaction networks publication-title: Proteomics – start-page: 1 year: 2006 end-page: 5 – volume: 297 start-page: 1551 issue: 5586 year: 2002 end-page: 1555 article-title: Hierarchical organization of modularity in metabolic networks publication-title: Science – volume: 4 start-page: 231 issue: 4 year: 2014 end-page: 241 article-title: Age‐related differences in the dynamic architecture of intrinsic networks publication-title: Brain connectivity – start-page: 41 year: 2011 end-page: 50 – volume: 15 start-page: 1009 issue: 6 year: 2009 end-page: 1016 article-title: Bubble Sets: Revealing set relations with isocontours over existing visualizations publication-title: IEEE Trans. on Visualization and Computer Graphics – volume: 30 start-page: 1719 issue: 6 year: 2011 end-page: 1749 article-title: Visual analysis of large graphs: State‐of‐the‐art and future research challenges publication-title: Computer Graphics Forum – year: 2013 – ident: e_1_2_14_27_2 doi: 10.1111/j.1467-8659.2009.01452.x – ident: e_1_2_14_3_2 doi: 10.1038/nature09182 – volume-title: EuroVis – Short Papers year: 2013 ident: e_1_2_14_19_2 – ident: e_1_2_14_33_2 doi: 10.1109/TVCG.2013.232 – ident: e_1_2_14_9_2 doi: 10.1007/978-3-662-04245-8 – ident: e_1_2_14_31_2 doi: 10.1109/PacificVis.2013.6596146 – ident: e_1_2_14_8_2 doi: 10.1109/TVCG.2009.122 – ident: e_1_2_14_28_2 doi: 10.1109/TVCG.2014.2346249 – ident: e_1_2_14_32_2 doi: 10.1111/j.1467-8659.2011.01898.x – ident: e_1_2_14_4_2 doi: 10.1109/TVCG.2008.34 – ident: e_1_2_14_16_2 doi: 10.1109/TVCG.2013.198 – ident: e_1_2_14_17_2 doi: 10.1109/PACIFICVIS.2009.4906846 – ident: e_1_2_14_23_2 doi: 10.1109/IV.2012.19 – ident: e_1_2_14_14_2 doi: 10.1109/TVCG.2006.147 – ident: e_1_2_14_20_2 doi: 10.1109/TVCG.2014.2346248 – ident: e_1_2_14_12_2 doi: 10.1179/000870403235002042 – ident: e_1_2_14_26_2 doi: 10.1126/science.1073374 – ident: e_1_2_14_11_2 doi: 10.1109/INFVIS.2004.1 – ident: e_1_2_14_25_2 doi: 10.1109/TVCG.2013.76 – ident: e_1_2_14_22_2 doi: 10.1145/1168149.1168168 – ident: e_1_2_14_18_2 doi: 10.1109/TVCG.2006.76 – ident: e_1_2_14_29_2 – ident: e_1_2_14_34_2 doi: 10.1002/pmic.200300636 – ident: e_1_2_14_2_2 doi: 10.1109/TVCG.2013.184 – ident: e_1_2_14_24_2 doi: 10.1089/brain.2013.0205 – ident: e_1_2_14_30_2 doi: 10.1109/TVCG.2014.2346441 – ident: e_1_2_14_13_2 doi: 10.1109/2945.841119 – ident: e_1_2_14_5_2 – ident: e_1_2_14_15_2 doi: 10.1109/TVCG.2010.210 – start-page: 45 volume-title: Lecture Notes in Computer Science year: 2001 ident: e_1_2_14_7_2 – ident: e_1_2_14_6_2 doi: 10.1093/bioinformatics/btl039 – ident: e_1_2_14_10_2 doi: 10.1111/j.1467-8659.2012.03080.x – ident: e_1_2_14_21_2 doi: 10.1109/VAST.2011.6102440 |
SSID | ssj0004765 |
Score | 2.1237073 |
Snippet | Node grouping is a common way of adding structure and information to networks that aids their interpretation. However, certain networks benefit from the... |
SourceID | proquest crossref wiley istex |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 311 |
SubjectTerms | Aids Analysis Categories and Subject Descriptors (according to ACM CCS) Communications networks Communities Computer graphics Computer Graphics [I.3.3]: Picture/Image Generation-Line and curve generation Correlation analysis Information science Links Networks Neurosciences Prototypes Scientists Studies Visualization |
Title | Dual Adjacency Matrix: Exploring Link Groups in Dense Networks |
URI | https://api.istex.fr/ark:/67375/WNG-D0QC6ZBR-0/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.12643 https://www.proquest.com/docview/1697244824 https://www.proquest.com/docview/1778027120 |
Volume | 34 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3raxNBEB9K-8V-qK9KU2tYRaRfEnKP3b0oCDUxLWICVktLKSz7LDblKk0Cwb_emXuZigXxy3Fws8fezM7Nb3ZnfwvwOiTaZ5HlHQzVeEnQFoYnvU4WjNcm5rYXaEV3PBFHJ-mnM362Bu_qvTAlP0Qz4UaeUfyvycG1ma04ub0M3QjDOTF9Uq0WAaLj39RRqRS85vUmxpiKVYiqeJqWd2LRBql1eQdorsLVIt6MHsJF3dOyzGTaXcxN1_78g8TxPz_lEWxVOJQdlAPnMaz5_AlsrrATPoX3wwVJuCttaX8mGxOb__Ita8r2GCWyrJi9mrHvORtiSuzZpCwsn23Dyejjt8FRpzpuoWNTOtFNJ0LGsUaAkziRGu36TieRk4gBOefBGhNTnJNBi-A9pmmZNVpIJ12GDU1InsF6fpP7HWCCSPKTmLuI2G1c0NwjUjIxgkMbTOi3YL9WvLIVFzkdiXGt6pwEVaIKlbTgVSP6oyTg-JvQm8J6jYS-nVLFmuTqdHKohr0vA3H-4Vj1WrBXm1dVzjpTkehLRDlZnLbgZfMY3YzWTnTubxYoI2WGGXwU4yv2C1ve3xs1OBwVN7v_LvocHiAU42UR2h6sz28X_gXCnblpw8bBcPz5a7sY378AYFj5gw |
linkProvider | Wiley-Blackwell |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3daxNBEB9q-6A--F2MrbqKSF8Scre3uxcRQRPTqE3A0mIRyrKfopVraRIo_vXO3JepKIgvx8HNHnuzOze_2Z39DcCzyE3IEye66KrxwnEsrOD9bh5tMDYVrh9pR3c6k5PD7P2ROFqDl81ZmIofol1wI8so_9dk4LQgvWLl7kvsJejP-RXYoIreVL9gtP-LPCpTUjTM3sQZU_MKUR5P2_SSN9ogxV5cgpqrgLX0OOObcNz0tUo0OektF7bnfvxG4_i_H3MLbtRQlL2u5s5tWAvFHbi-QlB4F16NliThvxlHRzTZlAj9L16wNnOPUSzLygWsOftasBFGxYHNqtzy-T04HL89GE66dcWFrsuoqJvhUqWpQYzDvcys8QNveOIVwkAhRHTWpuTqVDQyhoCRWu6skcorn2NDG_kmrBenRbgPTBJPPk-FT4jgxkcjAoIlmyI-dNHGQQd2Gs1rV9ORU1WM77oJS1AlulRJB562omcVB8efhJ6Xw9dKmPMTSlpTQn-a7epR_-NQfn6zr_sd2G7GV9f2OteJHCgEOnmadeBJ-xgtjbZPTBFOlyijVI5BfJLiK3bKwfx7b_Rwd1zePPh30cdwdXIw3dN772YftuAaIjNR5aRtw_rifBkeIvpZ2EflJP8JGVD8CQ |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3raxQxEB9qC6IftPWBp7VGEemXO243m2RPQWjvvD60hxaLRYSQp2hlW3p3UPzrndmXV7EgflkWdrJkZzI7v0kmvwA8j9yEPHGii6EaLxxtYQXvd_Nog7GpcP1IK7oHE7l7lO0fi-MleNXshan4IdoJN_KM8n9NDn7m44KTu6-xl2A459dgJZPoLISIDn9zR2VKiobYmyhjalohKuNpm14KRiuk14tLSHMRr5YBZ3wbvjRdrepMTnrzme25n3-wOP7nt6zCrRqIsq1q5KzBUijuwM0FesK78Ho0Jwn_3TjaoMkOiM7_4iVr6_YYZbKsnL6asm8FG2FOHNikqiyf3oOj8ZuPw91ufd5C12V0pJvhUqWpQYTDvcys8QNveOIVgkAhRHTWphToVDQyhoB5Wu6skcorn2NDG_l9WC5Oi_AAmCSWfJ4KnxC9jY9GBIRKNkV06KKNgw5sNorXriYjpzMxfugmKUGV6FIlHXjWip5VDBx_E3pRWq-VMOcnVLKmhP402dGj_oeh_Lx9qPsdWG_Mq2tvnepEDhTCnDzNOvC0fYx-Rosnpginc5RRKscUPknxFZulLa_ujR7ujMubh_8u-gSuvx-N9bu9ydtHcANhmagK0tZheXY-D48R-szsRjnEfwE_V_rB |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Dual+Adjacency+Matrix%3A+Exploring+Link+Groups+in+Dense+Networks&rft.jtitle=Computer+graphics+forum&rft.au=Dinkla%2C+K.&rft.au=Riche%2C+N.+Henry&rft.au=Westenberg%2C+M.A.&rft.date=2015-06-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=34&rft.issue=3&rft.spage=311&rft.epage=320&rft_id=info:doi/10.1111%2Fcgf.12643&rft.externalDBID=10.1111%252Fcgf.12643&rft.externalDocID=CGF12643 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon |