Results 251 to 260 of about 9,360,077 (298)
Some of the next articles are maybe not open access.

Weighting of the k-Nearest-Neighbors

2010 20th International Conference on Pattern Recognition, 2010
This paper presents two distribution independent weighting schemes for k-Nearest-Neighbors (kNN). Applying the first scheme in a Leave-One-Out (LOO) setting corresponds to performing complete b-fold cross validation (b-CCV), while applying the second scheme corresponds to performing bootstrapping in the limit of infinite iterations. We demonstrate that
Chernoff, Konstantin, Nielsen, Mads
openaire   +3 more sources

K-Nearest Neighbors Hashing

2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2019
Hashing based approximate nearest neighbor search embeds high dimensional data to compact binary codes, which enables efficient similarity search and storage. However, the non-isometry sign() function makes it hard to project the nearest neighbors in continuous data space into the closest codewords in discrete Hamming space.
Xiangyu He   +2 more
openaire   +2 more sources

Improved k-nearest neighbor classification

Pattern Recognition, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yingquan Wu   +2 more
openaire   +3 more sources

Performance Analysis of Nearest Neighbor, K-Nearest Neighbor and Weighted K-Nearest Neighbor for the Classification of Alzheimer Disease

2020
Alzheimer’s disease (AD) has become a major health problem over the past few decades. AD can be defined as a neurodegenerative disorder that causes the brain cells to degenerate and die. AD is the most popular cause of dementia. AD is likely to be more observant in elderly people that are people above 65 years of age.
Olimpia Borgohain   +3 more
openaire   +1 more source

K-Nearest Neighbor Finding Using MaxNearestDist

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth- first or a best-first algorithm to the search hierarchy containing the data. These algorithms are generally applicable to any index based on hierarchical clustering.
Hanan Samet, H Samet
exaly   +3 more sources

K-Nearest Neighbors

2020
Please download the sample Excel files from https://github.com/hhohho/Learn-Data-Mining-through-Excel for this chapter’s exercises.
openaire   +1 more source

A fuzzy K-nearest neighbor algorithm

IEEE Transactions on Systems, Man, and Cybernetics, 1985
Classification of objects is an important area of research and application in a variety of fields. In the presence of full knowledge of the underlying probabilities, Bayes decision theory gives optimal error rates. In those cases where this information is not present, many algorithms make use of distance or similarity among samples as a means of ...
James M. Keller   +2 more
openaire   +1 more source

On reverse-k-nearest-neighbor joins

GeoInformatica, 2014
A reverse k-nearest neighbour (RkNN) query determines the objects from a database that have the query as one of their k-nearest neighbors. Processing such a query has received plenty of attention in research. However, the effect of running multiple RkNN queries at once (join) or within a short time interval (bulk/group query) has only received little ...
Tobias Emrich   +5 more
openaire   +2 more sources

Multiple k nearest neighbor search

World Wide Web, 2016
The problem of kNN (k Nearest Neighbor) queries has received considerable attention in the database and information retrieval communities. Given a dataset D and a kNN query q, the k nearest neighbor algorithm finds the closest k data points to q. The applications of kNN queries are board, not only in spatio-temporal databases but also in many areas ...
Yu-Chi Chung   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy