K-GBS3FCM -- KNN Graph-Based Safe Semi-Supervised Fuzzy C-Means
Gabriel Santos, Rita Julia, Marcelo Nascimento

TL;DR
This paper presents K-GBS3FCM, a safe semi-supervised fuzzy clustering algorithm that uses KNN graphs to effectively leverage prior knowledge, improving accuracy while minimizing the impact of incorrect labels.
Contribution
It introduces a novel KNN graph-based safety mechanism for semi-supervised fuzzy clustering, enhancing label influence control and clustering accuracy.
Findings
Significantly outperformed other methods in 64% of test cases.
Effectively leveraged prior knowledge to improve clustering accuracy.
Demonstrated robustness against incorrect labels in benchmark datasets.
Abstract
Clustering data using prior domain knowledge, starting from a partially labeled set, has recently been widely investigated. Often referred to as semi-supervised clustering, this approach leverages labeled data to enhance clustering accuracy. To maximize algorithm performance, it is crucial to ensure the safety of this prior knowledge. Methods addressing this concern are termed safe semi-supervised clustering (S3C) algorithms. This paper introduces the KNN graph-based safety-aware semi-supervised fuzzy c-means algorithm (K-GBS3FCM), which dynamically assesses neighborhood relationships between labeled and unlabeled data using the K-Nearest Neighbors (KNN) algorithm. This approach aims to optimize the use of labeled data while minimizing the adverse effects of incorrect labels. Additionally, it is proposed a mechanism that adjusts the influence of labeled data on unlabeled ones through…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFuzzy Logic and Control Systems · Text and Document Classification Technologies
