A Generalized Sparse Fuzzy Clustering Framework with Automated Cluster Cardinality Estimation Ability
Authors: George Stamatelis, Konstantinos Koutroumbas
Organizations: Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, Athens 16122, Athens, Attica, Greece · Institute for Astronomy Astrophysics Space Applications and Remote Sensing, National Observatory of Athens, Vas. Pavlou & I. Metaxa, 15236, Penteli, Attica, Greece
Fuzzy clustering provides a robust framework for handling ambiguous and overlapping data boundaries, yet its traditional formulation generates entirely dense membership assignments that limit noise resilience and prevent estimating the true number of clusters, when it is unknown. To address these limitations, we introduce in this paper the Generalized Sparse Fuzzy Clustering (GSFC) framework, which incorporates a continuous sparsity penalty into the fuzzy objective function. Because closed-form solutions are precluded by the simultaneous presence of fuzzifier and sparsity exponents, we propose an efficient primal-dual bisection search coupled with specialized analytic pathways to rigorously enforce the partition constraint while organically driving trace memberships to exact zero. This mathematically enforced sparsity empowers the algorithm to autonomously estimate the true number of clusters by dynamically pruning redundant clusters, provided that it is initialized by a larger than the true number of clusters. Furthermore, we integrate a virtual noise sink to insulate outliers from the rest of the data points. The usage of the proposed framework is also extended to line segment detection. Extensive empirical evaluations across synthetic toy datasets, high-noise geometric stress tests, and real-world benchmarks (UCI wine dataset and hyperspectral images) demonstrate that GSFC effectively exceeds conventional fuzzy benchmarks while autonomously resolving cluster cardinality. Additionally, it significantly outperforms existing sparse possibilistic and probabilistic soft-clustering alternatives in line detection tasks.
Figures & tables
θj(t+1)=argminθj∑r=1Nurjq(t)d(xr,θj)
Algorithm 2 General Sparse Fuzzy Clustering (GSFC)
Figure 1: Visualization of GSFC’s pruning process
Metric
Algorithm
Initial m(0)
Estimated m∗
Score (Mean ± Std)
ARI
K-means
3
3
0.8968±0.0249
FCM
3
3
0.8785±0.0063
GMM
3
3
0.4084±0.0116
GSFC (Pathway 1)
6
3
0.8975±0.0000
GSFC (Pathway 2)
6
3
0.8975±0.0000
NMI
K-means
3
3
0.8737±0.0245
Table 1: Quantitative comparison on the UCI Wine dataset across 5 independent runs. Competitors are provided with the true number of clusters ( 3 ), whereas GSFC autonomously recovers it from an over-initialization of m(0)=6 .
Metric
Algorithm
Initial m(0)
Estimated m∗
Score (Mean ± Std)
ARI
K-means
2
2
0.6662±0.0105
FCM
2
2
0.6829±0.0000
GMM
2
2
0.0000±0.0000
GSFC (Pathway 1)
6
2
0.6883±0.0000
GSFC (Pathway 2)
6
2
0.4245±0.0000
NMI
K-means
2
2
0.5481±0.0134
Table 2: Quantitative comparison on the Breast Cancer Wisconsin (Diagnostic) (WDBC) dataset across 5 independent runs. Competitors are provided with the true number of clusters ( 2 ), whereas GSFC autonomously recovers or evaluates it from an over-initialization of m(0)=6 .
Figure 6: Case 1: 3 Line segments intersecting at a single point. While all methods can reconstruct the underlying geometry, the method of [ 28 ] introduces slight over-segmentation overestimating the true number of clusters. Both pathways and the algorithm of [ 16 ] estimate the correct number of clusters and produce the correct line segments.
Figure 7: Case 2: 8 Line segments intersecting at a single point. The algorithm of [ 28 ] suffers from hub fracturing: hard Bayes partitioning creates spatial contention at the dense junction, leaving several components prematurely truncated as radial half-spokes, while [ 16 ] exhibits phantom secants: unconstrained possibilistic memberships accumulate mass transversely across adjacent rays, yielding spurious chords near the hub while dropping one true diameter. Finally, the proposed GSFC can accurately infer the true geomery for both optimization pathways.
Figure 8: Case 3: Overlapping Rectangles/Floppy Disk. All algorithms can learn the underlying segments’ position and orientation, with minor performance difference. The method of [ 28 ] results in slightly shorter outside vertical segments (small empty spaces).
Figure 9: Case 4: Triangle with Horizonal Intersection Both proposed GSFC pathways accurately reconstruct the complex intersecting geometry of the four distinct line segments without fragmentation (although the left triangle side is slightly twisted for pathway 1). The method of [ 28 ] severely over-segments the structure resulting in 10 fragmented clusters. While the method of [ 16 ] identifies the correct number of clusters, the intersections act as heavy ’anchors’, physically twisting the estimated segments away from their ground-truth values.
Figure 10: Case 5: Imbalanced H-shaped Intersection The horizontal crossbar contains 2.5× the data of the vertical legs. The method of [ 28 ] exhibits severe over-segmentation ( m∗=9 ). While both [ 16 ] and the proposed GSFC pathway 1 ( q=1.5 ) accurately infer the true cluster cardinality ( m∗=3 ), their vertical legs display slight angular distortion induced by the denser crossbar points (albeit pathway 1 enables a slightly tighter reconstruction). In contrast, pathway 2 delivers near-perfect line segment extraction.
Figure 11: Stress-testing GSFC pathway 2 in line detection: The point generating model of [ 28 ] is considered with different segment/cluster variance levels σ . For variances up to σ=0.2 , the segment reconstruction is near perfect. For σ=0.22 and σ=0.3 , there is a small issue in the bottom line segment, which is split in two clusters, but the top intersecting segments are consistently estimated correctly.
Figure 12: Stress-testing the algorithm of [ 28 ] for line detection: Different segment/cluster variance levels σ are considered for the same point generating model. The algorithm is substantially less robust than GSFC, producing oversegmentation for σ≥0.1 , which is severely worsened as σ increases.
Figure 13: Stress-testing the algorithm of [ 16 ] for line detection: Different segment/cluster variance levels σ are considered for the same point generating model. While the algorithm can consistently identify the true number of clusters (besides the experiment with the largest σ ), some points are incorrectly assigned to the wrong segment (resulting in incorrectly estimated and overly long line segments), with the issue worsening as σ increases.
This paper introduces a semi-supervised clustering framework grounded in the statistical duality between grouping principles and anomaly detection. We address the challenge of robust cluster definition in noisy environments -- a task where partitioning algorithms often over-assign outliers and density-based methods remain sensitive to heuristic global parameters. Drawing on a-contrario statistical reasoning and Gestalt proximity principles, we define a cluster as a maximal subset of data points containing no anomalies relative to a null hypothesis of uniform randomness. Central to this approach is the Perception algorithm, which utilises a principled expectation-based threshold (E<1) to identify outliers without manual parameter tuning. By treating clustering as the dual of anomaly detection, we employ an iterative ``clustering-by-exclusion'' mechanism. The algorithm is seed-guided, leveraging minimal user-provided labels to initialise robust cluster medians and form initial groups, which are subsequently expanded by admitting non-anomalous points. This approach naturally isolates fringe points, isolated noise, and emerging unknown clusters. We evaluate the method on synthetic and real-world benchmarks, including image and text datasets represented through raw, linear-reduced, and neighbourhood-preserving embeddings. Results demonstrate that with as few as 10--30 seeds per cluster, the proposed method achieves competitive and often very strong performance under a practical low-tuning benchmarking protocol, while maintaining linear scalability with respect to both observations and dimensionality for a fixed number of seeded clusters and iterations.
Streaming clustering is a domain that has become extremely relevant in the age of big data, such as in network traffic analysis or in processing continuously-running sensor data. Furthermore, possibilistic models offer unique benefits over approaches from the literature, especially with the introduction of a "fuzzifier" parameter that controls how quickly typicality degrades as one gets further from cluster centers. We propose a single-pass possibilistic clustering (SPC) algorithm that is effective and easy to apply to new datasets. Key contributions of SPC include the ability to model non-spherical clusters, closed-form footprint updates over arbitrarily sized damped windows, and the employment of covariance union from the multiple hypothesis tracking literature to merge two cluster mean and covariance estimates. SPC is validated against five other streaming clustering algorithm on the basis of cluster purity and normalized mutual information.
Jeffrey Dale, James Keller, Aquila Galusha
Electrical Engineering and Computer Science Department, University of Missouri, Columbia, MO 65211
In practical machine learning tasks, data are often contaminated with noise, outliers, and class imbalance, which can degrade the performance of conventional models. While random vector functional link (RVFL) networks offer fast training and strong generalization, they do not explicitly handle uncertainty or exploit local data structure. To address these limitations, we propose a fuzzy granular-ball random vector functional link (GBFRVFL) framework that leverages granular-ball computing to abstract raw samples into adaptive granular balls. Within this framework, we introduce two membership assignment schemes: (i) F-GBRVFL, which incorporates fuzzy membership to quantify the reliability of each granular ball, and (ii) SDAP-GBRVFL, which we propose, incorporates a novel statistical density-adaptive pythagorean membership (SDAPM) scheme that dynamically adjusts membership and non-membership values based on class variance, local sparsity, and granular-ball compactness. These schemes enhance robustness to noise, outliers, class imbalance, and uncertainty in granular-ball distributions, while retaining the computational efficiency of RVFL networks. Extensive experiments on 37 benchmark UCI and KEEL datasets under both clean and noisy conditions demonstrate that the proposed models consistently outperform baseline models, achieving superior accuracy and stability. The results validate the effectiveness of integrating granular-ball computing with adaptive membership schemes for reliable, scalable, and noise-tolerant learning.
A. Quadir, A. Rahaman, P. N. Suganthan +1
Department of Mathematics Indian Institute of Technology Indore · Department of Computer Science and Engineering, College of Engineering Qatar University, Qatar