Ising-Based Louvain Method: Clustering Large Graphs with Specialized Hardware
Recent advances in specialized hardware for solving optimization problems such quantum computers, quantum annealers, and CMOS annealers give rise to new ways for solving real-word complex problems. However, given current and near-term hardware limitations, the number of variables required to express a large real-world problem easily exceeds the hardware capabilities, thus hybrid methods are usually developed in order to utilize the hardware. In this work, we advocate for the development of hybrid methods that are built on top of the frameworks of existing state-of-art heuristics, thereby improving these methods. We demonstrate this by building on the so called Louvain method, which is one of the most popular algorithms for the Community detection problem and develop and Ising-based Louvain method. The proposed method outperforms two state-of-the-art community detection algorithms in clustering several small to large-scale graphs. The results show promise in adapting the same optimization approach to other unsupervised learning heuristics to improve their performance.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringCommunity DetectionSimilar Papers 제목 키워드 기반
Generative hypergraph clustering: from blockmodels to modularity
Hypergraphs are a natural modeling paradigm for a wide range of complex relational systems. A standard analysis task is to identify clusters of closely related or densely interconnected nodes. Many graph algorithms for t…
ClusteringCommunity DetectionGraph ClusteringEnsemble Clustering for Graphs
We propose an ensemble clustering algorithm for graphs (ECG), which is based on the Louvain algorithm and the concept of consensus clustering. We validate our approach by replicating a recently published study comparing …
ClusteringGraph ClusteringGraph clustering with Boltzmann machines
Graph clustering is the process of grouping vertices into densely connected sets called clusters. We tailor two mathematical programming formulations from the literature, to this problem. In doing so, we obtain a heurist…
BenchmarkingClusteringGraph ClusteringLouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding
Network embedding, that aims to learn low-dimensional vector representation of nodes such that the network structure is preserved, has gained significant research attention in recent years. However, most state-of-the-ar…
Community DetectionGraph EmbeddingNetwork EmbeddingNode Classification+1LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding.
Network embedding, that aims to learn low-dimensional vector representation of nodes such that the network structure is preserved, has gained significant research attention in recent years. However, most state-of-the-art…
ClusteringCommunity DetectionNetwork EmbeddingNode Classification+1