Graph clustering with Boltzmann machines. (arXiv:2203.02471v3 [cs.LG] UPDATED)

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 heuristic
approximation to the intra-cluster density maximization problem. We use two
variations of a Boltzmann machine heuristic to obtain numerical solutions. For
benchmarking purposes, we compare solution quality and computational
performances to those obtained using a commercial solver, Gurobi. We also
compare clustering quality to the clusters obtained …

arxiv boltzmann clustering graph machines