Buscar
Mostrando ítems 1-10 de 335
Fast node embeddings: learning ego-centric representations
(Universidade Federal de Minas GeraisUFMG, 2018-02-26)
Representation learning is one of the foundations of Deep Learning and allowed important improvements on several Machine Learning tasks, such as Neural Machine Translation, Question Answering and Speech Recognition. Recent ...
RaDE: A rank-based graph embedding approach
(2020-01-01)
Due to possibility of capturing complex relationships existing between nodes, many application benefit of being modeled with graphs. However, performance issues can be observed on large scale networks, making it computationally ...
RaDE: A Rank-based Graph Embedding Approach
(Scitepress, 2020-01-01)
Due to possibility of capturing complex relationships existing between nodes, many application benefit of being modeled with graphs. However, performance issues can be observed on large scale networks, making it computationally ...
Predicting wireless RSSI using machine learning on graphs.
(IEEE, 2021)
In wireless communications, optimizing the resource allocation requires the knowledge of the state of the channel. This is even more important in device-to-device communications, one typical use case in 5G/6G networks, ...
Online change point detection for random dot product graphs.
(IEEE, 2021)
Given a sequence of random graphs, we address the problem of online monitoring and detection of changes in the underlying data distribution. To this end, we adopt the Random Dot Product Graph (RDPG) model which postulates ...
Algorithmic advances for the adjacency spectral embedding
(IEEE, 2022)
The Random Dot Product Graph (RDPG) is a popular generative graph model for relational data. RDPGs postulate there exist latent positions for each node, and specifies the edge formation probabilities via the inner product ...
Online change point detection for weighted and directed random dot product graphs
(IEEE, 2022)
Given a sequence of random (directed and weighted) graphs, we address the problem of online monitoring and detection of changes in the underlying data distribution. Our idea is to endow sequential change-point detection ...
Rank-based self-training for graph convolutional networks
(2021-03-01)
Graph Convolutional Networks (GCNs) have been established as a fundamental approach for representation learning on graphs, based on convolution operations on non-Euclidean domain, defined by graph-structured data. GCNs and ...