Graph clustering with Boltzmann machines

DOI10.1016/j.dam.2023.10.012arXiv2203.02471OpenAlexW4226056692MaRDI QIDQ6140246

Pierre Miasnikof, Mohammad Bagherbeik, Ali Sheikholeslami

Publication date: 2 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.02471

zbMATH Keywords

combinatorial optimizationmeta-heuristicsgraph clusteringBoltzmann machinenetwork community detection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Fast community detection by SCORE
• Community detection by modularity maximization using GRASP with path relinking
• Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
• Robust optimization of graph partitioning involving interval uncertainty
• Graph clustering
• Modularity in several random graph models
• Linear and quadratic programming approaches for the general graph partitioning problem
• Modularity of complex networks models
• Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
• Graph Clustering Via Intra-Cluster Density Maximization
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Community structure in social and biological networks
• Least squares quantization in PCM
• Resistance distance distribution in large sparse random graphs
• Fast unfolding of communities in large networks
• A Statistical Performance Analysis of Graph Clustering Algorithms
• Bad communities with high modularity

This page was built for publication: Graph clustering with Boltzmann machines