Clicks: An effective algorithm for mining subspace clusters in categorical datasets

Mohammed J. Zaki, Markus Peters, Ira Assent, Thomas Seidl

Research output: Contribution to journalArticle

50 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)51-70
Number of pages20
JournalData and Knowledge Engineering
Issue number1
Publication statusPublished - 1 Jan 2007
Externally publishedYes



  • Categorical data
  • Clustering
  • k-Partite graph
  • Maximal cliques

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this