78 search results - page 7 / 16 » Subquadratic Approximation Algorithms for Clustering Problem... |
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
EDBT
2000
ACM
14 years 26 days ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
NIPS
2008
13 years 10 months ago
2008
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...