Pauli Miettinen

Orcid: 0000-0003-2271-316X

Affiliations:
  • University of Eastern Finland, Kuopio, Finland
  • Max Planck Institute for Informatics, Saarbücken, Germany


According to our database1, Pauli Miettinen authored at least 53 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast Redescription Mining Using Locality-Sensitive Hashing.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2024

2023
Differentially private tree-based redescription mining.
Data Min. Knowl. Discov., 2023

Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

2022
Finding Rule-Interpretable Non-Negative Data Representation.
CoRR, 2022

Serenade: An Approach for Differentially Private Greedy Redescription Mining.
Proceedings of the 20th anniversary Workshop on Knowledge Discovery in Inductive Databases co-located with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases 2022 (ECMLPKDD 2022), 2022

2020
Biclustering and Boolean Matrix Factorization in Data Streams.
Proc. VLDB Endow., 2020

Recent Developments in Boolean Matrix Factorization.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Hybrid ASP-based Approach to Pattern Mining.
Theory Pract. Log. Program., 2019

Stability and dynamics of communities on online question-answer sites.
Soc. Networks, 2019

Algorithms for approximate subtropical matrix factorization.
Data Min. Knowl. Discov., 2019

HyGen: generating random graphs with hyperbolic communities.
Appl. Netw. Sci., 2019

Boolean matrix factorization meets consecutive ones property.
Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

2018
Mining Redescriptions with Siren.
ACM Trans. Knowl. Discov. Data, 2018

From sets of good redescriptions to good sets of redescriptions.
Knowl. Inf. Syst., 2018

Latitude: A Model for Mixed Linear-Tropical Matrix Factorization.
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

Random Graph Generators for Hyperbolic Community Structures.
Proceedings of the Complex Networks and Their Applications VII, 2018

2017
Redescription Mining
Springer Briefs in Computer Science, Springer, ISBN: 978-3-319-72888-9, 2017

Redescription Mining: An Overview.
IEEE Intell. Informatics Bull., 2017

Reductions for Frequency-Based Data Mining Problems.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016
Capricorn: An Algorithm for Subtropical Matrix Factorization.
Proceedings of the 2016 SIAM International Conference on Data Mining, 2016

Cancer: Another Algorithm for Subtropical Matrix Factorization.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

Hyperbolae are No Hyperbole: Modelling Communities That are Not Cliques.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Analysing Political Opinions Using Redescription Mining.
Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
Clustering Boolean tensors.
Data Min. Knowl. Discov., 2015

On Defining SPARQL with Boolean Tensor Algebra.
CoRR, 2015

Join Size Estimation on Boolean Tensors of RDF Data.
Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Getting to Know the Unknown Unknowns: Destructive-Noise Resistant Boolean Matrix Factorization.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

Generalized Matrix Factorizations as a Unifying Framework for Pattern Set Mining: Complexity Beyond Blocks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2015

Mining Predictive Redescriptions with Trees.
Proceedings of the IEEE International Conference on Data Mining Workshop, 2015

2014
MDL4BMF: Minimum Description Length for Boolean Matrix Factorization.
ACM Trans. Knowl. Discov. Data, 2014

Interactive redescription mining.
Proceedings of the International Conference on Management of Data, 2014

2013
Set Covering with Our Eyes Closed.
SIAM J. Comput., 2013

Scalable Boolean Tensor Factorizations using Random Walks.
CoRR, 2013

Fully dynamic quasi-biclique edge covers via Boolean matrix factorizations.
Proceedings of the Workshop on Dynamic Networks Management and Mining, 2013

Detecting Bicliques in GF[q].
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Walk 'n' Merge: A Scalable Algorithm for Boolean Tensor Factorization.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

Discovering facts with boolean tensor tucker decomposition.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Discovering relations using matrix factorization methods.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
From black and white to full color: extending redescription mining outside the Boolean world.
Stat. Anal. Data Min., 2012

On Finding Joint Subspace Boolean Matrix Factorizations.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Siren: an interactive tool for mining and visualizing geospatial redescriptions.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Dynamic Boolean Matrix Factorizations.
Proceedings of the 12th IEEE International Conference on Data Mining, 2012

2011
Review of Mathematical tools for data mining: set theory, partial orders, combinatorics by Dan A. Simovici and Chabane Djeraba.
SIGACT News, 2011

From Black and White to Full Colour: Extending Redescription Mining Outside the Boolean World.
Proceedings of the Eleventh SIAM International Conference on Data Mining, 2011

Model order selection for boolean matrix factorization.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Boolean Tensor Factorizations.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010
Sparse Boolean Matrix Factorizations.
Proceedings of the ICDM 2010, 2010

2008
The Discrete Basis Problem.
IEEE Trans. Knowl. Data Eng., 2008

On the Positive-Negative Partial Set Cover problem.
Inf. Process. Lett., 2008

The Boolean column and column-row matrix decompositions.
Data Min. Knowl. Discov., 2008

Finding Subgroups having Several Descriptions: Algorithms for Redescription Mining.
Proceedings of the SIAM International Conference on Data Mining, 2008

Interpretable nonnegative matrix decompositions.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008


  Loading...