{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T10:50:43Z","timestamp":1773571843386,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T00:00:00Z","timestamp":1494547200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10618-017-0508-z","type":"journal-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T07:45:53Z","timestamp":1494575153000},"page":"1090-1131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["The PRIMPING routine\u2014Tiling through proximal alternating linearized minimization"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2557-4604","authenticated-orcid":false,"given":"Sibylle","family":"Hess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katharina","family":"Morik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Piatkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"508_CR1","unstructured":"Bauckhage C (2015) k-means clustering is matrix factorization. arXiv preprint arXiv:1512.07548"},{"issue":"1\u20132","key":"508_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math Program 146(1\u20132):459\u2013494","journal-title":"Math Program"},{"key":"508_CR3","volume-title":"Elements of information theory","author":"T Cover","year":"2006","unstructured":"Cover T, Thomas J (2006) Elements of information theory. Wiley-Interscience, Hoboken"},{"issue":"3","key":"508_CR4","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T Bie De","year":"2011","unstructured":"De Bie T (2011) Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min Knowl Discov 23(3):407\u2013446","journal-title":"Data Min Knowl Discov"},{"key":"508_CR5","doi-asserted-by":"crossref","unstructured":"Ding C, Li T, Peng W, Park H (2006) Orthogonal nonnegative matrix t-factorizations for clustering. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 126\u2013135","DOI":"10.1145\/1150402.1150420"},{"key":"508_CR6","doi-asserted-by":"crossref","unstructured":"Ding CH, He X, Simon HD (2005) On the equivalence of nonnegative matrix factorization and spectral clustering. In: Proceedings of the SIAM international conference on data mining (SDM), pp 606\u2013610","DOI":"10.1137\/1.9781611972757.70"},{"key":"508_CR7","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: International conference on discovery science (DS), pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"508_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The minimum description length principle","author":"P Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald P (2007) The minimum description length principle. MIT Press, Cambridge"},{"key":"508_CR9","unstructured":"Hess S, Piatkowski N, Morik K (2014) Shrimp: descriptive patterns in a tree. In: Proceedings of the LWA workshops: KDML, IR and FGWM, pp 181\u2013192"},{"key":"508_CR10","doi-asserted-by":"crossref","unstructured":"Jarrett K, Kavukcuoglu K, Ranzato M, LeCun Y (2009) What is the best multi-stage architecture for object recognition? In: IEEE international conference on computer in proceedings (ICCV), pp 2146\u20132153","DOI":"10.1109\/ICCV.2009.5459469"},{"key":"508_CR11","doi-asserted-by":"crossref","unstructured":"Karaev S, Miettinen P, Vreeken J (2015) Getting to know the unknown unknowns: destructive-noise resistant boolean matrix factorization. In: Proceedings of the SIAM international conference on data mining (SDM), pp 325\u2013333","DOI":"10.1137\/1.9781611974010.37"},{"key":"508_CR12","doi-asserted-by":"crossref","unstructured":"Kontonasios KN, De Bie T (2010) An information-theoretic approach to finding informative noisy tiles in binary databases. In: Proceedings of the SIAM international conference on data mining (SDM), pp 153\u2013164","DOI":"10.1137\/1.9781611972801.14"},{"issue":"1\u20132","key":"508_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The hungarian method for the assignment problem. Naval Res Logist Q 2(1\u20132):83\u201397","journal-title":"Naval Res Logist Q"},{"issue":"6755","key":"508_CR14","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"key":"508_CR15","unstructured":"Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. In: Advances in neural information processing systems (NIPS), pp 556\u2013562"},{"key":"508_CR16","volume-title":"An introduction to kolmogorov complexity and its applications","author":"PVM Li","year":"1997","unstructured":"Li PVM (1997) An introduction to kolmogorov complexity and its applications. Springer, Berlin"},{"key":"508_CR17","doi-asserted-by":"crossref","unstructured":"Li T (2005) A general model for clustering binary data. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery in data mining (KDD), pp 188\u2013197","DOI":"10.1145\/1081870.1081894"},{"key":"508_CR18","doi-asserted-by":"crossref","unstructured":"Li T, Ding C (2006) The relationships among various nonnegative matrix factorization methods for clustering. In: International conference on data mining (ICDM), pp 362\u2013371","DOI":"10.1109\/ICDM.2006.160"},{"key":"508_CR19","doi-asserted-by":"crossref","unstructured":"Lucchese C, Orlando S, Perego R (2010) Mining top-k patterns from binary datasets in presence of noise. In: Proceedings of the SIAM international conference on data mining (SDM), pp 165\u2013176","DOI":"10.1137\/1.9781611972801.15"},{"issue":"12","key":"508_CR20","doi-asserted-by":"crossref","first-page":"2900","DOI":"10.1109\/TKDE.2013.181","volume":"26","author":"C Lucchese","year":"2014","unstructured":"Lucchese C, Orlando S, Perego R (2014) A unifying framework for mining approximate top-k binary patterns. Trans Knowl Data Eng 26(12):2900\u20132913","journal-title":"Trans Knowl Data Eng"},{"key":"508_CR21","doi-asserted-by":"crossref","unstructured":"Miettinen P (2015) Generalized matrix factorizations as a unifying framework for pattern set mining: complexity beyond blocks. In: European conference on machine learning and principles and practice of knowledge discovery in databases (ECMLPKDD), pp 36\u201352","DOI":"10.1007\/978-3-319-23525-7_3"},{"issue":"4","key":"508_CR22","first-page":"18:1","volume":"8","author":"P Miettinen","year":"2014","unstructured":"Miettinen P, Vreeken J (2014) Mdl4bmf: minimum description length for boolean matrix factorization. Trans Knowl Discov Data 8(4):18:1\u201318:31","journal-title":"Trans Knowl Discov Data"},{"issue":"10","key":"508_CR23","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen P, Mielikainen T, Gionis A, Das G, Mannila H (2008) The discrete basis problem. Trans Knowl Data Eng 20(10):1348\u20131362","journal-title":"Trans Knowl Data Eng"},{"issue":"2","key":"508_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/env.3170050203","volume":"5","author":"P Paatero","year":"1994","unstructured":"Paatero P, Tapper U (1994) Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5(2):111\u2013126","journal-title":"Environmetrics"},{"issue":"3","key":"508_CR25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh N, Boyd S (2014) Proximal algorithms. Found Trends Optim 1(3):127\u2013239","journal-title":"Found Trends Optim"},{"key":"508_CR26","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen J (1978) Modeling by shortest data description. Automatica 14:465\u2013471","journal-title":"Automatica"},{"key":"508_CR27","doi-asserted-by":"crossref","unstructured":"Siebes A, Kersten R (2011) A structure function for transaction data. In: Proceedings of the SIAM international conference on data mining (SDM), pp 558\u2013569","DOI":"10.1137\/1.9781611972818.48"},{"key":"508_CR28","doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of the SIAM international conference on data mining (SDM), pp 393\u2013404","DOI":"10.1137\/1.9781611972764.35"},{"key":"508_CR29","doi-asserted-by":"crossref","unstructured":"Smets K, Vreeken J (2012) Slim: directly mining descriptive patterns. In: Proceedings of the SIAM international conference on data mining (SDM), pp 236\u2013247","DOI":"10.1137\/1.9781611972825.21"},{"issue":"2","key":"508_CR30","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10618-012-0275-9","volume":"25","author":"N Tatti","year":"2012","unstructured":"Tatti N, Vreeken J (2012) Comparing apples and oranges: measuring differences between exploratory data mining results. Data Min Knowl Discov 25(2):173\u2013207","journal-title":"Data Min Knowl Discov"},{"key":"508_CR31","doi-asserted-by":"crossref","unstructured":"van Leeuwen M, Siebes A (2008) Streamkrimp: Detecting change in data streams. In: European conference on machine learning and principles and practice of knowledge discovery in databases (ECMLPKDD), pp 672\u2013687","DOI":"10.1007\/978-3-540-87479-9_62"},{"issue":"1","key":"508_CR32","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken J, Van Leeuwen M, Siebes A (2011) Krimp: mining itemsets that compress. Data Min Knowl Discov 23(1):169\u2013214","journal-title":"Data Min Knowl Discov"},{"issue":"6","key":"508_CR33","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1109\/TKDE.2012.51","volume":"25","author":"YX Wang","year":"2013","unstructured":"Wang YX, Zhang YJ (2013) Nonnegative matrix factorization: a comprehensive review. Trans Knowl Data Eng 25(6):1336\u20131353","journal-title":"Trans Knowl Data Eng"},{"issue":"2","key":"508_CR34","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10618-010-0203-9","volume":"23","author":"Y Xiang","year":"2011","unstructured":"Xiang Y, Jin R, Fuhry D, Dragan FF (2011) Summarizing transactional databases with overlapped hyperrectangles. Data Min Knowl Discov 23(2):215\u2013251","journal-title":"Data Min Knowl Discov"},{"key":"508_CR35","doi-asserted-by":"crossref","unstructured":"Zhang Z, Ding C, Li T, Zhang X (2007) Binary matrix factorization with applications. In: International conference on data mining (ICDM), pp 391\u2013400","DOI":"10.1109\/ICDM.2007.99"},{"issue":"1\u20132","key":"508_CR36","first-page":"121","volume":"98","author":"A Zimek","year":"2013","unstructured":"Zimek A, Vreeken J (2013) The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives. Mach Learn 98(1\u20132):121\u2013155","journal-title":"Mach Learn"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-017-0508-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0508-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0508-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T10:43:12Z","timestamp":1569321792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-017-0508-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,12]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s10618-017-0508-z","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,12]]}}}