parallel subspace clustering

subspace clustering is an extension of traditional clustering that discovers clusters respected to the different subspaces within a data-set the time complexity of the algorithms to explore the high dimnsional spaces and find clusters in subspaces is exponential in the dimensionality o fthe data and is thus extremely computationally intensive . there for employing parallel algorithm for this problem can reduce its time complexity in this paper we propose and architecture for parallel implomentation of the locally adaptive clustering algorthm.

کلیدواژه ها:

parallel algorithms ، data clustering ، PRAMmodel