The PRIMPING routine -- tiling through proximal alternating linearized minimization

DOI10.1007/s10618-017-0508-zzbMath1409.68233arXiv1906.09722OpenAlexW2612556147MaRDI QIDQ1741169

Sibylle Hess, Katharina Morik, Nico Piatkowski

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.09722

zbMATH Keywords

tilingminimum description length principlealternating minimizationnonconvex-nonsmooth minimizationBoolean matrix factorizationproximal alternating linearized minimization

Mathematics Subject Classification ID

Related Items (3)

PAL-Tiling ⋮ BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent ⋮ The minimum description length principle for pattern mining: a survey

Uses Software

• MDL4BMF
• StreamKrimp
• Krimp
• PaNDa+

Cites Work

• Unnamed Item
• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Krimp: mining itemsets that compress
• Summarizing transactional databases with overlapped hyperrectangles
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Modeling by shortest data description
• Comparing apples and oranges: measuring differences between exploratory data mining results
• The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives
• Learning the parts of objects by non-negative matrix factorization
• Discovery Science
• Elements of Information Theory

This page was built for publication: The PRIMPING routine -- tiling through proximal alternating linearized minimization