Sciweavers

53 search results - page 3 / 11
» Discriminant Projections Embedding for Nearest Neighbor Clas...
Sort
View
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 6 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
IDA
2005
Springer
13 years 11 months ago
Condensed Nearest Neighbor Data Domain Description
—A simple yet effective unsupervised classification rule to discriminate between normal and abnormal data is based on accepting test objects whose nearest neighbors’ distances ...
Fabrizio Angiulli
SADM
2010
196views more  SADM 2010»
13 years 25 days ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
NN
2008
Springer
201views Neural Networks» more  NN 2008»
13 years 6 months ago
Learning representations for object classification using multi-stage optimal component analysis
Learning data representations is a fundamental challenge in modeling neural processes and plays an important role in applications such as object recognition. In multi-stage Optima...
Yiming Wu, Xiuwen Liu, Washington Mio
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
13 years 7 months ago
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
Erion Plaku, Lydia E. Kavraki