arXiv:2605. 22410v2 Announce Type: replace Abstract: Spectral clustering largely depends on the affinity graph, yet constructing a graph that preserves reliable local connectivity while adapting to heterogeneous data structures remains challenging.
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.
arXiv:2608. 06990v1 Announce Type: cross Abstract: Clustering is a fundamental data mining technique for pattern recognition through unsupervised learning.
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.
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.
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.
arXiv:2607. 29115v1 Announce Type: cross Abstract: Link prediction aims to identify potential or future connections within a given graph structure.
arXiv:2609.26748v1 Announce Type: cross Abstract: Clustering is an unsupervised learning technique that partitions unlabeled data into groups. Most existing methods require user-specified parameters,...
arXiv:2606. 12077v1 Announce Type: new Abstract: Time-series clustering remains challenging due to the inherent trade-off between clustering effectiveness and computational efficiency.
The paper introduces RicciPool, a graph pooling method that incorporates higher‑order connectivity via Ollivier‑Ricci curvature to reweight edges before spectral clustering. Unlike traditional pooling approaches that focus only on rough topology, RicciPool leverages local connection information to improve cluster assignment. Experiments on protein and social network datasets demonstrate its effectiveness.
arXiv:2606. 13007v1 Announce Type: cross Abstract: Clustering is fundamental to scRNA-seq analysis, serving as a cornerstone for identifying cell populations and resolving tissue heterogeneity.
arXiv:2512. 16558v3 Announce Type: replace Abstract: Clustering is a cornerstone of modern data analysis.
arXiv:2607. 05469v1 Announce Type: cross Abstract: Unsupervised graph clustering is a fundamental technique for uncovering underlying semantic patterns in large-scale networks.