Search results

Search:
in the keywords: subspace clustering, projection clustering, PCA

Sort By:

Limit search:

Subspace Memory Clustering

100%

Struski Ł., Spurek P., Tabor J.

Schedae Informaticae

2015

vol. 24

We present a new subspace clustering method called SuMC (Subspace Memory Clustering), which allows to efficiently divide a dataset D RN into k 2 N pairwise disjoint clusters of possibly different dimensions. Since our approach is based on the memory compression, we do not need to explicitly specify dimensions of groups: in fact we only need to specify the mean number of scalars which is used to describe a data-point. In the case of one cluster our method reduces to a classical Karhunen-Loeve (PCA) transform. We test our method on some typical data from UCI repository and on data coming from real-life experiments.

Refine search results

1 Schedae Informaticae

1 2015

1 Spurek P.

1 Struski Ł.

1 Tabor J.

Search results

Subspace Memory Clustering