Sciweavers

Share
ICDE
2005
IEEE

CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques

8 years 11 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subspace clusters. It uses a selective vertical method to guarantee complete search. CLICKS outperforms previous approaches by over an order of magnitude and scales better than any of the existing method for high-dimensional datasets. We demonstrate this improvement in an excerpt from our comprehensive performance studies.
Mohammed Javeed Zaki, Markus Peters
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where ICDE
Authors Mohammed Javeed Zaki, Markus Peters
Comments (0)
books