434 search results - page 23 / 87 » Dimensionality Reduction of Clustered Data Sets |
PAKDD
2005
ACM
14 years 2 months ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
PR
2007
13 years 8 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
SSDBM
2006
IEEE
14 years 2 months ago
2006
IEEE
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
ECML
2005
Springer
14 years 2 months ago
2005
Springer
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
NIPS
1998
13 years 10 months ago
1998
The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, docu...