Sciweavers

331 search results - page 2 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 5 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
VLDB
2000
ACM
166views Database» more  VLDB 2000»
13 years 9 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
13 years 9 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...
FSKD
2006
Springer
147views Fuzzy Logic» more  FSKD 2006»
13 years 9 months ago
Adaptive Nearest Neighbor Classifier Based on Supervised Ellipsoid Clustering
Nearest neighbor classifier is a widely-used effective method for multi-class problems. However, it suffers from the problem of the curse of dimensionality in high dimensional spac...
Guo-Jun Zhang, Ji-Xiang Du, De-Shuang Huang, Tat-M...
ICDM
2006
IEEE
139views Data Mining» more  ICDM 2006»
13 years 11 months ago
Privacy Preserving Nearest Neighbor Search
Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privac...
Mark Shaneck, Yongdae Kim, Vipin Kumar