CLICKS: an effective algorithm for mining subspace clusters in categorical datasets

Mohammed Javeed Zaki, Markus Peters, Ira Assent, Thomas Seidl

Abstract

We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for k-partite 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. These results are demonstrated in a comprehensive performance study on real and synthetic datasets.
BibTeX
@inproceedings{zaki2005clicks,
  author = {Mohammed Javeed Zaki and Markus Peters and Ira Assent and Thomas Seidl},
  title = {{CLICKS: an effective algorithm for mining subspace clusters in categorical datasets}},
  booktitle = {ACM SIGKDD Conference on Knowledge Discovery and Data Mining},
  year = {2005},
  doi = {10.1145/1081870.1081965},
}

Loading related content...

Figure