3934 search results - page 413 / 787 » A monothetic clustering method |
385
click to vote
ICDE
2012
IEEE
13 years 10 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
218
click to vote
FTML
2010
15 years 6 months ago
2010
We give a tutorial overview of several geometric methods for dimension reduction. We divide the methods into projective methods and methods that model the manifold on which the da...
157
click to vote
ALT
2008
Springer
16 years 4 months ago
2008
Springer
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
175
click to vote
MLDM
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data an...
208
click to vote
FGR
2004
IEEE
15 years 11 months ago
2004
IEEE
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...