{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:25:34Z","timestamp":1740176734571,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T00:00:00Z","timestamp":1466121600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Education of Japan","award":["25280121","26560134"],"award-info":[{"award-number":["25280121","26560134"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s41060-016-0012-3","type":"journal-article","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T06:02:27Z","timestamp":1466143347000},"page":"199-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Exact and approximate Boolean matrix decomposition with column-use condition"],"prefix":"10.1007","volume":"1","author":[{"given":"Yuan","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiwei","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6474-467X","authenticated-orcid":false,"given":"Tsunehiko","family":"Kameda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,17]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0166-218X(98)00039-0","volume":"86","author":"J Amilhastre","year":"1998","unstructured":"Amilhastre, J., Vilarem, M., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs. Discrete Appl. Math. 86, 125\u2013144 (1998)","journal-title":"Discrete Appl. Math."},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1201\/b10274-14","volume-title":"Handbook on Educational Data Mining, Chap. 11","author":"T Barnes","year":"2010","unstructured":"Barnes, T.: Novel derivation and application of skill matrices: the q-matrix method. In: Romero, C., Ventura, S., Pechenizkiy, M., Baker, R. (eds.) Handbook on Educational Data Mining, Chap. 11, pp. 159\u2013172. CRC Press, Florida (2010)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.csda.2006.11.006","volume":"52","author":"M Berry","year":"2007","unstructured":"Berry, M., Browne, M., Langville, A., Pauca, V., Plemmons, R.: Algorithms and applications for approximate nonnegative matrix factorization. Comput. Stat. Data Anal. 52(1), 155\u2013173 (2007)","journal-title":"Comput. Stat. Data Anal."},{"issue":"8","key":"12_CR4","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1016\/j.jcss.2015.06.002","volume":"81","author":"R B\u011blohl\u00e1vek","year":"2015","unstructured":"B\u011blohl\u00e1vek, R., Trne\u010dka, M.: From-below approximations in boolean matrix factorization: geometry and new algorithm. J. Comput. Syst. Sci. 81(8), 1678\u20131697 (2015)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"12_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R B\u011blohl\u00e1vek","year":"2010","unstructured":"B\u011blohl\u00e1vek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comput. Syst. Sci. 76(1), 3\u201320 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"12_CR6","first-page":"73","volume":"136","author":"F Doherty","year":"1999","unstructured":"Doherty, F., Lundgren, J., Siewert, D.: Biclique covers and partitions of bipartite graphs and digraphs and related matrix ranks of 0, 1-matrices. Congr. Numerantium 136(2), 73\u201396 (1999)","journal-title":"Congr. Numerantium"},{"issue":"1","key":"12_CR7","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/S0097539704442702","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas, P., Kannan, R., Mahoney, M.: Fast Monte Carlo algorithms for matrices III: computing a compressed approximate matrix decomposition. SIAM J. Comput. 36(1), 184\u2013206 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"12_CR8","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas, P., Mahoney, M., Muthukrishnan, S.: Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl. 30(2), 844\u2013881 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Ene, A., Horne, W., Milosavljevic, N., Rao, P., Schreiber, R., Tarjan, R.: Fast exact and heuristic methods for role minimization problems. In: Proceedings ACM Symposium on Access Control Models and Technologies, pp. 1\u201310 (2008)","DOI":"10.1145\/1377836.1377838"},{"issue":"4","key":"12_CR10","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln $$n$$ n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0019-9958(84)80012-1","volume":"63","author":"D Franzblau","year":"1984","unstructured":"Franzblau, D., Kleitman, D.: An algorithm for covering polygons with rectangles. Inform. Control 63, 164\u2013189 (1984)","journal-title":"Inform. Control"},{"key":"12_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Geerts, F., Goethals, B., Mielik\u00e4inen, T.: Tiling databases. In: Discovery Science. No. 3245 in LNCS, pp. 278\u2013289. Springer (2004)","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"12_CR14","volume-title":"Matrix Computations","author":"G Golub","year":"1996","unstructured":"Golub, G., Van Loan, C.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)"},{"key":"12_CR15","first-page":"223","volume":"8","author":"D Gregory","year":"1983","unstructured":"Gregory, D., Pullman, N.: Semiring rank: Boolean rank and nonnegative rank factorizations. J. Combin. Inform. Syst. Sci. 8, 223\u2013233 (1983)","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"12_CR16","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.: The Minimum Description Length Principle. MIT Press, Cambridge (2007)"},{"issue":"1","key":"12_CR17","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jagm.1998.0964","volume":"29","author":"D Hochbaum","year":"1998","unstructured":"Hochbaum, D.: Approximating clique and biclique problems. J. Algorithms 29(1), 174\u2013200 (1998)","journal-title":"J. Algorithms"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Hyv\u00f6nen, S., Miettinen, P., Terzi, E.: Interpretable nonnegative matrix decompositions. In: Proceedings 14th ACM International Conference on Knowledge Discovery & Data Mining (KDD), pp. 345\u2013353 (2008)","DOI":"10.1145\/1401890.1401935"},{"key":"12_CR19","unstructured":"Keprt, A., Sn\u00e1\u0161el, V.: Binary factor analysis with help of formal concepts. In: Proceedings CEUR Workshop, vol. 110, pp. 90\u2013101 (2004)"},{"key":"12_CR20","volume-title":"Boolean Matrix Theory and Applications","author":"K Kim","year":"1982","unstructured":"Kim, K.: Boolean Matrix Theory and Applications. M. Dekker, New York (1982)"},{"key":"12_CR21","unstructured":"Koedinger, K., McLaughlin, E., Stamper, J.: Automated student model improvement. In: Proceedings 5th International Conference on Educational Data Mining (2012)"},{"key":"12_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574948","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1996","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, New York (1996)"},{"key":"12_CR23","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan, G., DePuy, G., Whitehouse, G.: An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 176, 1387\u20131403 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings 39th International Symposium on Symbolic and Algebraic Computation (ISSAC) (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"12_CR25","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D Lee","year":"1999","unstructured":"Lee, D., Seung, H.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"12_CR26","first-page":"556","volume":"13","author":"D Lee","year":"2001","unstructured":"Lee, D., Seung, H.: Algorithms for non-negative matrix factorization. Adv. Neural Inf. Process. Syst. 13, 556\u2013562 (2001)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"12_CR27","unstructured":"Lichman, M.: UCI machine learning repository. Technical Report, School of Information and CS, University of California, Irvine, CA (2013). http:\/\/www.ics.uci.edu\/ml"},{"issue":"7","key":"12_CR28","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1177\/0146621612456591","volume":"36","author":"J Liu","year":"2012","unstructured":"Liu, J., Xu, G., Ying, Z.: Data-driven learning of q-matrix. Appl. Psychol. Meas. 36(7), 548\u2013564 (2012)","journal-title":"Appl. Psychol. Meas."},{"issue":"1","key":"12_CR29","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0403010","volume":"3","author":"A Lubiw","year":"1990","unstructured":"Lubiw, A.: The Boolean basis problem and how to cover some polygons by rectangles. SIAM J. Discrete Math. 3(1), 98\u2013115 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"12_CR30","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0095-8956(91)90073-S","volume":"53","author":"A Lubiw","year":"1991","unstructured":"Lubiw, A.: A weighted min\u2013max relation for intervals. J. Combin. Theory 53(2), 151\u2013172 (1991)","journal-title":"J. Combin. Theory"},{"key":"12_CR31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10618-008-0107-0","volume":"17","author":"P Miettinen","year":"2008","unstructured":"Miettinen, P.: The boolean column and column\u2013row matrix decompositions. Data Min. Knowl. Discov. 17, 39\u201356 (2008)","journal-title":"Data Min. Knowl. Discov."},{"key":"12_CR32","unstructured":"Miettinen, P.: Matrix Decomposition Methods for Data Mining: Computational Complexity and Algorithms. Ph.D. thesis, University of Helsinki, Helsinki (2009)"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Miettinen, P.: On finding joint subspace boolean matrix factorizations. In: Proceedings 12th SIAM International Conference on Data Mining (SDM), pp. 954\u2013965 (2012)","DOI":"10.1137\/1.9781611972825.82"},{"issue":"10","key":"12_CR34","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.: The discrete basis problem. IEEE Trans. Knowl. Data Eng. 20(10), 1348\u20131362 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"12_CR35","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(94)00350-R","volume":"149","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: On edge perfectness and classes of bipartite graphs. Discrete Math. 149, 159\u2013187 (1996)","journal-title":"Discrete Math."},{"issue":"55","key":"12_CR36","doi-asserted-by":"crossref","first-page":"7324","DOI":"10.1038\/sj.onc.1209717","volume":"25","author":"S Myllykangas","year":"2006","unstructured":"Myllykangas, S., Himberg, J., Bhling, T., Nagy, B., Hollm\u00e9n, J., Knuutila, S.: DNA copy number amplification profiling of human neoplasms. Oncogene 25(55), 7324\u20137332 (2006)","journal-title":"Oncogene"},{"key":"12_CR37","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0025-5564(78)90088-3","volume":"40","author":"D Nau","year":"1978","unstructured":"Nau, D., Markowsky, G., Woodbury, M., Amos, D.: A mathematical analysis of human leukocyte antigen serology. Math. Biosci. 40, 243\u2013270 (1978)","journal-title":"Math. Biosci."},{"issue":"5","key":"12_CR38","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"80","author":"J Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indag. Math. 80(5), 406\u2013424 (1977)","journal-title":"Indag. Math."},{"key":"12_CR39","volume-title":"Mining of Massive Datasets","author":"A Rajaraman","year":"2014","unstructured":"Rajaraman, A., Leskovec, J., Ullman, J.: Mining of Massive Datasets, 2nd edn. Cambridge University Press, New York (2014)","edition":"2"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Streich, A., Frank, M., Basin, D., Buhmann, J.: Multi-assignment clustering for Boolean data. In: Proceedings International Conference on Machine Learning (ICML), pp. 969\u2013976 (2009)","DOI":"10.1145\/1553374.1553498"},{"key":"12_CR41","unstructured":"Sun, Y., Ye, S., Inoue, S., Sun, Y.: Alternating recursive method for Q-matrix learning. In: Proceedings 7th International Conference on Educational Data Mining (EDM), pp. 14\u201320 (2014)"},{"key":"12_CR42","first-page":"337","volume":"51","author":"C Tatsuoka","year":"2002","unstructured":"Tatsuoka, C.: Data-analytic methods for latent partially ordered classification models. Appl. Stat. (JRSS-C) 51, 337\u2013350 (2002)","journal-title":"Appl. Stat. (JRSS-C)"},{"key":"12_CR43","doi-asserted-by":"crossref","DOI":"10.4324\/9780203883372","volume-title":"Cognitive Assessment: An Introduction to the Rule Space Method","author":"K Tatsuoka","year":"2009","unstructured":"Tatsuoka, K.: Cognitive Assessment: An Introduction to the Rule Space Method. Routledge, New York (2009)"},{"issue":"4","key":"12_CR44","doi-asserted-by":"crossref","first-page":"350","DOI":"10.15807\/jorsj.50.350","volume":"50","author":"S Umetani","year":"2007","unstructured":"Umetani, S., Yagiura, M.: Relaxation heuristic for the set covering problem. J. Oper. Res. Soc. Jpn. 50(4), 350\u2013375 (2007)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Vaidya, J.: Boolean matrix decomposition problem: theory, variations and applications to data engineering. In: Proceedings IEEE 28th International Conference on Data Eng, pp. 1222\u20131224 (2012)","DOI":"10.1109\/ICDE.2012.144"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Atluri, V., Guo, Q.: The role mining problem: finding a minimal descriptive set of roles. In: Proceedings ACM Symposium Access Control Models and Technologies, pp. 175\u2013184 (2007)","DOI":"10.1145\/1266840.1266870"},{"key":"12_CR47","doi-asserted-by":"crossref","unstructured":"Vavasis, S.: On the complexity of nonnegative matrix factorization. SIAM J. Optim. 20, 1364\u20131377 (2010)","DOI":"10.1137\/070709967"},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"Williams, V.: Multiplying matrices faster than Coppersmith\u2013Winograd. In: Proceedings 44th ACM Symposium Theory of Computing (STOC), pp. 887\u2013898 (2012)","DOI":"10.1145\/2213977.2214056"},{"key":"12_CR49","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, F.: Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Discov. 23, 215\u2013251 (2011)","journal-title":"Data Min. Knowl. Discov."},{"key":"12_CR50","unstructured":"Zhang, S., DeCarlo, L., Ying, Z.: Non-identifiability, Equivalence Classes, and Attribute-Specific Classification in Q-Matrix Based Cognitive Diagnosis Models. Technical Report, Columbia University (2013)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0012-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-016-0012-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-016-0012-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T17:46:06Z","timestamp":1568051166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-016-0012-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,17]]},"references-count":50,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1007\/s41060-016-0012-3","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2016,6,17]]}}}