Frequent Pattern Mining Algorithms for Data Clustering

Research output: Contribution to book/anthology/report/proceedingBook chapterResearchpeer-review

  • Arthur Zimek, Ludwig-Maximilians-Universität München, Germany
  • Ira Assent
  • Jilles Vreeken , Max-Planck Institute for Informatics and Saarland University, Germany
Discovering clusters in subspaces, or subspace clustering and related clustering paradigms, is a research field where we find many frequent pattern mining related influences. In fact, as the first algorithms for subspace clustering were based on frequent pattern mining algorithms, it is fair to say that frequent pattern mining was at the cradle of subspace clustering—yet, it quickly developed into an independent research field.

In this chapter, we discuss how frequent pattern mining algorithms have been extended and generalized towards the discovery of local clusters in high-dimensional data. In particular, we discuss several example algorithms for subspace clustering or projected clustering as well as point out recent research questions and open topics in this area relevant to researchers in either clustering or pattern mining
Original languageEnglish
Title of host publicationFrequent Pattern Mining
EditorsCharu C. Aggarwal, Jiawei Han
Number of pages21
PublisherSpringer
Publication year2014
Pages403-423
ISBN (print)978-3-319-07820-5
ISBN (Electronic)978-3-319-07821-2
DOIs
Publication statusPublished - 2014

See relations at Aarhus University Citationformats

ID: 84707736