436 search results - page 35 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
DAWAK
2007
Springer
14 years 1 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Multimedia similarity search has been playing a critical role in many novel applications. Typically, multimedia objects are described by high-dimensional feature vectors (or point...
ICANN
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...