A k-nearest-neighbor classifier is approximated by a labeled cell classifier that recursively labels the nodes of a hierarchically organized reference sample (e.g., a k-d tree) if a local estimate of the conditional Bayes risk is sufficiently small. Simulations suggest that the labeled cell classifier is significantly faster than k-d tree implementations for problems with small Bayes risk; and ...

A tracking-by-detection framework is proposed that combines nearest-neighbor classification of bags of features, efficient subwindow search, and a novel feature selection and pruning method to achieve stability and plasticity in tracking targets of changing appearance. Experiments show that near-frame-rate performance is achieved (sans feature detection), and that the state of the art is improv...

High feature dimensionality of realistic datasets adversely affects the recognition accuracy of nearest neighbor (NN) classifiers. To address this issue, we introduce a nearest feature classifier that shifts the NN concept from the global-decision level to the level of individual features. Performance comparisons with 12 instance-based classifiers on 13 benchmark University of California Irvine...

Clustering of objects is an important area of research and application in variety of fields. In this paper we present a good technique for data clustering and application of this Technique for data clustering in a closed area. We compare this method with K-nearest neighbor and K-means.  

Stability has been of a great concern in statistics: similar statistical conclusions should be drawn based on different data sampled from the same population. In this article, we introduce a general measure of classification instability (CIS) to capture the sampling variability of the predictions made by a classification procedure. The minimax rate of CIS is established for general plug-in clas...

The main purpose of this paper is to use off-the-shelf devices to develop a fall detection system. In human body identification, human body silhouette is adopted to improve privacy protection, and vertical projection histograms of the silhouette image and statistical scheme are used to reduce the effect of human body upper limb activities. The kNN classification algorithm is used to classify th...

In this paper, an improved method based on nearest feature plane (NFP), called as representation-based nearest feature plane (RNFP), is proposed for biometric recognition. Borrowing the concept from the nearest neighbor plane (NNP) classifier and center-based nearest neighbor (CNN) classifier, RNFP chooses the valuable representation of the class to reduce the computational complexity of NFP. A...

Random KNN (RKNN) is a novel generalization of traditional nearest-neighbor modeling. Random KNN consists of an ensemble of base k-nearest neighbor models, each constructed from a random subset of the input variables. A collection of r such base classifiers is combined to build the final Random KNN classifier. Since the base classifiers can be computed independently of one another, the overall ...