{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:10:22Z","timestamp":1772784622066,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,6,16]],"date-time":"2015-06-16T00:00:00Z","timestamp":1434412800000},"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":[[2015,9]]},"DOI":"10.1007\/s10618-015-0420-3","type":"journal-article","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T01:42:41Z","timestamp":1434332561000},"page":"1343-1373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Clustering Boolean tensors"],"prefix":"10.1007","volume":"29","author":[{"given":"Saskia","family":"Metzler","sequence":"first","affiliation":[]},{"given":"Pauli","family":"Miettinen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"key":"420_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/jagm.1999.1024","volume":"33","author":"N Alon","year":"1999","unstructured":"Alon N, Sudakov B (1999) On two segmentation problems. J Algorithm 33:173\u2013184","journal-title":"J Algorithm"},{"issue":"2","key":"420_CR2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s11083-012-9254-4","volume":"30","author":"R B\u011blohl\u00e1vek","year":"2012","unstructured":"B\u011blohl\u00e1vek R, Glodeanu C, Vychodil V (2012) Optimal factorization of three-way binary data using triadic concepts. Order 30(2):437\u2013454","journal-title":"Order"},{"key":"420_CR3","doi-asserted-by":"crossref","unstructured":"Cantador I, Brusilovsky P, Kuflik T (2011) 2nd Workshop on Information Heterogeneity and Fusion in Recommender Systems (HetRec \u201911). In: 5th ACM Conference on Recommender Systems (RecSys\u201911)","DOI":"10.1145\/2043932.2044016"},{"issue":"3","key":"420_CR4","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll JD, Chang JJ (1970) Analysis of individual differences in multidimensional scaling via an N-way generalization of \u201cEckart-Young\u201d decomposition. Psychometrika 35(3):283\u2013319","journal-title":"Psychometrika"},{"issue":"1","key":"420_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2009) Closed patterns meet n-ary relations. ACM Trans Knowl Discov Data 3(1):1","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"420_CR6","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/s10618-012-0284-8","volume":"26","author":"L Cerf","year":"2013","unstructured":"Cerf L, Besson J, Nguyen KNT, Boulicaut JF (2013) Closed and noise-tolerant patterns in n-ary relations. Data Min Knowl Discov 26(3):574\u2013619","journal-title":"Data Min Knowl Discov"},{"issue":"4","key":"420_CR7","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1137\/110859063","volume":"33","author":"EC Chi","year":"2012","unstructured":"Chi EC, Kolda TG (2012) On tensors, sparsity, and nonnegative factorizations. SIAM J Matrix Anal Appl 33(4):1272\u20131299","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"420_CR8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Menon R (1998) OpenMP: an industry standard API for shared-memory programming. IEEE Comput Sci Eng Mag 5(1):46\u201355","journal-title":"IEEE Comput Sci Eng Mag"},{"key":"420_CR9","doi-asserted-by":"crossref","unstructured":"Erd\u0151s D, Miettinen P (2013a) Discovering facts with boolean tensor tucker decomposition. In: 22nd ACM International Conference on Information & Knowledge Management (CIKM \u201913), pp 1569\u20131572","DOI":"10.1145\/2505515.2507846"},{"key":"420_CR10","doi-asserted-by":"crossref","unstructured":"Erd\u0151s D, Miettinen P (2013b) Walk\u2019n\u2019Merge: a scalable algorithm for Boolean tensor factorization. In: 13th IEEE International Conference on Data Mining (ICDM \u201913), pp 1037\u20131042","DOI":"10.1109\/ICDM.2013.141"},{"key":"420_CR11","unstructured":"Harshman RA (1970) Foundations of the PARAFAC procedure: models and conditions for an \u201cexplanatory\u201d multimodal factor analysis. Tech. Rep. 16, UCLA Working Papers in Phonetics"},{"key":"420_CR12","doi-asserted-by":"crossref","unstructured":"Huang H, Ding C, Luo D, Li T (2008) Simultaneous tensor subspace selection and clustering: the equivalence of high order SVD and k-means clustering. In: 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201908), pp 327\u2013335","DOI":"10.1145\/1401890.1401933"},{"key":"420_CR13","doi-asserted-by":"crossref","unstructured":"Ignatov DI, Kuznetsov SO, Magizov RA, Zhukov LE (2011) From triconcepts to triclusters. In: 13th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC \u201911), pp 257\u2013264","DOI":"10.1007\/978-3-642-21881-1_41"},{"key":"420_CR14","doi-asserted-by":"crossref","unstructured":"Jegelka S, Sra S, Banerjee A (2009) Approximation algorithms for tensor clustering. In: International Conference on Algorithmic Learning Theory (ALT \u201909), pp 368\u2013383","DOI":"10.1007\/978-3-642-04414-4_30"},{"key":"420_CR15","unstructured":"Jiang P (2014) Pattern extraction and clustering for high-dimensional discrete data. PhD thesis, University of Illinois at Urbana-Champaign"},{"key":"420_CR16","doi-asserted-by":"crossref","unstructured":"Kim M, Candan KS (2011) Approximate tensor decomposition within a tensor-relational algebraic framework. In: 20th ACM International Conference on Information & Knowledge Management (CIKM \u201911), pp 1737\u20131742","DOI":"10.1145\/2063576.2063827"},{"key":"420_CR17","doi-asserted-by":"crossref","unstructured":"Kim M, Candan KS (2012) Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient tensor decomposition. In: 21st ACM International Conference on Information & Knowledge Management (CIKM \u201912), pp 355\u2013364","DOI":"10.1145\/2396761.2396809"},{"key":"420_CR18","doi-asserted-by":"crossref","unstructured":"Kim M, Candan KS (2014) Pushing-down tensor decompositions over unions to promote reuse of materialized decompositions. In: European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD \u201914), pp 688\u2013704","DOI":"10.1007\/978-3-662-44848-9_44"},{"issue":"4","key":"420_CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1009726428407","volume":"2","author":"J Kleinberg","year":"1998","unstructured":"Kleinberg J, Papadimitriou C, Raghavan P (1998) A microeconomic view of data mining. Data Min Knowl Discov 2(4):311\u2013324","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"420_CR20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/972639.972644","volume":"51","author":"JM Kleinberg","year":"2004","unstructured":"Kleinberg JM, Papadimitriou CH, Raghavan P (2004) Segmentation problems. J ACM 51(2):263\u2013280","journal-title":"J ACM"},{"issue":"3","key":"420_CR21","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","journal-title":"SIAM Rev"},{"issue":"1","key":"420_CR22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02294316","volume":"64","author":"I Leenen","year":"1999","unstructured":"Leenen I, Van Mechelen I, De Boeck P, Rosenberg S (1999) INDCLAS: a three-way hierarchical classes model. Psychometrika 64(1):9\u201324","journal-title":"Psychometrika"},{"key":"420_CR23","doi-asserted-by":"crossref","unstructured":"Liu X, De Lathauwer L, Janssens F, De Moor B (2010) Hybrid clustering of multiple information sources via HOSVD. In: 7th International Conference on Advances in Neural Networks\u2014Part II (ISNN \u201910), pp 337\u2013345","DOI":"10.1007\/978-3-642-13318-3_42"},{"key":"420_CR24","unstructured":"Miettinen P (2009) Matrix Decomposition methods for data mining: computational complexity and algorithms. PhD thesis, Department of Computer Science, University of Helsinki"},{"key":"420_CR25","doi-asserted-by":"crossref","unstructured":"Miettinen P (2010) Sparse Boolean matrix factorizations. In: 10th IEEE International Conference on Data Mining (ICDM \u201910), pp 935\u2013940","DOI":"10.1109\/ICDM.2010.93"},{"key":"420_CR26","doi-asserted-by":"crossref","unstructured":"Miettinen P (2011) Boolean tensor factorizations. In: 11th IEEE International Conference on Data Mining (ICDM \u201911), pp 447\u2013456","DOI":"10.1109\/ICDM.2011.28"},{"issue":"4","key":"420_CR27","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/2601437","volume":"8","author":"P Miettinen","year":"2014","unstructured":"Miettinen P, Vreeken J (2014) MDL4BMF: minimum description length for Boolean matrix factorization. ACM Trans Knowl Discov Data 8(4):18","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"10","key":"420_CR28","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen P, Mielik\u00e4inen T, Gionis A, Das G, Mannila H (2008) The discrete basis problem. IEEE Trans Knowl Data Eng 20(10):1348\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"420_CR29","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover Publications, Mineola"},{"key":"420_CR30","doi-asserted-by":"crossref","unstructured":"Papalexakis EE, Faloutsos C, Sidiropoulos ND (2012) ParCube: sparse parallelizable tensor decompositions. In: European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD \u201912), pp 521\u2013536","DOI":"10.1007\/978-3-642-33460-3_39"},{"issue":"2","key":"420_CR31","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/TSP.2012.2225052","volume":"61","author":"EE Papalexakis","year":"2013","unstructured":"Papalexakis EE, Sidiropoulos N, Bro R (2013) From K-means to higher-way co-clustering: multilinear decomposition with sparse latent factors. IEEE Trans Signal Process 61(2):493\u2013506","journal-title":"IEEE Trans Signal Process"},{"issue":"5","key":"420_CR32","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(5):465\u2013471","journal-title":"Automatica"},{"issue":"3","key":"420_CR33","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.ipl.2004.10.006","volume":"93","author":"JK Sepp\u00e4nen","year":"2005","unstructured":"Sepp\u00e4nen JK (2005) Upper bound for the approximation ratio of a class of hypercube segmentation algorithms. Inform Process Lett 93(3):139\u2013141","journal-title":"Inform Process Lett"},{"key":"420_CR34","doi-asserted-by":"crossref","unstructured":"Suchanek FM, Kasneci G, Weikum G (2007) Yago: a core of semantic knowledge. In: 16th International Conference on World Wide Web (WWW \u201907), pp 697\u2013706","DOI":"10.1145\/1242572.1242667"},{"issue":"3","key":"420_CR35","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker LR (1966) Some mathematical notes on three-mode factor analysis. Psychometrika 31(3):279\u2013311","journal-title":"Psychometrika"},{"key":"420_CR36","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in Facebook. In: 2nd ACM Workshop on Online Social Networks (WOSN \u201909), pp 37\u201342","DOI":"10.1145\/1592665.1592675"},{"key":"420_CR37","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1613\/jair.2772","volume":"34","author":"A Yates","year":"2009","unstructured":"Yates A, Etzioni O (2009) Unsupervised methods for determining object and relation synonyms on the web. J Artif Intell Res 34:255\u2013296","journal-title":"J Artif Intell Res"},{"key":"420_CR38","doi-asserted-by":"crossref","unstructured":"Zhao L, Zaki MJ (2005) TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data. In: ACM SIGMOD International Conference on Management of Data (SIGMOD \u201905), pp 694\u2013705","DOI":"10.1145\/1066157.1066236"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0420-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-015-0420-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-015-0420-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T19:34:45Z","timestamp":1566848085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-015-0420-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,16]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s10618-015-0420-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,16]]}}}