Sciweavers

649 search results - page 1 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
CSSC
2010
91views more  CSSC 2010»
13 years 3 months ago
Some Methods of Replacing the Nearest Neighbor Method
Tomasz Górecki, Maciej Luczak
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
13 years 8 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
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 ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
ICPR
2006
IEEE
14 years 6 months ago
The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method
In this paper, we propose a new data reduction algorithm that iteratively selects some samples and ignores others that can be absorbed, or represented, by those selected. This alg...
Bo-Han Kuo, Chien-Hsing Chou, Fu Chang
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 5 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
SSPR
2000
Springer
13 years 8 months ago
Some Notes on Twenty One (21) Nearest Prototype Classifiers
Comparisons made in two studies of 21 methods for finding prototypes upon which to base the nearest prototype classifier are discussed. The criteria used to compare the methods are...
James C. Bezdek, Ludmila Kuncheva