Frequent Pattern Mining Algorithms for Data Clustering - Frequent Pattern Mining - page 412

4 Conclusions

This chapter discusses the close relationship between frequent pattern mining and
clustering, which might not be apparent at first sight. In fact, frequent pattern mining
was the godfather of subspace clustering, which developed quickly into an indepen-
dent and influential research area on its own. We showed how certain techniques
that have been originally developed for frequent pattern mining have been trans-
ferred to clustering, how these techniques changed in their new environment, and
how the drawbacks of these techniques—unfortunately transferred along—raised
new research questions as well as interesting solutions in the area of data clustering.

Acknowledgments Ira Assent is partly supported by the Danish Council for Independent
Research—Technology and Production Sciences (FTP), grant 10-081972. Jilles Vreeken is sup-
ported by the Cluster of Excellence 'Multimodal Computing and Interaction' within the Excellence
Initiative of the German Federal Government.

References

1. E. Achtert, C. Böhm, H.-P. Kriegel, P. Kröger, I. Müller-Gorman, and A. Zimek. Detection and
visualization of subspace cluster hierarchies. In 12th International Conference on Database
Systems for Advanced Applications (DASFAA), Bangkok, Thailand , pages 152-163, 2007.
2. E. Achtert, C. Böhm, H.-P. Kriegel, P. Kröger, and A. Zimek. Robust, complete, and effi-
cient correlation clustering. In 7th SIAM International Conference on Data Mining (SDM),
Minneapolis, MN , pages 413-418, 2007.
3. C. C. Aggarwal, C. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast algorithms for
projected clustering. In ACM International Conference on Management of Data (SIGMOD),
Philadelphia, PA , pages 61-72, 1999.
4. C. C. Aggarwal, A. Hinneburg, and D. Keim. On the surprising behavior of distance metrics in
high dimensional space. In 8th International Conference on Database Theory (ICDT), London,
UK , pages 420-434, 2001.
5. C. C. Aggarwal, N. Ta, J. Wang, J. Feng, and M. Zaki. Xproj: a framework for projected
structural clustering of xml documents. In 13th ACM International Conference on Knowledge
Discovery and Data Mining (SIGKDD), San Jose, CA , pages 46-55, 2007.
6. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In 20th International
Conference on Very Large Data Bases (VLDB), Santiago de Chile, Chile , pages 487-499, 1994.
7. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of
high dimensional data for data mining applications. In ACM International Conference on
Management of Data (SIGMOD), Seattle, WA , pages 94-105, 1998.
8. M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify
the clustering structure. In ACM International Conference on Management of Data (SIGMOD),
Philadelphia, PA , pages 49-60, 1999.
9. I. Assent. Clustering high dimensional data. Wiley Interdisciplinary Reviews: Data Mining and
Knowledge Discovery , 2(4):340-350, 2012.
10. I. Assent, R. Krieger, E. Müller, and T. Seidl. DUSC: dimensionality unbiased subspace clus-
tering. In 7th IEEE International Conference on Data Mining (ICDM), Omaha, NE , pages
409-414, 2007.
11. I. Assent, R. Krieger, E. Müller, and T. Seidl. EDSC: efficient density-based subspace clus-
tering. In 17th ACM Conference on Information and Knowledge Management (CIKM), Napa
Valley, CA , pages 1093-1102, 2008.