Projected memory clustering

摘要

We present a new algorithm PMC (Projected Memory Clustering) for projected clustering of high dimensional data. It effectively discovers clusters described by affine subspaces parallel to the main axes of coordinate system. The number of clusters and dimensions of subspaces are selected automatically. Experiments performed on various types of data show that PMC detects clustering structures better than related projected clustering methods. Moreover, it is fast, which makes it suitable for practical use. (C) 2019 Published by Elsevier B.V.