arXiv:2605. 08759v3 Announce Type: replace Abstract: Existing granular-ball generation methods are still mainly driven by handcrafted quality measures and heuristic splitting or stopping criteria, which may weaken the transparency of local generation decisions in clustering.
By Zeqiang Xian, Caihui Liu, Yong Zhang, Wenjing Qiu, Duoqian Miao, Witold Pedrycz
arXiv:2608. 06990v1 Announce Type: cross Abstract: Clustering is a fundamental data mining technique for pattern recognition through unsupervised learning.
By Yuning Yu, Jos\'e Rodr\'iguez-Pi\~neiro, Xuefeng Yin, Bin Feng
The paper introduces MGHRL, a framework for hypergraph representation learning that adapts hyperedge granularity through a granular-ball splitting strategy. It constructs hyperedges at multiple levels of detail, capturing high-order relationships tailored to the graph’s topology. A multi-granularity hypergraph network then processes these hyperedges with sub-networks and hierarchical reversible connections, achieving superior performance on benchmark datasets.
By Sen Zhao, Yifan Guan, Jinyuan Ni, Gaojie Xu, Zhang Xu, Xiaoyu Lian, Yi Liu, Yi Wang, Wei Wang
arXiv:2606. 05230v1 Announce Type: cross Abstract: Selecting a clustering algorithm and its hyperparameters without labels is a common difficulty in engineering machine learning pipelines that work with unsupervised analysis of sensor, image, or process data.
By Mahdi Shamsi, Soosan Beheshti
The paper introduces the Universal Clustering Problem (UCP), a framework that captures the optimisation core common to many clustering methods by maximizing a polynomial‑time computable partition utility over a finite metric space. It proves UCP is NP‑hard through reductions from graph colouring and exact cover by 3‑sets, showing that popular algorithms such as k‑means, GMMs, DBSCAN, spectral clustering, and affinity propagation inherit this intractability. The authors argue that this unified hardness explains typical failure modes—like local optima and greedy merge traps—and suggest moving toward stability‑aware objectives and interaction‑driven formulations with explicit guarantees.
By Angshul Majumdar
arXiv:2607. 29115v1 Announce Type: cross Abstract: Link prediction aims to identify potential or future connections within a given graph structure.
By Sen Zhao, Cheng Liu, Shuyin Xia, Zhiyuan Liu, Yi Liu, Yi Wang, Wei Wang