RaDE+: A semantic rank-based graph embedding algorithm

Página do item simplificado
dc.contributor.authorde Fernando, Filipe Alves [UNESP]
dc.contributor.authorPedronette, Daniel Carlos Guimarães [UNESP]
dc.contributor.authorde Sousa, Gustavo José [UNESP]
dc.contributor.authorValem, Lucas Pascotti [UNESP]
dc.contributor.authorGuilherme, Ivan Rizzo [UNESP]
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.date.accessioned2023-03-02T02:49:45Z
dc.date.available2023-03-02T02:49:45Z
dc.date.issued2022-04-01
dc.description.abstractDue to the possibility of capturing complex relationships existing between nodes, many applications benefit from being modeled with graphs. However, performance issues can be observed in large-scale networks, making it computationally unfeasible to process in various scenarios. Graph Embedding methods emerge as a promising solution for finding low-dimensional vector representations for graphs, preserving their original properties such as topological characteristics, affinity, and shared neighborhood between nodes. Based on the vectorial representations, retrieval and machine learning techniques can be exploited to execute tasks such as classification, clustering, and link prediction. In this work, we propose RaDE (Rank Diffusion Embedding), an effective and efficient approach that considers rank-based graphs and representative nodes selection for learning a low-dimensional vector. We also present RaDE+, a variant that considers multiple representative nodes for more robust representations. The proposed approach was evaluated on 8 network datasets, including social, co-reference, textual, and image networks, with different properties. Vector representations generated with RaDE achieved effective results in visualization and retrieval tasks when compared to vector representations generated by other recent related methods.en
dc.description.affiliationUNESP: Universidade Estadual Paulista Julio de Mesquita Filho Limeira
dc.description.affiliationUnespUNESP: Universidade Estadual Paulista Julio de Mesquita Filho Limeira
dc.identifierhttp://dx.doi.org/10.1016/j.jjimei.2022.100078
dc.identifier.citationInternational Journal of Information Management Data Insights, v. 2, n. 1, 2022.
dc.identifier.doi10.1016/j.jjimei.2022.100078
dc.identifier.issn2667-0968
dc.identifier.scopus2-s2.0-85130753178
dc.identifier.urihttp://hdl.handle.net/11449/241880
dc.language.isoeng
dc.relation.ispartofInternational Journal of Information Management Data Insights
dc.sourceScopus
dc.subjectDiffusion
dc.subjectGraph embedding
dc.subjectInterpretability
dc.subjectNetwork representation learning
dc.subjectRanking
dc.subjectSemantic
dc.subjectUnsupervised
dc.titleRaDE+: A semantic rank-based graph embedding algorithmen
dc.typeArtigo
unesp.author.orcid0000-0002-2867-4838[2]
unesp.author.orcid0000-0002-3610-3779[5]

Arquivos

Coleções

Artigos - Estatistica, Matemática Aplicada e Computação - IGCE