Abstract:K-plane clustering (KPC), hyperplane clustering, and mixture regression all essentially fall within the same class of problems. This problem can be conceptualized as clustering in relatively high-dimensional K subspaces or K linear manifolds. Traditional KPC or fuzzy KPC models demonstrate a pronounced susceptibility to outliers, as they presuppose that the projection distance between data points and the plane normal vector adheres to the L2 distance. Meanwhile, the assumption of infinitely extending clusters adversely affects clustering performance. To solve these problems, this paper proposed a new robust fuzzy local k-plane clustering (RFLkPC) method that combines the mixture distance of hinge loss and L1 norm. The RFLkPC model assumes that each plane cluster is bounded to a finite area, which can flexibly and robustly handle plane clustering tasks with outliers or not. The corresponding model and optimization algorithms of RFLkPC were provided. Compared to other related models on this topic, a large number of experiments verify the efficiency of RFLkPC on simulated data and real data. The source code for the proposed RFLkPC method is publicly available at this https URL.
| Subjects: | Machine Learning (cs.LG); Numerical Analysis (math.NA) |
| Cite as: | arXiv:2604.22405 [cs.LG] |
| (or arXiv:2604.22405v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.22405 arXiv-issued DOI via DataCite (pending registration) |
|
| Journal reference: | IEEE Transactions on Knowledge and Data Engineering, vol. 37, no. 9, pp. 5584-5597, 2025 |
| Related DOI: | https://doi.org/10.1109/TKDE.2025.3582849
DOI(s) linking to related resources |
From: Xuelin Xie [view email]
[v1]
Fri, 24 Apr 2026 09:55:32 UTC (4,644 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。