adaptive dimension reduction for clustering high dimensional data: Difference between revisions

From statwiki
Jump to navigation Jump to search
No edit summary
Line 1: Line 1:
== 1. Introduction ==
== 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.


== 2. Effective Dimension for Clustering ==
== 2. Effective Dimension for Clustering ==

Revision as of 20:52, 21 July 2013

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.

2. Effective Dimension for Clustering

3. EM in relevant subspace

4. Adaptive Dimension Reduction for EM

5. Adaptive Dimension Reduction for K-means