AI RESEARCH
Local Clustering on Complex Graphs and Complex Hypergraphs
arXiv CS.LG
•
ArXi:2412.03008v2 Announce Type: replace-cross Local/seeded clustering aims to find a compact cluster near the given starting instances. While most existing studies on graph clustering assume a discrete graph setting (i.e., unweighted, undirected graphs without self-loops), real-world graphs can be complex.