Sciweavers

649 search results - page 33 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
SIAMSC
2008
168views more  SIAMSC 2008»
13 years 9 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
CSB
2004
IEEE
136views Bioinformatics» more  CSB 2004»
14 years 22 days ago
Minimum Entropy Clustering and Applications to Gene Expression Analysis
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...
Haifeng Li, Keshu Zhang, Tao Jiang
PR
2006
80views more  PR 2006»
13 years 9 months ago
Neighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
CSDA
2007
99views more  CSDA 2007»
13 years 9 months ago
CLUES: A non-parametric clustering method based on local shrinking
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
Xiaogang Wang, Weiliang Qiu, Ruben H. Zamar