KNN Classification with One-step Computation
KNN classification is an improvisational learning mode, in which they are carried out only when a test data is predicted that set a suitable K value and search the K nearest neighbors from the whole training sample space, referred them to the lazy part of KNN classification. This lazy part has been the bottleneck problem of applying KNN classification due to the complete search of K nearest neighbors. In this paper, a one-step computation is proposed to replace the lazy part of KNN classification. The one-step computation actually transforms the lazy part to a matrix computation as follows. Given a test data, training samples are first applied to fit the test data with the least squares loss function. And then, a relationship matrix is generated by weighting all training samples according to their influence on the test data. Finally, a group lasso is employed to perform sparse learning of the relationship matrix. In this way, setting K value and searching K nearest neighbors are both integrated to a unified computation. In addition, a new classification rule is proposed for improving the performance of one-step KNN classification. The proposed approach is experimentally evaluated, and demonstrated that the one-step KNN classification is efficient and promising
Code (1)
Tasks
ClassificationGeneral ClassificationSparse LearningSimilar Papers 제목 키워드 기반
Conditional Classification: A Solution for Computational Energy Reduction
Deep convolutional neural networks have shown high efficiency in computer visions and other applications. However, with the increase in the depth of the networks, the computational complexity is growing exponentially. In…
ClassificationClusteringGeneral Classificationimage-classification+1Quantifying error contributions of computational steps, algorithms and hyperparameter choices in image classification pipelines
Data science relies on pipelines that are organized in the form of interdependent computational steps. Each step consists of various candidate algorithms that maybe used for performing a particular function. Each algorit…
Bayesian OptimizationBIG-bench Machine LearningGeneral Classificationimage-classification+1Quantifying contribution and propagation of error from computational steps, algorithms and hyperparameter choices in image classification pipelines
Data science relies on pipelines that are organized in the form of interdependent computational steps. Each step consists of various candidate algorithms that maybe used for performing a particular function. Each algorit…
Bayesian OptimizationBIG-bench Machine LearningGeneral ClassificationHyperparameter Optimization+2Automated Robustness with Adversarial Training as a Post-Processing Step
Adversarial training is a computationally expensive task and hence searching for neural network architectures with robustness as the criterion can be challenging. As a step towards practical automation, this work explore…
ClassificationDeep Learningimage-classificationImage Classification+3Understanding Gradient Boosting Classifier: Training, Prediction, and the Role of $γ_j$
The Gradient Boosting Classifier (GBC) is a widely used machine learning algorithm for binary classification, which builds decision trees iteratively to minimize prediction errors. This document explains the GBC's traini…
Binary ClassificationPrediction