Graph-based data clustering via multiscale community detection
We present a graph-theoretical approach to data clustering, which combines the creation of a graph from the data with Markov Stability, a multiscale community detection framework. We show how the multiscale capabilities of the method allow the estimation of the number of clusters, as well as alleviating the sensitivity to the parameters in graph construction. We use both synthetic and benchmark real datasets to compare and evaluate several graph construction methods and clustering algorithms, and show that multiscale graph-based clustering achieves improved performance compared to popular clustering methods without the need to set externally the number of clusters.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringCommunity Detectiongraph constructionSensitivitySimilar Papers 제목 키워드 기반
Community Detection Graph Convolutional Network for Overlap-Aware Speaker Diarization
The clustering algorithm plays a crucial role in speaker diarization systems. However, traditional clustering algorithms suffer from the complex distribution of speaker embeddings and lack of digging potential relationsh…
ClusteringCommunity DetectionGraph Generationspeaker-diarization+1Multiscale Graph Construction Using Non-local Cluster Features
This paper presents a multiscale graph construction method using both graph and signal features. Multiscale graph is a hierarchical representation of the graph, where a node at each level indicates a cluster in a finer r…
ClusteringGraph Clusteringgraph constructionPoint Cloud SegmentationCommunity Detection Clustering via Gumbel Softmax
Recently, in many systems such as speech recognition and visual processing, deep learning has been widely implemented. In this research, we are exploring the possibility of using deep learning in community detection amon…
ClusteringCommunity DetectionDeep LearningGraph Clustering+4Curvature-based Clustering on Graphs
Unsupervised node clustering (or community detection) is a classical graph learning task. In this paper, we study algorithms, which exploit the geometry of the graph to identify densely connected substructures, which for…
ClusteringCommunity DetectionGraph LearningNode ClusteringDeep Graph Clustering via Mutual Information Maximization and Mixture Model
Attributed graph clustering or community detection which learns to cluster the nodes of a graph is a challenging task in graph analysis. In this paper, we introduce a contrastive learning framework for learning clusterin…
ClusteringCommunity DetectionContrastive LearningGraph Clustering+1