Laboratory of Computer and Information Science / Neural Networks Research Centre

 Dr. Hannes Heikinheimo

I'm a former PhD student of Prof. Heikki Mannila. In January 2010 I defended my doctoral thesis titled "Extending data mining techniques for frequent pattern discovery: trees, low-entorpy sets, and crossmining". The thesis deals with algorithms and applications for data mining with a special focus on frequent pattern mining, pattern selection and clustering.

Currently I'm working in the industry.

Publications

Theory and foundations of data mining

  • Hannes Heikinheimo, Jilles Vreeken, Arno Siebes and Heikki Mannila. Low-Entropy Set Selection. SIAM International Conference on Data Mining (SDM09), p. 569-580, 2009.
  • Nikolaj Tatti and Hannes Heikinheimo. Decomposable Families of Itemsets. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2008), p. 472-487, 2008
  • Gemma C. Garriga, Hannes Heikinheimo, and Jouni K. Seppanen. Cross-mining Binary and Numerical Attributes. IEEE International Conference on Data Mining (ICDM), p. 481-486, 2007.
  • Hannes Heikinheimo, Eino Hinkkanen, Heikki Mannila, Taneli Mielikainen, and Jouni K. Seppanen. Finding low-entropy sets and trees from binary data. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2007), p. 350-359.
  • Hannes Heikinheimo, Heikki Mannila, and Jouni K. Seppanen. Finding trees from unordered 0-1 data. 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), p. 175-186.

Applications of data mining

Theses

Contact information

E-mail: firstname dot lastname gmail dot com