Hierarchical Graph Clustering using Node Pair Sampling
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. We prove that this distance is reducible, which enables the use of the nearest-neighbor chain to speed up the agglomeration. The output of the algorithm is a regular dendrogram, which reveals the multi-scale structure of the graph. The results are illustrated on both synthetic and real datasets.
Code (3)
Tasks
ClusteringGraph ClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Graph Contrastive Learning via Cluster-refined Negative Sampling for Semi-supervised Text Classification
Graph contrastive learning (GCL) has been widely applied to text classification tasks due to its ability to generate self-supervised signals from unlabeled data, thus facilitating model training. However, existing GCL-ba…
ClassificationClusteringContrastive LearningSemi-Supervised Text Classification+2Efficient block contrastive learning via parameter-free meta-node approximation
Contrastive learning has recently achieved remarkable success in many domains including graphs. However contrastive loss, especially for graphs, requires a large number of negative samples which is unscalable and computa…
Contrastive LearningGPUGraph ClusteringENADPool: The Edge-Node Attention-based Differentiable Pooling for Graph Neural Networks
Graph Neural Networks (GNNs) are powerful tools for graph classification. One important operation for GNNs is the downsampling or pooling that can learn effective embeddings from the node representations. In this paper, …
Graph ClassificationHierarchical Position Embedding of Graphs with Landmarks and Clustering for Link Prediction
Learning positional information of nodes in a graph is important for link prediction tasks. We propose a representation of positional information using representative nodes called landmarks. A small number of nodes with …
ClusteringGraph ClusteringLink PredictionPositionSupervised Hierarchical Clustering using Graph Neural Networks for Speaker Diarization
Conventional methods for speaker diarization involve windowing an audio file into short segments to extract speaker embeddings, followed by an unsupervised clustering of the embeddings. This multi-step approach generates…
ClusteringGraph ClusteringGraph Neural Networkspeaker-diarization+1