default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPauli Miettinen
Person information
- affiliation: University of Eastern Finland, Kuopio, Finland
- affiliation: Max Planck Institute for Informatics, Saarbücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c37]Maiju Karjalainen
, Esther Galbrun, Pauli Miettinen:
Fast Redescription Mining Using Locality-Sensitive Hashing. ECML/PKDD (7) 2024: 124-142- [i16]Maiju Karjalainen, Esther Galbrun, Pauli Miettinen:
Fast Redescription Mining Using Locality-Sensitive Hashing. CoRR abs/2406.04148 (2024) - 2023
- [j17]Matej Mihelcic, Pauli Miettinen:
Differentially private tree-based redescription mining. Data Min. Knowl. Discov. 37(4): 1548-1590 (2023) - [c36]Thibault Marette, Pauli Miettinen, Stefan Neumann:
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations. ECML/PKDD (1) 2023: 743-758 - [i15]Thibault Marette, Pauli Miettinen, Stefan Neumann:
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations. CoRR abs/2307.07396 (2023) - 2022
- [c35]Maiju Karjalainen, Esther Galbrun, Pauli Miettinen:
Serenade: An Approach for Differentially Private Greedy Redescription Mining. KDID 2022: 31-46 - [i14]Matej Mihelcic, Pauli Miettinen:
Finding Rule-Interpretable Non-Negative Data Representation. CoRR abs/2206.01483 (2022) - [i13]Matej Mihelcic, Pauli Miettinen:
Differentially Private Tree-Based Redescription Mining. CoRR abs/2212.06630 (2022) - 2021
- [e2]James Bailey, Pauli Miettinen, Yun Sing Koh, Dacheng Tao, Xindong Wu:
IEEE International Conference on Data Mining, ICDM 2021, Auckland, New Zealand, December 7-10, 2021. IEEE 2021, ISBN 978-1-6654-2398-4 [contents] - 2020
- [j16]Stefan Neumann, Pauli Miettinen:
Biclustering and Boolean Matrix Factorization in Data Streams. Proc. VLDB Endow. 13(10): 1709-1722 (2020) - [c34]Pauli Miettinen, Stefan Neumann:
Recent Developments in Boolean Matrix Factorization. IJCAI 2020: 4922-4928 - [i12]Pauli Miettinen, Stefan Neumann:
Recent Developments in Boolean Matrix Factorization. CoRR abs/2012.03127 (2020) - [i11]Stefan Neumann, Pauli Miettinen:
Biclustering and Boolean Matrix Factorization in Data Streams. CoRR abs/2012.03138 (2020)
2010 – 2019
- 2019
- [j15]Saskia Metzler, Pauli Miettinen:
HyGen: generating random graphs with hyperbolic communities. Appl. Netw. Sci. 4(1): 53:1-53:25 (2019) - [j14]Sanjar Karaev, Pauli Miettinen:
Algorithms for approximate subtropical matrix factorization. Data Min. Knowl. Discov. 33(2): 526-576 (2019) - [j13]Saskia Metzler, Stephan Günnemann, Pauli Miettinen:
Stability and dynamics of communities on online question-answer sites. Soc. Networks 58: 50-58 (2019) - [j12]Sergey Paramonov, Daria Stepanova, Pauli Miettinen:
Hybrid ASP-based Approach to Pattern Mining. Theory Pract. Log. Program. 19(4): 505-535 (2019) - [c33]Nikolaj Tatti, Pauli Miettinen:
Boolean matrix factorization meets consecutive ones property. SDM 2019: 729-737 - [i10]Nikolaj Tatti, Pauli Miettinen:
Boolean matrix factorization meets consecutive ones property. CoRR abs/1901.05797 (2019) - 2018
- [j11]Janis Kalofolias, Esther Galbrun, Pauli Miettinen:
From sets of good redescriptions to good sets of redescriptions. Knowl. Inf. Syst. 57(1): 21-54 (2018) - [j10]Esther Galbrun, Pauli Miettinen:
Mining Redescriptions with Siren. ACM Trans. Knowl. Discov. Data 12(1): 6:1-6:30 (2018) - [c32]Saskia Metzler, Pauli Miettinen:
Random Graph Generators for Hyperbolic Community Structures. COMPLEX NETWORKS (1) 2018: 680-693 - [c31]Sanjar Karaev, James L. Hook, Pauli Miettinen:
Latitude: A Model for Mixed Linear-Tropical Matrix Factorization. SDM 2018: 360-368 - [i9]Sanjar Karaev, James L. Hook, Pauli Miettinen:
Latitude: A Model for Mixed Linear-Tropical Matrix Factorization. CoRR abs/1801.06136 (2018) - [i8]Sergey Paramonov, Daria Stepanova, Pauli Miettinen:
Hybrid ASP-based Approach to Pattern Mining. CoRR abs/1808.07302 (2018) - 2017
- [b1]Esther Galbrun, Pauli Miettinen:
Redescription Mining. Springer Briefs in Computer Science, Springer 2017, ISBN 978-3-319-72888-9, pp. 1-80 - [j9]Esther Galbrun, Pauli Miettinen:
Redescription Mining: An Overview. IEEE Intell. Informatics Bull. 18(2): 7-12 (2017) - [c30]Stefan Neumann, Pauli Miettinen:
Reductions for Frequency-Based Data Mining Problems. ICDM 2017: 997-1002 - [c29]Sergey Paramonov, Daria Stepanova, Pauli Miettinen:
Hybrid ASP-Based Approach to Pattern Mining. RuleML+RR 2017: 199-214 - [i7]Sanjar Karaev, Pauli Miettinen:
Algorithms for Approximate Subtropical Matrix Factorization. CoRR abs/1707.08872 (2017) - [i6]Stefan Neumann, Pauli Miettinen:
Reductions for Frequency-Based Data Mining Problems. CoRR abs/1709.00900 (2017) - 2016
- [c28]Janis Kalofolias, Esther Galbrun, Pauli Miettinen:
From Sets of Good Redescriptions to Good Sets of Redescriptions. ICDM 2016: 211-220 - [c27]Saskia Metzler, Stephan Günnemann, Pauli Miettinen:
Hyperbolae are No Hyperbole: Modelling Communities That are Not Cliques. ICDM 2016: 330-339 - [c26]Stefan Neumann, Rainer Gemulla, Pauli Miettinen:
What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank. ICDM 2016: 380-389 - [c25]Esther Galbrun, Pauli Miettinen:
Analysing Political Opinions Using Redescription Mining. ICDM Workshops 2016: 422-427 - [c24]Sanjar Karaev, Pauli Miettinen:
Cancer: Another Algorithm for Subtropical Matrix Factorization. ECML/PKDD (2) 2016: 576-592 - [c23]Sanjar Karaev, Pauli Miettinen:
Capricorn: An Algorithm for Subtropical Matrix Factorization. SDM 2016: 702-710 - [e1]Bettina Berendt, Björn Bringmann, Élisa Fromont, Gemma C. Garriga, Pauli Miettinen, Nikolaj Tatti, Volker Tresp:
Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2016, Riva del Garda, Italy, September 19-23, 2016, Proceedings, Part III. Lecture Notes in Computer Science 9853, Springer 2016, ISBN 978-3-319-46130-4 [contents] - [i5]Saskia Metzler, Stephan Günnemann, Pauli Miettinen:
Hyperbolae Are No Hyperbole: Modelling Communities That Are Not Cliques. CoRR abs/1602.04650 (2016) - [i4]Stefan Neumann, Rainer Gemulla, Pauli Miettinen:
What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank. CoRR abs/1609.05034 (2016) - 2015
- [j8]Saskia Metzler, Pauli Miettinen:
Clustering Boolean tensors. Data Min. Knowl. Discov. 29(5): 1343-1373 (2015) - [c22]Tetiana Zinchenko, Esther Galbrun, Pauli Miettinen:
Mining Predictive Redescriptions with Trees. ICDM Workshops 2015: 1672-1675 - [c21]Pauli Miettinen:
Generalized Matrix Factorizations as a Unifying Framework for Pattern Set Mining: Complexity Beyond Blocks. ECML/PKDD (2) 2015: 36-52 - [c20]Sanjar Karaev, Pauli Miettinen, Jilles Vreeken:
Getting to Know the Unknown Unknowns: Destructive-Noise Resistant Boolean Matrix Factorization. SDM 2015: 325-333 - [c19]Saskia Metzler, Pauli Miettinen:
Join Size Estimation on Boolean Tensors of RDF Data. WWW (Companion Volume) 2015: 77-78 - [i3]Saskia Metzler, Pauli Miettinen:
Clustering Boolean Tensors. CoRR abs/1501.00696 (2015) - [i2]Saskia Metzler, Pauli Miettinen:
On Defining SPARQL with Boolean Tensor Algebra. CoRR abs/1503.00301 (2015) - 2014
- [j7]Pauli Miettinen, Jilles Vreeken:
MDL4BMF: Minimum Description Length for Boolean Matrix Factorization. ACM Trans. Knowl. Discov. Data 8(4): 18:1-18:31 (2014) - [c18]Esther Galbrun, Pauli Miettinen:
Interactive redescription mining. SIGMOD Conference 2014: 1079-1082 - 2013
- [j6]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh:
Set Covering with Our Eyes Closed. SIAM J. Comput. 42(3): 808-830 (2013) - [c17]Ervina Çergani, Pauli Miettinen:
Discovering relations using matrix factorization methods. CIKM 2013: 1549-1552 - [c16]Dóra Erdös, Pauli Miettinen:
Discovering facts with boolean tensor tucker decomposition. CIKM 2013: 1569-1572 - [c15]Dóra Erdös, Pauli Miettinen:
Walk 'n' Merge: A Scalable Algorithm for Boolean Tensor Factorization. ICDM 2013: 1037-1042 - [c14]Jan Ramon, Pauli Miettinen, Jilles Vreeken:
Detecting Bicliques in GF[q]. ECML/PKDD (1) 2013: 509-524 - [c13]Pauli Miettinen:
Fully dynamic quasi-biclique edge covers via Boolean matrix factorizations. DyNetMM@SIGMOD 2013: 17-24 - [i1]Dóra Erdös, Pauli Miettinen:
Scalable Boolean Tensor Factorizations using Random Walks. CoRR abs/1310.4843 (2013) - 2012
- [j5]Esther Galbrun, Pauli Miettinen:
From black and white to full color: extending redescription mining outside the Boolean world. Stat. Anal. Data Min. 5(4): 284-303 (2012) - [c12]Pauli Miettinen:
Dynamic Boolean Matrix Factorizations. ICDM 2012: 519-528 - [c11]Esther Galbrun, Pauli Miettinen:
Siren: an interactive tool for mining and visualizing geospatial redescriptions. KDD 2012: 1544-1547 - [c10]Pauli Miettinen:
On Finding Joint Subspace Boolean Matrix Factorizations. SDM 2012: 954-965 - 2011
- [j4]Pauli Miettinen:
Review of Mathematical tools for data mining: set theory, partial orders, combinatorics by Dan A. Simovici and Chabane Djeraba. SIGACT News 42(2): 43-46 (2011) - [c9]Pauli Miettinen:
Boolean Tensor Factorizations. ICDM 2011: 447-456 - [c8]Pauli Miettinen, Jilles Vreeken:
Model order selection for boolean matrix factorization. KDD 2011: 51-59 - [c7]Esther Galbrun, Pauli Miettinen:
From Black and White to Full Colour: Extending Redescription Mining Outside the Boolean World. SDM 2011: 546-557 - 2010
- [c6]Pauli Miettinen:
Sparse Boolean Matrix Factorizations. ICDM 2010: 935-940
2000 – 2009
- 2008
- [j3]Pauli Miettinen:
The Boolean column and column-row matrix decompositions. Data Min. Knowl. Discov. 17(1): 39-56 (2008) - [j2]Pauli Miettinen:
On the Positive-Negative Partial Set Cover problem. Inf. Process. Lett. 108(4): 219-221 (2008) - [j1]Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila:
The Discrete Basis Problem. IEEE Trans. Knowl. Data Eng. 20(10): 1348-1362 (2008) - [c5]Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh:
Set Covering with our Eyes Closed. FOCS 2008: 347-356 - [c4]Saara Hyvönen, Pauli Miettinen, Evimaria Terzi:
Interpretable nonnegative matrix decompositions. KDD 2008: 345-353 - [c3]Pauli Miettinen:
The Boolean Column and Column-Row Matrix Decompositions. ECML/PKDD (1) 2008: 17 - [c2]Arianna Gallo, Pauli Miettinen, Heikki Mannila:
Finding Subgroups having Several Descriptions: Algorithms for Redescription Mining. SDM 2008: 334-345 - 2006
- [c1]Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila:
The Discrete Basis Problem. PKDD 2006: 335-346
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
