Pauli Miettinen


	Docent, Senior Researcher, PhD
	Max-Planck-Institut für Informatik Campus E1 4 D-66123 Saarbrücken GERMANY
	Phone: +49 681 9325 5012
	Max Planck homepage

Current News

I have moved to Max Planck Institute for Informatics, in Saarbrücken, Germany. I recommend using my e-mail from Max Planck Institute (available via my MPI homepage).

Teaching

Tieteellisen kirjoittamisen kurssi (Scientific Writing, in Finnish), autumn 2009
Satunnaisalgoritmit (Randomized Algorithms, in Finnish), spring 2009
Tieteellisen kirjoittamisen kurssi (Scientific Writing, in Finnish), spring 2007
Opettajatuutorointi (Tutoring, in Finnish), autumn 2006—
Tietorakenteiden harjoitustyö (Data Structures Project, in Finnish), autumn 2005
Tietorakenteiden harjoitustyö (Data Structures Project, in Finnish), spring 2005

Publications

Saskia Metzler Pauli Miettinen Clustering Boolean Tensors. ECML/PKDD 2014 PhD Session, 2014.
[pdf]
Pauli Miettinen Interactive Data Mining Considered Harmful (If Done Wrong). Proc. KDD 2014 Workshop on Interactive Data Exploration and Analytics (IDEA), 2014, 85–87.
[pdf]
Pauli Miettinen Jilles Vreeken MDL4BMF: Minimum Description Length for Boolean Matrix Factorization. ACM Transactions on Knowledge Discovery from Data, 2014
[tech. rep. | preliminary version | source code | manuscript]
Esther Galbrun Pauli Miettinen Interactive Redescription Mining. Proc. 2014 ACM SIGMOD/PODS Conference. 2014, 1079–1082.
10.1145/2588555.2594520
[pdf (ACM) | pdf | more information]
Dóra Erdős Pauli Miettinen Walk'n'Merge: A Scalable Algorithm for Boolean Tensor Factorization. Proc. 13^th IEEE International Conference on Data Mining (ICDM'13), 2013, 1037–1042.
10.1109/ICDM.2013.141
[pdf (IEEE) | manuscript | tech. rep. | source code]
Dóra Erdős Pauli Miettinen Discovering Facts with Boolean Tensor Tucker Decomposition. Proc. 2013 ACM International Conference on Infortmation and Knowledge Management (CIKM '13), 2013, 1596–1572.
10.1145/2505515.2507846
[pdf (ACM) | manuscript | data]
Ervina Cergani Pauli Miettinen Discovering Relations using Matrix Factorization Methods. Proc. 2013 ACM International Conference on Information and Knowledge Management (CIKM '13), 2013, 1549–1552.
10.1145/2505515.2507841
[pdf (ACM) | manuscript]
Jan Ramon Pauli Miettinen Jilles Vreeken Detecting Bicliques in GF[q]. Proc. 2013 European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD '13), 2013, 509–524.
[pdf (Springer) | manuscript]
Pauli Miettinen Fully Dynamic Quasi-Biclique Edge Covers via Boolean Matrix Factorizations. Proc. 1^st ACM SIGMOD Workshop on Dynamic Networks Management and Mining (DyNetMM '13), 2013.
[manuscript]
Fabrizio Grandoni Anupam Gupta Stefano Leonardi Pauli Miettinen Piotr Sankowski Mohit Singh Set Covering with Our Eyes Closed. SIAM Journal on Computing, 42(3), 2013, 808–830.
10.1137/100802888
[pdf (SIAM) | manuscript | preliminary version]
Pauli Miettinen Dynamic Boolean Matrix Factorizations. Proc. 12^th IEEE International Conference on Data Mining (ICDM'12), 2012, 519–528.
10.1109/ICDM.2012.118
[manuscript | source code | slides]
Esther Galbrun Pauli Miettinen A Case of Visual and Interactive Data Analysis: Geospatial Redescription Mining. ECML PKDD '12 Workshop on Instant Interactive Data Mining (IID '12), 2012
[manuscript | Workshop]
Esther Galbrun Pauli Miettinen Siren: An Interative Tool for Mining and Visualizing Geospatial Redescriptions—Demo. Proc. 18^th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD-2012), 2012, 1544–1547.
10.1145/2339530.2339776
[pdf (ACM) | manuscript | more information]
Esther Galbrun Pauli Miettinen From Black and White to Full Colour: Extending Redescription Mining Outside the Boolean World. Statistical Analysis and Data Mining 5(4), 2012, 284–303.
10.1002/sam.11145
[pdf (Wiley) | manuscript | preliminary version | source code]
Pauli Miettinen On Finding Joint Subspace Boolean Matrix Factorizations. Proc. 2012 SIAM International Conference on Data Mining (SDM2012), 2012, 954–965.
[pdf (SIAM) | manuscript]
Pauli Miettinen Boolean Tensor Factorizations. Proc. 11^th IEEE International Conference on Data Mining (ICDM2011), 2011, 447–456.
10.1109/ICDM.2011.28
[pdf (IEEE) | manuscript | slides]
Pauli Miettinen Jilles Vreeken Model Order Selection for Boolean Matrix Factorization. Proc. 17^th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD-2011), 2011, 51–59.
10.1145/2020408.2020424
[pdf (ACM) | manuscript | slides | source code | tech. rep.]
Esther Galbrun Pauli Miettinen From Black and White to Full Colour: Extending Redescription Mining Outside the Boolean World. Proc. 2011 SIAM International Conference on Data Mining (SDM2011), 2011, 546–557.
[journal version | pdf (SIAM) | manuscript | source code]
Pauli Miettinen Sparse Boolean Matrix Factorizations. Proc. 10^th IEEE International Conference on Data Mining (ICDM2010), 2010, 935–940.
10.1109/ICDM.2010.93.
[pdf (IEEE) | slides]
Fabrizio Grandoni Anupam Gupta Stefano Leonardi Pauli Miettinen Piotr Sankowski Mohit Singh Set Covering with Our Eyes Closed. Proc. 49^th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2008, 347–356.
[pdf (IEEE)]
Pauli Miettinen The Boolean Column and Column-Row Matrix Decompositions. Data Mining and Knowledge Discovery 17(1), 2008, 39–56. (Best Knowledge Discovery Student Paper.)
10.1007/s10618-008-0107-0.
[pdf (Springer) | presentation (Videolectures.net) | slides]
Proc. European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD), Part I, Lecture Notes in Artificial Intelligence 5211, Springer 2008, 17.
10.1007/978-3-540-87479-9_15.
[pdf (Springer)]
Saara Hyvönen Pauli Miettinen Evimaria Terzi Interpretable Nonnegative Matrix Decompositions. Proc. 14^th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD), 2008, 345–353.
10.1145/1401890.1401935.
[pdf (ACM) | slides]
Pauli Miettinen On the Positive–Negative Set Cover Problem. Information Processing Letters 108(4), 2008, 219–221.
10.1016/j.ipl.2008.05.007.
[manuscript | pdf (Elsevier)]
Pauli Miettinen Taneli Mielikäinen Aristides Gionis Gautam Das Heikki Mannila The Discrete Basis Problem. IEEE Transactions on Knowledge and Data Engineering 20(10), October 2008, 1348–1362.
10.1109/TKDE.2008.53.
[preliminary version | pdf (IEEE) | source code]
Arianna Gallo Pauli Miettinen Heikki Mannila Finding Subgroups having Several Descriptions: Algorithms for Redescription Mining. Proc. SIAM International Conference on Data Mining (SDM), 2008, 334–345.
[pdf (SIAM)]
Pauli Miettinen Taneli Mielikäinen Aristides Gionis Gautam Das Heikki Mannila The Discrete Basis Problem. Knowledge discovery in databases: PKDD 2006 – 10th European conference on principles and practice of knowledge discovery in databases, Berlin, Germany, September 2006, Lecture Notes in Artificial Intelligence, 4213, Springer 2006, 335–346. (PKDD Best Paper)
[journal version | manuscript | source code]

Theses

Pauli Miettinen Matrix Decomposition Methods for Data Mining: Computational Complexity and Algorithms. Publications of Department of Computer Science, A-2009-4, Department of Computer Science, University of Helsinki 2009 (Ph.D. thesis, monograph).
Certificate of Recognition, ACM SIGKDD Doctoral Dissertation Award, 2010.
[pdf]
Pauli Miettinen The Discrete Basis Problem. Report C-2006-010, Department of Computer Science, University of Helsinki 2006 (M.Sc. thesis).
[pdf | source code]

Other writings

Pauli Miettinen Jilles Vreeken MDL4BMF: Minimum Description Length for Boolean Matrix Factorization. Research Report MPI-I-2012-5-001, Max-Planck-Institut für Informatik 2012.
[pdf | source code]
Pauli Miettinen A review of Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics by Dan A. Simovici and Chabane Djeraba. SIGACT News 42(2), 2011, 43–46.
[pdf]

Other academic activities

I have worked as a reviewer for the following conferences:

I have been a member of the programme committee of the following conferences:

I have reviewed papers for the following journals:

I visited "Sapienza" University of Rome, Italy, in professor Stefano Leonardi's group between 13 December 2007 and 31 March 2008.

Last modified 3 Jun 2013

Department of Computer Science

Department information