Classification with Nearest Disjoint Centroids
원문 초록
In this paper, we develop a new classification method based on nearest centroid, and it is called the nearest disjoint centroid classifier. Our method differs from the nearest centroid classifier in the following two aspects: (1) the centroids are defined based on disjoint subsets of features instead of all the features, and (2) the distance is induced by the dimensionality-normalized norm instead of the Euclidean norm. We provide a few theoretical results regarding our method. In addition, we propose a simple algorithm based on adapted k-means clustering that can find the disjoint subsets of features used in our method, and extend the algorithm to perform feature selection. We evaluate and compare the performance of our method to other classification methods on both simulated data and real-world gene expression datasets. The results demonstrate that our method is able to outperform other competing classifiers by having smaller misclassification rates and/or using fewer features in various settings and situations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Margin-aware Fuzzy Rough Feature Selection: Bridging Uncertainty Characterization and Pattern Classification
An Interpretable Adaptive Multiscale Attention Deep Neural Network for Tabular Data
Bio-Inspired Feature Selection in Brain Disease Detection via an Improved Sparrow Search Algorithm
Feature Selection With Maximal Relevance and Minimal Supervised Redundancy
LLSF - Learning Label Specific Features for Multi-Label Classifcation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.