434 search results - page 23 / 87 » Dimensionality Reduction of Clustered Data Sets |
115
click to vote
PAKDD
2005
ACM
15 years 9 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,...
114
click to vote
PR
2007
15 years 3 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...
155
click to vote
SSDBM
2006
IEEE
15 years 10 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...
129
click to vote
ECML
2005
Springer
15 years 10 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...
158
click to vote
NIPS
1998
15 years 5 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...