Identity statement area | |
Reference Type | Conference Paper (Conference Proceedings) |
Site | sibgrapi.sid.inpe.br |
Identifier | 8JMKD3MGPAW/3PFSGP8 |
Repository | sid.inpe.br/sibgrapi/2017/08.22.04.04 |
Last Update | 2017:08.22.04.04.25 administrator |
Metadata | sid.inpe.br/sibgrapi/2017/08.22.04.04.25 |
Metadata Last Update | 2020:02.19.02.01.42 administrator |
Citation Key | DiasMaDiPeSiNo:2017:HiNeSi |
Title | A Hierarchical Network Simplification Via Non-Negative Matrix Factorization  |
Format | On-line |
Year | 2017 |
Access Date | 2021, Jan. 26 |
Number of Files | 1 |
Size | 1347 KiB |
Context area | |
Author | 1 Dias, Markus Diego Sampaio da Silva 2 Mansour, Moussa R. 3 Dias, Fabio 4 Petronetto, Fabiano 5 Silva, Cláudio T. 6 Nonato, Luis Gustavo |
Affiliation | 1 Universidade de São Paulo 2 Universidade de São Paulo 3 Universidade de São Paulo 4 Universidade Federal do Espírito Santo 5 New York University 6 Universidade de São Paulo |
Editor | Torchelsen, Rafael Piccin Nascimento, Erickson Rangel do Panozzo, Daniele Liu, Zicheng Farias, Mylène Viera, Thales Sacht, Leonardo Ferreira, Nivan Comba, João Luiz Dihl Hirata, Nina Schiavon Porto, Marcelo Vital, Creto Pagot, Christian Azambuja Petronetto, Fabiano Clua, Esteban Cardeal, Flávio |
e-Mail Address | markusdiegossd@gmail.com |
Conference Name | Conference on Graphics, Patterns and Images, 30 (SIBGRAPI) |
Conference Location | Niterói, RJ |
Date | Oct. 17-20, 2017 |
Book Title | Proceedings |
Publisher | IEEE Computer Society |
Publisher City | Los Alamitos |
Tertiary Type | Full Paper |
History | 2017-08-22 04:04:25 :: markusdiegossd@gmail.com -> administrator :: 2020-02-19 02:01:42 :: administrator -> :: 2017 |
Content and structure area | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Content Type | External Contribution |
Keywords | graph, matching, simplification, non-negative matrix factorization. |
Abstract | Visualization tools play an important part in assisting analysts in the understanding of networks and underlying phenomena. However these tasks can be hindered by visual clutter. Simplification/decimation schemes have been a main alternative in this context. Nevertheless, network simplification methods have not been properly evaluated w.r.t. their effectiveness in reducing complexity while preserving relevant structures and content. Moreover, most simplification techniques only consider information extracted from the topology of the network, altogether disregarding additional content. In this work we propose a novel methodology to network simplification that leverages topological information and additional content associated with network elements. The proposed methodology relies on non-negative matrix factorization (NMF) and graph matching, combined to generate a hierarchical representation of the network, grouping the most similar elements in each level of the hierarchy. Moreover, the matrix factorization is only performed at the beginning of the process, reducing the computational cost without compromising the quality of the simplification. The effectiveness of the proposed methodology is assessed through a comprehensive set of quantitative evaluations and comparisons, which shows that our approach outperforms existing simplification methods. |
source Directory Content | there are no files |
agreement Directory Content | |
Conditions of access and use area | |
data URL | http://urlib.net/rep/8JMKD3MGPAW/3PFSGP8 |
zipped data URL | http://urlib.net/zip/8JMKD3MGPAW/3PFSGP8 |
Language | en |
Target File | PID4960567.pdf |
User Group | markusdiegossd@gmail.com |
Visibility | shown |
Update Permission | not transferred |
Allied materials area | |
Mirror Repository | sid.inpe.br/banon/2001/03.30.15.38.24 |
Next Higher Units | 8JMKD3MGPAW/3PJT9LS 8JMKD3MGPAW/3PKCC58 |
Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
Notes area | |
Empty Fields | accessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group holdercode isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume |
| |