We present a new subspace clustering method called SuMC (Subspace Memory Clustering), which allows to efficiently divide a dataset D c 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.
słowa kluczowe w j. angielskim:
subspace clustering, PCA, projection clustering
wydział: instytut / zakład / katedra:
Wydział Matematyki i Informatyki : Instytut Informatyki i Matematyki Komputerowej, Wydział Matematyki i Informatyki : Instytut Matematyki