Sciweavers

730 search results - page 31 / 146
» Faster dimension reduction
Sort
View
HIS
2001
13 years 10 months ago
Linear Discriminant Text Classification in High Dimension
Abstract. Linear Discriminant (LD) techniques are typically used in pattern recognition tasks when there are many (n >> 104 ) datapoints in low-dimensional (d < 102 ) spac...
András Kornai, J. Michael Richards
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 10 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
ICML
2004
IEEE
14 years 9 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
IFIP
2004
Springer
14 years 2 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel
COLING
2008
13 years 10 months ago
Using Three Way Data for Word Sense Discrimination
In this paper, an extension of a dimensionality reduction algorithm called NONNEGATIVE MATRIX FACTORIZATION is presented that combines both `bag of words' data and syntactic ...
Tim Van de Cruys