Sparse $\ell_1$ and $\ell_2$ Center Classifiers
원문 초록
The nearest-centroid classifier is a simple linear-time classifier based on computing the centroids of the data classes in the training phase, and then assigning a new datum to the class corresponding to its nearest centroid. Thanks to its very low computational cost, the nearest-centroid classifier is still widely used in machine learning, despite the development of many other more sophisticated classification methods. In this paper, we propose two sparse variants of the nearest-centroid classifier, based respectively on $\ell_1$ and $\ell_2$ distance criteria. The proposed sparse classifiers perform simultaneous classification and feature selection, by detecting the features that are most relevant for the classification purpose. We show that training of the proposed sparse models, with both distance criteria, can be performed exactly (i.e., the globally optimal set of features is selected) and at a quasi-linear computational cost. The experimental results show that the proposed methods are competitive in accuracy with state-of-the-art feature selection techniques, while having a significantly lower computational cost.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLSF - Learning Label Specific Features for Multi-Label Classifcation
ExploreKit: Automatic Feature Generation and Selection
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.