ویراساینس.
سند علمی

Diffusion Decision Making for Adaptive k-Nearest Neighbor Classification

Yung-Kyun Noh, Frank Chongwoo Park, Daniel D. Lee

چکیده

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. By applying the optimal strategy associated with the diffusion decision model, an adaptive rule is developed for determining appropriate values of k in knearest 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 effectiveness of our classification criteria.

اسناد مشابه

  • Discriminant Adaptive Nearest Neighbor Classification

    سند علمی۱۹۹۵IEEE Trans. Pattern Anal. Mach. Intell.Trevor J. Hastie, Robert Tibshirani

    Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear

  • Discriminant Adaptive Nearest Neighbor Classification and Regression

    سند علمی۱۹۹۵NIPSTrevor J. Hastie, Robert Tibshirani

    Robert Tibshirani Department of Statistics University of Toronto tibs@utstat .toronto.edu Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest nei

  • Adaptive Nearest Neighbor Classification Using Support Vector Machines

    سند علمی۲۰۰۱NIPSCarlotta Domeniconi, Dimitrios Gunopulos

    The nearest neighbor technique is a simple and appealing method to address classification problems. It relies on the assumption of locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with a finite number of examples due to the curs

  • An Adaptive Nearest Neighbor Classification Algorithm for Data Streams

    سند علمی۲۰۰۵PKDDYan-Nei Law, Carlo Zaniolo

    In this paper, we propose an incremental classification algorithm which uses a multi-resolution data representation to find adaptive nearest neighbors of a test point. The algorithm achieves excellent performance by using small classifier ensembles where approximation error bound

  • Minimax Rate Optimal Adaptive Nearest Neighbor Classification and Regression

    مقاله‌ی دسترسی آزاد۲۰۲۱IEEE Transactions on Information Theory['Puning Zhao', 'Lifeng Lai', '']

    k Nearest Neighbor (kNN) method is a simple and popular statistical for classification regression. For both regression problems, existing works have shown that, if the distribution of feature vector has bounded support probability density function away from zero in its support, c

  • Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors

    سند علمی۲۰۰۷ADBISStefanos Ougiaroglou, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Manolopoulos

    Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high accuracy in classification is given in advance and is highly dependent on the data set used. If the