Researchers have developed a novel adaptive k-Nearest Neighbors (KNN) classifier using granular ball computing. This method involves a two-stage process: first, the dataset is partitioned into granular balls, with the Fisher criterion guiding ball splitting to create a multi-granularity representation. Second, during prediction, the nearest granular ball is identified, and an adaptive neighborhood is formed around the test sample. The effective 'k' value is dynamically determined by the number of samples within this neighborhood, leading to improved accuracy and efficiency compared to existing KNN variants. AI
IMPACT Introduces a more efficient and accurate method for KNN classification, potentially improving performance in various machine learning applications.
RANK_REASON The cluster contains an academic paper detailing a new algorithm and its implementation, with associated code and tools. [lever_c_demoted from research: ic=1 ai=1.0]
- alphaXiv
- arXiv
- DagsHub
- Fisher criterion
- Granular-ball computing-based manifold clustering algorithms for ultra-scalable data
- Hugging Face
- IArxiv
- k-nearest neighbors algorithm
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
