{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:55:15Z","timestamp":1763664915953,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T00:00:00Z","timestamp":1657929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T00:00:00Z","timestamp":1657929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10115-022-01708-2","type":"journal-article","created":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T18:02:26Z","timestamp":1657994546000},"page":"2171-2188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Theoretical backgrounds of Boolean reasoning-based binary n-clustering"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9979-8208","authenticated-orcid":false,"given":"Marcin","family":"Michalak","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,16]]},"reference":[{"issue":"337","key":"1708_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/01621459.1972.10481214","volume":"67","author":"JA Hartigan","year":"1972","unstructured":"Hartigan JA (1972) Direct clustering of a data matrix. J Am Stat Assoc 67(337):123\u2013129. https:\/\/doi.org\/10.1080\/01621459.1972.10481214","journal-title":"J Am Stat Assoc"},{"key":"1708_CR2","doi-asserted-by":"publisher","unstructured":"Krolak-Schwerdt S, Orlik P, Ganter B (1994) Information Systems and Data Analysis, In: Bock HH, Lenski W, Richter MM (eds) Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 298\u2013307. https:\/\/doi.org\/10.1007\/978-3-642-46808-7_27","DOI":"10.1007\/978-3-642-46808-7_27"},{"key":"1708_CR3","doi-asserted-by":"publisher","unstructured":"Lehmann F, Wille R (1995) Conceptual Structures: Applications, Implementation and Theory, In: Ellis G, Levinson R, Rich W, Sowa JF (eds), Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 32\u201343. https:\/\/doi.org\/10.1007\/3-540-60161-9_27","DOI":"10.1007\/3-540-60161-9_27"},{"key":"1708_CR4","doi-asserted-by":"publisher","unstructured":"Mishra S, Vipsita S (2017) In 2017 14th IEEE India Council International Conference (INDICON), pp. 1\u20136. https:\/\/doi.org\/10.1109\/INDICON.2017.8488107","DOI":"10.1109\/INDICON.2017.8488107"},{"key":"1708_CR5","doi-asserted-by":"publisher","unstructured":"Mahanta P, Ahmed HA, Bhattacharyya DK, Kalita JK (2011) In 2011 2nd National Conference on Emerging Trends and Applications in Computer Science, pp. 1\u20136. https:\/\/doi.org\/10.1109\/NCETACS.2011.5751409","DOI":"10.1109\/NCETACS.2011.5751409"},{"issue":"8","key":"1708_CR6","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1109\/TPAMI.2016.2608882","volume":"39","author":"J Tang","year":"2017","unstructured":"Tang J, Shu X, Qi G, Li Z, Wang M, Yan S, Jain R (2017) Tri-clustered tensor completion for social-aware image tag refinement. IEEE Trans Pattern Anal Mach Intell 39(8):1662\u20131674. https:\/\/doi.org\/10.1109\/TPAMI.2016.2608882","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"1708_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.3233\/FI-2018-1703","volume":"161","author":"M Michalak","year":"2018","unstructured":"Michalak M, \u015al\u0229zak D (2018) Boolean representation for exact biclustering. Fund Inform 161(3):275\u2013297. https:\/\/doi.org\/10.3233\/FI-2018-1703","journal-title":"Fund Inform"},{"issue":"1","key":"1708_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.34768\/amcs-2020-0013","volume":"30","author":"M Michalak","year":"2020","unstructured":"Michalak M, Jaksik P, \u015al\u0229zak D (2020) Heuristic search of exact biclusters in binary data. Int J Appl Math Comput Sci 30(1):161\u2013171","journal-title":"Int J Appl Math Comput Sci"},{"issue":"3","key":"1708_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.3233\/FI-2019-1814","volume":"167","author":"M Michalak","year":"2019","unstructured":"Michalak M, \u015al\u0229zak D (2019) On Boolean representation of continuous data biclustering. Fund Inform 167(3):193\u2013217. https:\/\/doi.org\/10.3233\/FI-2019-1814","journal-title":"Fund Inform"},{"key":"1708_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-31964-9_23","volume":"1061","author":"M Michalak","year":"2020","unstructured":"Michalak M (2020) Induction of centre-based biclusters in terms of Boolean reasoning. Adv Intell Syst Comput 1061:239\u2013248. https:\/\/doi.org\/10.1007\/978-3-030-31964-9_23","journal-title":"Adv Intell Syst Comput"},{"key":"1708_CR11","unstructured":"MacQueen JB (1967) In Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a01, Cam LML , Neyman J (eds), University of California Press, pp. 281\u2013297"},{"key":"1708_CR12","first-page":"801","volume":"4","author":"H Steinhaus","year":"1957","unstructured":"Steinhaus H (1957) Sur la division des corps mat\u00e9riels en parties. Bull Acad Pol Sci Cl III 4:801\u2013804","journal-title":"Bull Acad Pol Sci Cl III"},{"issue":"3","key":"1708_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1080\/01969727308546046","volume":"3","author":"JC Dunn","year":"1973","unstructured":"Dunn JC (1973) A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. J Cybern 3(3):32\u201357. https:\/\/doi.org\/10.1080\/01969727308546046","journal-title":"J Cybern"},{"key":"1708_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern recognition with fuzzy objective function algorithms","author":"JC Bezdek","year":"1981","unstructured":"Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Springer-Verlag, US"},{"key":"1708_CR15","unstructured":"Ester M, Kriegel HP, Sander J, Xu X (1996) (AAAI Press), KDD\u201896, pp. 226\u2013231"},{"issue":"1","key":"1708_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF00337288","volume":"43","author":"T Kohonen","year":"1982","unstructured":"Kohonen T (1982) Self-organized formation of topologically correct feature maps. Biol Cybern 43(1):59\u201369. https:\/\/doi.org\/10.1007\/BF00337288","journal-title":"Biol Cybern"},{"key":"1708_CR17","doi-asserted-by":"crossref","unstructured":"Tanay A, Sharan R, Shamir R (2005) Handbook of Computational Molecular Biology (Chapman & Hall, CRC Press, Chap. A Survey, Biclustering Algorithms","DOI":"10.1201\/9781420036275.ch26"},{"key":"1708_CR18","first-page":"1","volume":"54","author":"R Latkowski","year":"2003","unstructured":"Latkowski R (2003) On decomposition for incomplete data. Fund Inform 54:1\u201316","journal-title":"Fund Inform"},{"key":"1708_CR19","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-41","author":"M Chagoyen","year":"2006","unstructured":"Chagoyen M, Carmona-Saez P, Shatkay H, Carazo JM, Pascual-Montano A (2006) Discovering semantic features in the literature: a foundation for building functional associations. BMC Bioinf. https:\/\/doi.org\/10.1186\/1471-2105-7-41","journal-title":"BMC Bioinf"},{"key":"1708_CR20","doi-asserted-by":"publisher","unstructured":"Orzechowski P, Boryczko K (2016) In Proceedings of the 15th International Conference on Artificial Intelligence and Soft Computing (Springer International Publishing), pp. 102\u2013113. https:\/\/doi.org\/10.1007\/978-3-319-39384-1_9","DOI":"10.1007\/978-3-319-39384-1_9"},{"issue":"9","key":"1708_CR21","doi-asserted-by":"publisher","first-page":"2964","DOI":"10.1016\/j.cor.2007.01.005","volume":"35","author":"S Busygin","year":"2008","unstructured":"Busygin S, Prokopyev O, Pardalos PM (2008) Biclustering in data mining. Computers Oper Res 35(9):2964\u20132987. https:\/\/doi.org\/10.1016\/j.cor.2007.01.005","journal-title":"Computers Oper Res"},{"key":"1708_CR22","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jbi.2015.06.028","volume":"57","author":"B Pontes","year":"2015","unstructured":"Pontes B, Gir\u00e1ldez R, Aguilar-Ruiz JS (2015) Biclustering on expression data: a review. J Biomed Inform 57:163\u2013180","journal-title":"J Biomed Inform"},{"key":"1708_CR23","unstructured":"Ignatov DI, Watson BW (2016) In Russian and South African Workshop on Knowledge Discovery Techniques Based on Formal Concept Analysis, vol. 1522, pp. 23\u201339"},{"key":"1708_CR24","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-6-18","author":"A Serin","year":"2011","unstructured":"Serin A, Vingron M (2011) DeBi: Discovering differentially expressed biclusters using a frequent itemset approach. Algorithms Mole Biol. https:\/\/doi.org\/10.1186\/1748-7188-6-18","journal-title":"Algorithms Mole Biol"},{"key":"1708_CR25","doi-asserted-by":"publisher","DOI":"10.1145\/3195833","author":"R Henriques","year":"2018","unstructured":"Henriques R, Madeira SC (2018) Triclustering algorithms for three-dimensional data analysis: a comprehensive survey. ACM Comput Surv. https:\/\/doi.org\/10.1145\/3195833","journal-title":"ACM Comput Surv"},{"key":"1708_CR26","doi-asserted-by":"publisher","unstructured":"Bhar A, Haubrock M, Mukhopadhyay A, Maulik U, Bandyopadhyay S, Wingender E (2012) In Algorithms in Bioinformatics, Raphael B, Tang J (eds), Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 165\u2013177. https:\/\/doi.org\/10.1007\/978-3-642-33122-0_13","DOI":"10.1007\/978-3-642-33122-0_13"},{"key":"1708_CR27","doi-asserted-by":"publisher","unstructured":"Dede D, O\u011ful H (2013) In 2013 IEEE INISTA, pp. 1\u20135. https:\/\/doi.org\/10.1109\/INISTA.2013.6577644","DOI":"10.1109\/INISTA.2013.6577644"},{"issue":"5","key":"1708_CR28","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/minf.201400007","volume":"33","author":"D Dede","year":"2014","unstructured":"Dede D, O\u011ful H (2014) Triclust: A tool for cross-species analysis of gene regulation. Mol Inf 33(5):382\u2013387. https:\/\/doi.org\/10.1002\/minf.201400007","journal-title":"Mol Inf"},{"key":"1708_CR29","doi-asserted-by":"publisher","unstructured":"Sim K, Aung Z, Gopalkrishnan V (2010) In 2010 IEEE International Conference on Data Mining, pp. 471\u2013480. https:\/\/doi.org\/10.1109\/ICDM.2010.19","DOI":"10.1109\/ICDM.2010.19"},{"key":"1708_CR30","doi-asserted-by":"publisher","unstructured":"Xu X, Lu Y, Tan K, Tung AKH (2009) In 2009 IEEE 25th International Conference on Data Engineering, pp. 445\u2013456. https:\/\/doi.org\/10.1109\/ICDE.2009.80","DOI":"10.1109\/ICDE.2009.80"},{"issue":"8","key":"1708_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.0030148","volume":"3","author":"GK Gerber","year":"2007","unstructured":"Gerber GK, Dowell RD, Jaakkola TS, Gifford DK (2007) Automated discovery of functional generality of human gene expression programs. PLoS Comput Biol 3(8):1\u201315. https:\/\/doi.org\/10.1371\/journal.pcbi.0030148","journal-title":"PLoS Comput Biol"},{"issue":"3","key":"1708_CR32","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s11634-015-0218-6","volume":"12","author":"R Guigour\u00e8s","year":"2018","unstructured":"Guigour\u00e8s R, Boull\u00e9 M, Rossi F (2018) Discovering patterns in time-varying graphs: a triclustering approach. Adv Data Anal Classif 12(3):509\u2013536. https:\/\/doi.org\/10.1007\/s11634-015-0218-6","journal-title":"Adv Data Anal Classif"},{"issue":"1","key":"1708_CR33","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10994-015-5487-y","volume":"101","author":"DI Ignatov","year":"2015","unstructured":"Ignatov DI, Gnatyshak DV, Kuznetsov SO, Mirkin BG (2015) Triadic formal concept analysis and triclustering: searching for optimal patterns. Mach Learn 101(1):271\u2013302. https:\/\/doi.org\/10.1007\/s10994-015-5487-y","journal-title":"Mach Learn"},{"key":"1708_CR34","doi-asserted-by":"publisher","unstructured":"Zhao L, Zaki MJ (2005) In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data (Association for Computing Machinery, New York, NY, USA), SIGMOD \u201905, pp. 694\u2013705. https:\/\/doi.org\/10.1145\/1066157.1066236","DOI":"10.1145\/1066157.1066236"},{"key":"1708_CR35","doi-asserted-by":"publisher","unstructured":"Hu Z, Bhatnagar R (2010) In 2010 IEEE International Conference on Data Mining, pp. 236\u2013245. https:\/\/doi.org\/10.1109\/ICDM.2010.77","DOI":"10.1109\/ICDM.2010.77"},{"key":"1708_CR36","unstructured":"Ji L, Tan KL, Tung AKH (2006) In Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB Endowment), VLDB \u201906, pp. 811\u2013822"},{"key":"1708_CR37","doi-asserted-by":"publisher","unstructured":"Liu Junwan, Li Zhoujun, Hu Xiaohua, Chen Yiming (2008) in 2008 IEEE International Conference on Granular Computing, pp. 442\u2013447. https:\/\/doi.org\/10.1109\/GRC.2008.4664735","DOI":"10.1109\/GRC.2008.4664735"},{"key":"1708_CR38","doi-asserted-by":"publisher","unstructured":"Gutierrez-Aviles D, Rubio-Escudero C (2014) in 2014 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 30\u201337. https:\/\/doi.org\/10.1109\/BIBM.2014.6999244","DOI":"10.1109\/BIBM.2014.6999244"},{"key":"1708_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2078-5","volume-title":"Boolean Reasoning","author":"FM Brown","year":"1990","unstructured":"Brown FM (1990) Boolean Reasoning. Springer, US"},{"issue":"1","key":"1708_CR40","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2006.06.007","volume":"177","author":"Z Pawlak","year":"2007","unstructured":"Pawlak Z, Skowron A (2007) Rough sets and boolean reasoning. Inf Sci 177(1):41\u201373","journal-title":"Inf Sci"},{"key":"1708_CR41","doi-asserted-by":"publisher","unstructured":"Stawicki S, \u015al\u0229zak D, Janusz A, Widz S (2017) Decision bireducts and decision reducts\u2014a comparison. Int J Approx Reason 84:75\u2013109 https:\/\/doi.org\/10.1016\/j.ijar.2017.02.007. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X17301408","DOI":"10.1016\/j.ijar.2017.02.007"},{"key":"1708_CR42","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D Johnson","year":"1974","unstructured":"Johnson D (1974) Approximation algorithms for combinational problems. J Comput Syst Sci 9:256\u2013278. https:\/\/doi.org\/10.1016\/S0022-0000(74)80044-9","journal-title":"J Comput Syst Sci"},{"key":"1708_CR43","doi-asserted-by":"publisher","unstructured":"Cook SA (1971) In Proceedings of the Third Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, NY, USA), STOC \u201971, pp. 151\u2013158. https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"1708_CR44","doi-asserted-by":"publisher","unstructured":"Michalak M (2022) Hierarchical heuristics for Boolean\u2013reasoning\u2014based binary bicluster induction. Acta Informatica. https:\/\/doi.org\/10.1007\/s00236-021-00415-9","DOI":"10.1007\/s00236-021-00415-9"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01708-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01708-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01708-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T07:36:01Z","timestamp":1727595361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01708-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,16]]},"references-count":44,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1708"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01708-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2022,7,16]]},"assertion":[{"value":"19 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}