766 search results - page 38 / 154 » Clustering high dimensional data using subspace and projecte... |
ICPR
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
ESANN
2004
13 years 10 months ago
2004
Abstract. In many situations, high dimensional data can be considered as sampled functions. We show in this paper how to implement a Self-Organizing Map (SOM) on such data by appro...
NPL
1998
13 years 8 months ago
1998
Abstract. Incremental learning of sensorimotor transformations in high dimensional spaces is one of the basic prerequisites for the success of autonomous robot devices as well as b...
PAMI
2008
13 years 8 months ago
2008
We present a novel probabilistic latent variable model to perform linear dimensionality reduction on data sets which contain clusters. We prove that the maximum likelihood solution...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
This work examines under what conditions compression methodologies can retain the outcome of clustering operations. We focus on the popular k-Means clustering algorithm and we dem...