VECoDeR - Variational Embeddings for Community Detection and Node Representation
In this paper, we study how to simultaneously learn two highly correlated tasks of graph analysis, i.e., community detection and node representation learning. We propose an efficient generative model called VECoDeR for jointly learning Variational Embeddings for COmmunity DEtection and node Representation. VECoDeR assumes that every node can be a member of one or more communities. The node embeddings are learned in such a way that connected nodes are not only ``closer" to each other but also share similar community assignments. A joint learning framework leverages community-aware node embeddings for better community detection. We demonstrate on several graph datasets that VECoDeR effectively outperforms many competitive baselines on all three tasks i.e. node classification, overlapping community detection and non-overlapping community detection. We also show that VECoDeR is computationally efficient and has quite robust performance with varying hyperparameters.
Code (0)
등록된 구현이 없습니다.
Tasks
Community DetectionNode ClassificationRepresentation LearningSimilar Papers 제목 키워드 기반
Variational Embeddings for Community Detection and Node Representation
In this paper, we study how to simultaneously learn two highly correlated tasks of graph analysis, i.e., community detection and node representation learning. We propose an efficient generative model called VECoDeR for j…
Community DetectionNode ClassificationRepresentation LearningCommunity Detection Guarantees Using Embeddings Learned by Node2Vec
Embedding the nodes of a large network into an Euclidean space is a common objective in modern machine learning, with a variety of tools available. These embeddings can then be used as features for tasks such as communit…
ClusteringCommunity DetectionLink PredictionNode ClusteringvGraph: A Generative Model for Joint Community Detection and Node Representation Learning
This paper focuses on two fundamental tasks of graph analysis: community detection and node representation learning, which capture the global and local structures of graphs, respectively. In the current literature, these…
Community DetectionRepresentation LearningVariational InferenceSpeaker Diarization with Overlapping Community Detection Using Graph Attention Networks and Label Propagation Algorithm
In speaker diarization, traditional clustering-based methods remain widely used in real-world applications. However, these methods struggle with the complex distribution of speaker embeddings and overlapping speech segme…
Action DetectionActivity DetectionClusteringCommunity Detection+3Graph Representation Learning via Ladder Gamma Variational Autoencoders
We present a probabilistic framework for community discovery and link prediction for graph-structured data, based on a novel, gamma ladder variational autoencoder (VAE) architecture. We model each node in the graph via a…
Graph Representation LearningLink PredictionRepresentation Learning