Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPAW/3PFSGP8
Repositorysid.inpe.br/sibgrapi/2017/08.22.04.04
Last Update2017:08.22.04.04.25 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2017/08.22.04.04.25
Metadata Last Update2022:06.14.00.09.04 (UTC) administrator
DOI10.1109/SIBGRAPI.2017.22
Citation KeyDiasMaDiPeSiNo:2017:HiNeSi
TitleA Hierarchical Network Simplification Via Non-Negative Matrix Factorization
FormatOn-line
Year2017
Access Date2024, Oct. 15
Number of Files1
Size1347 KiB
2. Context
Author1 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
Affiliation1 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
EditorTorchelsen, 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 Addressmarkusdiegossd@gmail.com
Conference NameConference on Graphics, Patterns and Images, 30 (SIBGRAPI)
Conference LocationNiterói, RJ, Brazil
Date17-20 Oct. 2017
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2017-08-22 04:04:25 :: markusdiegossd@gmail.com -> administrator ::
2022-06-14 00:09:04 :: administrator -> :: 2017
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsgraph
matching
simplification
non-negative matrix factorization
AbstractVisualization 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.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2017 > A Hierarchical Network...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > A Hierarchical Network...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 22/08/2017 01:04 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPAW/3PFSGP8
zipped data URLhttp://urlib.net/zip/8JMKD3MGPAW/3PFSGP8
Languageen
Target FilePID4960567.pdf
User Groupmarkusdiegossd@gmail.com
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPAW/3PKCC58
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2017/09.12.13.04 36
sid.inpe.br/sibgrapi/2022/06.10.21.49 2
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close