subspace clustering code example

Example: subspace clustering

Subspace clustering is an extension of traditional clustering that seeks to 
find clusters in different subspaces within a dataset. Often in high 
dimensional data, many dimensions are irrelevant and can mask existing 
clusters in noisy data.

Subspace clustering algorithms:
	Exact:
		- SUBCLU
		- DUSC, EDSC, INSCY, GPU-INSCY
    Statistical:
      	- P3C
    	- STATPC
    Grid based:
    	- CLIQUE
		- MAFIA, GPU-MAFIA
        - ENCLUS
    Projected:
    	- PROCLUS
        - ORCLUS
        - FINDIT