adaptive dimension reduction for clustering high dimensional data

From statwiki
Revision as of 20:00, 21 July 2013 by Hcheng1118 (talk | contribs) (1. Introduction)
Jump to: navigation, search

1. Introduction

Clustering methods such as the K-means and EM suffer from local minima problems. In high dimensional space, the cost function surface is very rugged and it is easy to get trapped somewhere close to the initial configurations. The conventional method is to try a number of initial values, and pick up the best one of the results.


The Paper proposes a approach to tackle this problem. The approach utilizes the idea of dimension reduction. In the paper, (i) they approach dimension reduction as a dynamic process that is adaptively adjusted and integrated with clustering process (ii) make effective use of cluster membership to connect reduced dimensional space and full dimension space.

2. Effective Dimension for Clustering

3. EM in relevant subspace

4. Adaptive Dimension Reduction for EM

5. Adaptive Dimension Reduction for K-means