The k-nearest-neighbor rule is a well known pattern recognition technique with very good results in a great variety of real classification tasks. Based on the neighborhood concept, several classification rules have been proposed to reduce the error rate of the k-nearest-neighbor rule (or its time requirements). In this work, two new geometrical neighborhoods are defined and the classification r...

This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensional metric space is not efficient, while search in a high-dimensional Euclidean space suffers from the “curse of dimensionality”. Thus, techniques designed for searching metric spaces must be used. We evaluate several su...

In this paper, we develop a novel Distance-weighted k -nearest Neighbor rule (DWKNN), using the dual distance-weighted function. The proposed DWKNN is motivated by the sensitivity problem of the selection of the neighborhood size k that exists in k -nearest Neighbor rule (KNN), with the aim of improving classification performance. The experiment results on twelve real data sets demonstrate that...

Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sample points such that clusters are “identified”: that is, the subgraph induced by points from the same cluster is connected, while subgraphs corresponding to different clusters are not connected to each other. We derive bounds ...

We focus on the recently introduced nearest neighbor based entropy estimator from Kraskov, Stögbauer and Grassberger (KSG) [10], the nearest neighbor search of which is performed by the so called box assisted algorithm [7]. We compare the performance of KSG with respect to three spatial indexing methods: box-assisted, k-D trie and projection method, on a problem of mutual information estimation...

The spatio-temporal (ST) position information between local features plays an important role in action recognition task. To use the information, neighborhood-based features are built for describing local ST information around ST interest points. However, traditional methods of constructing neighborhood, such as sub-ST volumetric method and nearest-neighbor-based neighborhood method, ignore the ...

Neighborhood crime may be an important social determinant of health in many high-poverty, urban communities, yet little is known about its relationship with access to health-enabling resources. We recruited an address-based probability sample of 267 participants (ages ≥35 years) on Chicago's South Side between 2012 and 2013. Participants were queried about their perceptions of neighborhood safe...

This paper describes experiments carried out using a variety of machine-learning methods, including the k-nearest neighborhood method that was used in a previous study, for the translation of tense, aspect, and modality. It was found that the support-vector machine method was the most precise of all the methods tested.

A patchy model for the spatial spread of West Nile virus is formulated and analyzed. The basic reproduction number is calculated and com- pared for different long-range dispersal patterns of birds, and simulations are carried out to demonstrate discontinuous or jump spatial spread of the virus when the birds' long-range dispersal dominates the nearest neighborhood interaction and diffusion of m...

This paper is concerned with nearest neighbor search in distributional semantic models. A normal nearest neighbor search only returns a ranked list of neighbors, with no information about the structure or topology of the local neighborhood. This is a potentially serious shortcoming of the mode of querying a distributional semantic model, since a ranked list of neighbors may conflate several dif...