Diffusion Decision Making for Adaptive k-Nearest Neighbor Classification
This paper sheds light on some fundamental connections of the diffusion decision making model of neuroscience and cognitive psychology with k-nearest neighbor classification. We show that conventional k-nearest neighbor classification can be viewed as a special problem of the diffusion decision model in the asymptotic situation. Applying the optimal strategy associated with the diffusion decision model, an adaptive rule is developed for determining appropriate values of k in k-nearest neighbor classification. Making use of the sequential probability ratio test (SPRT) and Bayesian analysis, we propose five different criteria for adaptively acquiring nearest neighbors. Experiments with both synthetic and real datasets demonstrate the effectivness of our classification criteria.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationDecision MakingGeneral ClassificationSimilar Papers 제목 키워드 기반
A new hashing based nearest neighbors selection technique for big datasets
KNN has the reputation to be the word simplest but efficient supervised learning algorithm used for either classification or regression. KNN prediction efficiency highly depends on the size of its training data but when …
Decision MakingSynthetic sampling from small datasets: A modified mega-trend diffusion approach using k-nearest neighbors
Data generation techniques are one of the emerging trends in machine learning in the last decade. Despite huge data availability, small datasets are still an issue to tackle for decision-making purposes. Synthetic data g…
Decision MakingregressionSynthetic Data GenerationBatched Nonparametric Bandits via k-Nearest Neighbor UCB
We study sequential decision-making in batched nonparametric contextual bandits, where actions are selected over a finite horizon divided into a small number of batches. Motivated by constraints in domains such as medici…
Decision MakingMarketingMulti-Armed BanditsSequential Decision MakingAdaptive $k$-nearest neighbor classifier based on the local estimation of the shape operator
The $k$-nearest neighbor ($k$-NN) algorithm is one of the most popular methods for nonparametric classification. However, a relevant limitation concerns the definition of the number of neighbors $k$. This parameter exert…
Meta-Neighborhoods
Making an adaptive prediction based on one's input is an important ability for general artificial intelligence. In this work, we step forward in this direction and propose a semi-parametric method, Meta-Neighborhoods, wh…
Meta-LearningMulti-Task Learning