An attribute based storage method for speeding up CLIQUE algorithm for subspace clustering

dc.contributor.author	Pawar, J.D.
dc.contributor.author	Rao, P.R.
dc.date.accessioned	2020-01-31T06:55:40Z
dc.date.available	2020-01-31T06:55:40Z
dc.date.issued	2006
dc.identifier.citation	Proc. of the International Database Engineering and Applications Symposium (IDEAS). 11-14 Dec 2006. 2006; 309-310.	en_US
dc.identifier.uri	http://doi.org/10.1109/IDEAS.2006.8
dc.identifier.uri	http://irgu.unigoa.ac.in/drs/handle/unigoa/5961
dc.description.abstract	The subspace clustering algorithm CLIQUE finds all subspace clusters including overlapping clusters existing in high dimensional datasets. CLIQUE consists of three main steps namely - (1) identification of subspaces that contain clusters, (2) identification of clusters and (3) generation of the minimal description for the clusters obtained in step two. In this paper, we have presented a method for speeding-up the first step of the CLIQUE algorithm. The proposed method is based on accessing the data from columns instead of rows. It is very efficient when there are many missing values in the high dimensional datasets given in the form of table. We have also proposed a depth-first method to find the maximal dense units, to further improve the performance of the first step.	en_US
dc.publisher	IEEE	en_US
dc.subject	Computer Science and Technology	en_US
dc.title	An attribute based storage method for speeding up CLIQUE algorithm for subspace clustering	en_US
dc.type	Conference article	en_US
dc.identifier.impf	cs