526 search results - page 20 / 106 » Increments of Random Partitions |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
SIAMCOMP
1998
13 years 8 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
IWPT
2001
13 years 9 months ago
2001
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
IJCNN
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...