{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:44:10Z","timestamp":1786981450432,"version":"build-2736575974"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"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":["Mach Learn"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10994-015-5487-y","type":"journal-article","created":{"date-parts":[[2015,3,31]],"date-time":"2015-03-31T23:23:13Z","timestamp":1427844193000},"page":"271-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["Triadic Formal Concept Analysis and triclustering: searching for optimal patterns"],"prefix":"10.1007","volume":"101","author":[{"given":"Dmitry I.","family":"Ignatov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmitry V.","family":"Gnatyshak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergei O.","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boris G.","family":"Mirkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,1]]},"reference":[{"key":"5487_CR1","unstructured":"Asses, Y., Buzmakov, A., Bourquard, T., Kuznetsov, S. O., & Napoli, A. (2012). A hybrid classification approach based on FCA and emerging patterns\u2014an application for the classification of biological inhibitors. In Proceedings of the 9th international conference on concept lattices and their applications, pp. 211\u2013222."},{"key":"5487_CR2","first-page":"1919","volume":"8","author":"A Banerjee","year":"2007","unstructured":"Banerjee, A., Dhillon, I. S., Ghosh, J., Merugu, S., & Modha, D. S. (2007). A generalized maximum entropy approach to Bregman co-clustering and matrix approximation. Journal of Machine Learning Research, 8, 1919\u20131986.","journal-title":"Journal of Machine Learning Research"},{"issue":"10","key":"5487_CR3","doi-asserted-by":"crossref","first-page":"1282","DOI":"10.1093\/bioinformatics\/btl099","volume":"22","author":"S Barkow","year":"2006","unstructured":"Barkow, S., Bleuler, S., Prelic, A., Zimmermann, P., & Zitzler, E. (2006). BicAT: a biclustering analysis toolbox. Bioinformatics, 22(10), 1282\u20131283.","journal-title":"Bioinformatics"},{"issue":"1","key":"5487_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R Belohl\u00e1vek","year":"2010","unstructured":"Belohl\u00e1vek, R., & Vychodil, V. (2010). Discovery of optimal factors in binary data via a novel method of matrix decomposition. Journal of Computer and System Sciences, 76(1), 3\u201320.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"5487_CR5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1080\/03081070902857563","volume":"38","author":"R Belohl\u00e1vek","year":"2009","unstructured":"Belohl\u00e1vek, R., Baets, B. D., Outrata, J., & Vychodil, V. (2009). Inducing decision trees via concept lattices. International Journal of General Systems, 38(4), 455\u2013467.","journal-title":"International Journal of General Systems"},{"issue":"2","key":"5487_CR6","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s11083-012-9254-4","volume":"30","author":"R Belohl\u00e1vek","year":"2013","unstructured":"Belohl\u00e1vek, R., Glodeanu, C., & Vychodil, V. (2013). Optimal factorization of three-way binary data using triadic concepts. Order, 30(2), 437\u2013454.","journal-title":"Order"},{"issue":"1\u20132","key":"5487_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10472-014-9414-x","volume":"72","author":"R Belohl\u00e1vek","year":"2014","unstructured":"Belohl\u00e1vek, R., Outrata, J., & Trnecka, M. (2014). Impact of boolean factorization as preprocessing methods for classification of boolean data. Annals of Mathematics and Artificial Intelligence, 72(1\u20132), 3\u201322.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"6","key":"5487_CR8","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/s00778-010-0208-4","volume":"19","author":"D Benz","year":"2010","unstructured":"Benz, D., Hotho, A., J\u00e4schke, R., Krause, B., Mitzlaff, F., Schmitz, C., et al. (2010). The social bookmark and publication management system Bibsonomy\u2014A platform for evaluating and demonstrating web 2.0 research. VLDB Journal, 19(6), 849\u2013875.","journal-title":"VLDB Journal"},{"issue":"1","key":"5487_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/IDA-2005-9105","volume":"9","author":"J Besson","year":"2005","unstructured":"Besson, J., Robardet, C., Boulicaut, J. F., & Rome, S. (2005). Constraint-based concept mining and its application to microarray data analysis. Intelligent Data Analysis, 9(1), 59\u201382.","journal-title":"Intelligent Data Analysis"},{"key":"5487_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BFb0054916","volume-title":"Conceptual structures: Theory, tools and applications, LNCS","author":"K Biedermann","year":"1998","unstructured":"Biedermann, K. (1998). Powerset trilattices. Conceptual structures: Theory, tools and applications, LNCS (Vol. 1453, pp. 209\u2013221). Berlin: Springer."},{"issue":"10","key":"5487_CR11","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1093\/bioinformatics\/btg096","volume":"19","author":"VG Blinova","year":"2003","unstructured":"Blinova, V. G., Dobrynin, D. A., Finn, V. K., Kuznetsov, S. O., & Pankratova, E. S. (2003). Toxicology analysis by means of the JSM-method. Bioinformatics, 19(10), 1201\u20131207.","journal-title":"Bioinformatics"},{"key":"5487_CR12","unstructured":"Buzmakov, A., Egho, E., Jay, N., Kuznetsov, S.O., Napoli, A., & Ra\u00efssi, C. (2013). On projections of sequential pattern structures (with an application on care trajectories). In: Proceedings of the 10th international conference on concept lattices and their applications, pp. 199\u2013208."},{"key":"5487_CR13","doi-asserted-by":"crossref","unstructured":"Carpineto. C., & Romano, G. (1993). Galois: An order-theoretic approach to conceptual clustering. In: Proceeding of ICML93, Amherst, (pp. 33\u201340).","DOI":"10.1016\/B978-1-55860-307-3.50011-3"},{"key":"5487_CR14","first-page":"95","volume":"24","author":"C Carpineto","year":"1996","unstructured":"Carpineto, C., & Romano, G. (1996). A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning, 24, 95\u2013122.","journal-title":"Machine Learning"},{"key":"5487_CR15","volume-title":"Concept data analysis\u2014theory and applications","author":"C Carpineto","year":"2005","unstructured":"Carpineto, C., & Romano, G. (2005). Concept data analysis\u2014theory and applications. New York: Wiley."},{"key":"5487_CR16","doi-asserted-by":"crossref","unstructured":"Carpineto, C., Michini, C., & Nicolussi, R. (2009). A concept lattice-based kernel for SVM text classification. In: ICFCA 2009, (vol LNAI 5548, pp. 237\u2013250). Berlin: Springer.","DOI":"10.1007\/978-3-642-01815-2_18"},{"key":"5487_CR17","doi-asserted-by":"crossref","first-page":"3:1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., & Boulicaut, J. F. (2009). Closed patterns meet n-ary relations. ACM Transactions on Knowledge Discovery from Data, 3, 3:1\u20133:36.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"issue":"3","key":"5487_CR18","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, K. N., & Boulicaut, J. F. (2013). Closed and noise-tolerant patterns in n-ary relations. Data Mining and Knowledge Discovery, 26(3), 574\u2013619.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5487_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1613\/jair.1648","volume":"24","author":"P Cimiano","year":"2005","unstructured":"Cimiano, P., Hotho, A., & Staab, S. (2005). Learning concept hierarchies from text corpora using formal concept analysis. Journal of Artificial Intelligence Research, 24, 305\u2013339.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5487_CR20","doi-asserted-by":"crossref","unstructured":"Dhillon, I. S. (2001). Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, KDD\u201901, pp. 269\u2013274.","DOI":"10.1145\/502512.502550"},{"issue":"1","key":"5487_CR21","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1093\/toxsci\/kfq233","volume":"118","author":"PA DiMaggio","year":"2010","unstructured":"DiMaggio, P. A., Subramani, A., Judson, R. S., & Floudas, C. A. (2010). A novel framework for predicting in vivo toxicities from in vitro data using optimal methods for dense and sparse matrix reordering and logistic regression. Toxicological Sciences, 118(1), 251\u2013265.","journal-title":"Toxicological Sciences"},{"issue":"5","key":"5487_CR22","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.knosys.2005.11.017","volume":"19","author":"P Boucher-Ryan du","year":"2006","unstructured":"du Boucher-Ryan, P., & Bridge, D. G. (2006). Collaborative recommending using formal concept analysis. Knowledge-Based Systems, 19(5), 309\u2013315.","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"5487_CR23","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0378-8733(95)00274-X","volume":"18","author":"V Duquenne","year":"1996","unstructured":"Duquenne, V. (1996). Lattice analysis and the representation of handicap associations. Social Networks, 18(3), 217\u2013230.","journal-title":"Social Networks"},{"issue":"8","key":"5487_CR24","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1080\/03081079.2012.707451","volume":"41","author":"P Eklund","year":"2012","unstructured":"Eklund, P., Ducrou, J., & Dau, F. (2012). Concept similarity and related categories in information retrieval using Formal Concept Analysis. International Journal of General Systems, 41(8), 826\u2013846.","journal-title":"International Journal of General Systems"},{"key":"5487_CR25","doi-asserted-by":"crossref","unstructured":"Eren, K., Deveci, M., Kucuktunc, O., & Catalyurek, U. V. (2013). A comparative analysis of biclustering algorithms for gene expression data. Briefings in Bioinformatics, 14(3), 279\u2013292.","DOI":"10.1093\/bib\/bbs032"},{"issue":"98","key":"5487_CR26","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M. (1973). Algebraic connectivity of graphs. Czechosloval Mathematical Journal, 23(98), 298\u2013305.","journal-title":"Czechosloval Mathematical Journal"},{"key":"5487_CR27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0378-8733(95)00271-5","volume":"18","author":"LC Freeman","year":"1996","unstructured":"Freeman, L. C. (1996). Cliques, Galois lattices, and the structure of human social groups. Social Networks, 18, 173\u2013187.","journal-title":"Social Networks"},{"key":"5487_CR28","doi-asserted-by":"crossref","unstructured":"Fu, H., Fu, H., Njiwoua, P., & Nguifo, E. M. (2004). A comparative study of FCA-based supervised classification algorithms. In: Proceedings of 2nd International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23\u201326, 2004, pp. 313\u2013320.","DOI":"10.1007\/978-3-540-24651-0_26"},{"key":"5487_CR29","unstructured":"Ganter, B. (1987). Algorithmen zur formalen begriffsanalyse. In: Ganter B, Wille R, Wolff KE (eds) Beitr\u00e4ge zur Begriffsanalyse, B.I.-Wissenschaftsverlag, Mannheim, pp. 241\u2013254."},{"key":"5487_CR30","doi-asserted-by":"crossref","unstructured":"Ganter, B., & Kuznetsov, S. O. (2003). Hypotheses and version spaces. In: A. de Moor, W. Lex, & B. Ganter (Eds.), ICCS, lecture notes in computer science, Vol. 2746, pp. 83\u201395. Berlin: Springer.","DOI":"10.1007\/978-3-540-45091-7_6"},{"key":"5487_CR31","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. (1999). Formal Concept Analysis: Mathematical foundations (1st ed.). Secaucus, NJ: Springer.","edition":"1"},{"key":"5487_CR32","doi-asserted-by":"crossref","unstructured":"Gao, B., Liu, T. Y., Zheng, X., Cheng, Q. S., & Ma, W. Y. (2005). Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, ACM, New York, NY, KDD \u201905, pp. 41\u201350.","DOI":"10.1145\/1081870.1081879"},{"key":"5487_CR33","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman."},{"issue":"2","key":"5487_CR34","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10994-010-5210-y","volume":"82","author":"E Georgii","year":"2011","unstructured":"Georgii, E., Tsuda, K., & Sch\u00f6lkopf, B. (2011). Multi-way set enumeration in weight tensors. Machine Learning, 82(2), 123\u2013155.","journal-title":"Machine Learning"},{"key":"5487_CR35","doi-asserted-by":"crossref","unstructured":"Gnatyshak, D., Ignatov, D. I., Semenov, A., & Poelmans, J. (2012). Gaining insight in social networks with biclustering and triclustering. In: BIR, Springer, Lecture Notes in Business Information Processing, vol. 128, pp. 162\u2013171.","DOI":"10.1007\/978-3-642-33281-4_13"},{"key":"5487_CR36","unstructured":"Gnatyshak, D., Ignatov, D. I., & Kuznetsov, S. O. (2013). From triadic FCA to triclustering: Experimental comparison of some triclustering algorithms. In: Proceedings of the tenth international conference on concept lattices and their applications, La Rochelle, France, October 15\u201318, 2013, pp. 249\u2013260."},{"key":"5487_CR37","volume-title":"Matrix computations","author":"G Golub","year":"1989","unstructured":"Golub, G., & van Loan, C. (1989). Matrix computations. Baltimore: The John Hopkins University Press."},{"key":"5487_CR38","doi-asserted-by":"crossref","unstructured":"Hanczar, B., & Nadif, M. (2010). Bagging for biclustering: Application to microarray data. In: Machine learning and knowledge discovery in databases, LNCS, Vol. 6321, pp. 490\u2013505. Berlin: Springer.","DOI":"10.1007\/978-3-642-15880-3_37"},{"key":"5487_CR39","unstructured":"Ignatov, D. I., & Kuznetsov, S. O. (2008). Concept-based recommendations for internet advertisement. In Belohlavek, R., Kuznetsov, S.O. (Eds.), Proceedings of the sixth international conference concept lattices and their applications (CLA\u201908), (pp. 157\u2013166). Olomouc: Palacky University."},{"key":"5487_CR40","doi-asserted-by":"crossref","unstructured":"Ignatov, D. I., & Kuznetsov, S. O. (2009). Frequent itemset mining for clustering near duplicate web documents. In Rudolph, S., Dau, F., Kuznetsov, S.O. (Eds.), ICCS, lecture notes in computer science, Vol. 5662, pp. 185\u2013200. Berlin: Springer.","DOI":"10.1007\/978-3-642-03079-6_15"},{"key":"5487_CR41","doi-asserted-by":"crossref","unstructured":"Ignatov, D. I., Kuznetsov, S. O., Magizov, R. A., & Zhukov, L. E. (2011). From triconcepts to triclusters. In Rough sets, fuzzy sets, data mining and granular computing, LNCS, Vol. 6743, pp. 257\u2013264. Berlin: Springer.","DOI":"10.1007\/978-3-642-21881-1_41"},{"key":"5487_CR42","doi-asserted-by":"crossref","unstructured":"Ignatov, D. I., Kuznetsov, S. O., & Poelmans, J. (2012). Concept-based biclustering for internet advertisement. In: IEEE computer society ICDM workshops, pp. 123\u2013130.","DOI":"10.1109\/ICDMW.2012.100"},{"issue":"6","key":"5487_CR43","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1080\/03081079.2013.798899","volume":"42","author":"DI Ignatov","year":"2013","unstructured":"Ignatov, D. I., Kuznetsov, S. O., Poelmans, J., & Zhukov, L. E. (2013). Can triconcepts become triclusters? International Journal of General Systems, 42(6), 572\u2013593.","journal-title":"International Journal of General Systems"},{"key":"5487_CR44","doi-asserted-by":"crossref","unstructured":"Ignatov, D. I., Nenova, E., Konstantinova, N., & Konstantinov, A. V. (2014). Boolean Matrix Factorisation for Collaborative Filtering: An FCA-Based Approach. In Artificial intelligence: Methodology, systems, and applications, LNCS, Vol. 8722, pp. 47\u201358. Berlin: Springer.","DOI":"10.1007\/978-3-319-10554-3_5"},{"key":"5487_CR45","doi-asserted-by":"crossref","unstructured":"J\u00e4schke, R., Hotho, A., Schmitz, C., Ganter, B., & Stumme, G. (2006). TRIAS-an algorithm for mining iceberg tri-lattices. In Proceedings of the sixth international conference on data mining, IEEE computer society, Washington, DC, ICDM \u201906, pp. 907\u2013911.","DOI":"10.1109\/ICDM.2006.162"},{"key":"5487_CR46","unstructured":"Ji, L., Tan, K. L., & Tung, A. K. H. (2006). Mining frequent closed cubes in 3D datasets. In Proceedings of the 32nd international conference on Very large data bases, VLDB \u201906, pp. 811\u2013822."},{"issue":"10","key":"5487_CR47","doi-asserted-by":"crossref","first-page":"1989","DOI":"10.1016\/j.ins.2010.07.007","volume":"181","author":"M Kaytoue","year":"2011","unstructured":"Kaytoue, M., Kuznetsov, S. O., Napoli, A., & Duplessis, S. (2011). Mining gene expression data with pattern structures in formal concept analysis. Information Sciences, 181(10), 1989\u20132001.","journal-title":"Information Sciences"},{"issue":"1\u20132","key":"5487_CR48","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10472-013-9379-1","volume":"70","author":"M Kaytoue","year":"2014","unstructured":"Kaytoue, M., Kuznetsov, S. O., Macko, J., & Napoli, A. (2014). Biclustering meets triadic concept analysis. Annals of Mathematics and Artificial Intelligence, 70(1\u20132), 55\u201379.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"5487_CR49","doi-asserted-by":"crossref","unstructured":"Koester, B. (2006). Conceptual knowledge retrieval with FooCA: Improving web search engine results with contexts and concept hierarchies. In Proceedings on sixth industrial conference on data mining, ICDM 2006, pp. 176\u2013190.","DOI":"10.1007\/11790853_14"},{"key":"5487_CR50","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-642-46808-7_27","volume-title":"Information systems and data analysis, studies in classification, data analysis, and knowledge organization","author":"S Krolak-Schwerdt","year":"1994","unstructured":"Krolak-Schwerdt, S., Orlik, P., & Ganter, B. (1994). Tripat: A model for analyzing three-mode binary data. Information systems and data analysis, studies in classification, data analysis, and knowledge organization (pp. 298\u2013307). Berlin: springer."},{"key":"5487_CR51","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. (2004). Machine learning and Formal Concept Analysis. In Concept lattices, LNCS, Vol. 2961, pp. 287\u2013312. Berlin: Springer.","DOI":"10.1007\/978-3-540-24651-0_25"},{"key":"5487_CR52","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S., & Samokhin, M. (2005). Learning closed sets of labeled graphs for chemical applications. In ILP 2005, LNCS (LNAI), Vol. 3625, pp. 190\u2013208. Berlin: Springer.","DOI":"10.1007\/11536314_12"},{"issue":"2\u20133","key":"5487_CR53","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"SO Kuznetsov","year":"2002","unstructured":"Kuznetsov, S. O., & Obiedkov, S. A. (2002). Comparing performance of algorithms for generating concept lattices. Journal of Experimental & Theoretical Artificial Intelligence, 14(2\u20133), 189\u2013216.","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"issue":"1","key":"5487_CR54","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.socnet.2007.04.006","volume":"30","author":"M Latapy","year":"2008","unstructured":"Latapy, M., Magnien, C., & Vecchio, N. D. (2008). Basic notions for the analysis of large two-mode networks. Social Networks, 30(1), 31\u201348.","journal-title":"Social Networks"},{"key":"5487_CR55","doi-asserted-by":"crossref","unstructured":"Lehmann, F., & Wille, R. (1995). A triadic approach to Formal Concept Analysis. In Proceedings of the third international conference on conceptual structures: Applications implementation and theory (pp. 32\u201343). London: Springer.","DOI":"10.1007\/3-540-60161-9_27"},{"key":"5487_CR56","first-page":"49","volume":"3","author":"A Li","year":"2009","unstructured":"Li, A., & Tuck, D. (2009). An effective tri-clustering algorithm combining expression data with gene regulation information. Gene Regulation and Systems Biology, 3, 49\u201364.","journal-title":"Gene Regulation and Systems Biology"},{"issue":"11","key":"5487_CR57","first-page":"1715","volume":"5","author":"K Liu","year":"2010","unstructured":"Liu, K., Fang, B., & Zhang, W. (2010). Unsupervised tag sense disambiguation in folksonomies. Journal of Computers, 5(11), 1715\u20131722.","journal-title":"Journal of Computers"},{"issue":"1","key":"5487_CR58","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S. C., & Oliveira, A. L. (2004). Biclustering algorithms for biological data analysis: A survey. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 1(1), 24\u201345.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"2","key":"5487_CR59","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00357-001-0046-6","volume":"19","author":"M Meulders","year":"2002","unstructured":"Meulders, M., DeBoeck, P., Kuppens, P., & Van Mechelen, I. (2002). Constrained latent class analysis of three-way three-mode data. Journal of Classification, 19(2), 277.","journal-title":"Journal of Classification"},{"key":"5487_CR60","doi-asserted-by":"crossref","unstructured":"Miettinen, P. (2011). Boolean tensor factorization. In Cook, D., Pei, J., Wang, W., Za\u00efane, O., & Wu, X. (Eds.), ICDM 2011, 11th IEEE international conference on data mining, IEEE computer society (pp. 447\u2013456). Vancouver: CPS.","DOI":"10.1109\/ICDM.2011.28"},{"key":"5487_CR61","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0457-9","volume-title":"Mathematical classification and clustering","author":"B Mirkin","year":"1996","unstructured":"Mirkin, B. (1996). Mathematical classification and clustering. Dordrecht: Kluwer."},{"key":"5487_CR62","doi-asserted-by":"crossref","unstructured":"Mirkin, B. G., & Kramarenko, A. V. (2011). Approximate bicluster and tricluster boxes in the analysis of binary data. In Rough sets, fuzzy sets, data mining and granular computing, LNCS, Vol. 6743, (pp. 248\u2013256). Berlin: Springer.","DOI":"10.1007\/978-3-642-21881-1_40"},{"key":"5487_CR63","doi-asserted-by":"crossref","unstructured":"Nanopoulos, A., Gabriel, H. H., & Spiliopoulou, M. (2009). Spectral clustering in social-tagging systems. In Vossen, G., Long, D.D.E., Yu, J.X. (Eds.), WISE, Springer, lecture notes in computer science, Vol. 5802, (pp. 87\u2013100).","DOI":"10.1007\/978-3-642-04409-0_15"},{"issue":"2","key":"5487_CR64","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1109\/TASL.2009.2033973","volume":"18","author":"A Nanopoulos","year":"2010","unstructured":"Nanopoulos, A., Rafailidis, D., Symeonidis, P., & Manolopoulos, Y. (2010). Musicbox: Personalized music recommendation based on cubic analysis of social tags. IEEE Transactions on Audio, Speech & Language Processing, 18(2), 407\u2013412.","journal-title":"IEEE Transactions on Audio, Speech & Language Processing"},{"key":"5487_CR65","doi-asserted-by":"crossref","unstructured":"Outrata, J. (2010). Boolean factor analysis for data preprocessing in machine learning. In The ninth international conference on machine learning and applications, ICMLA 2010, 12\u201314 December 2010, (pp. 899\u2013902). Washington, DC.","DOI":"10.1109\/ICMLA.2010.141"},{"issue":"1","key":"5487_CR66","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1), 25\u201346.","journal-title":"Information Systems"},{"key":"5487_CR67","doi-asserted-by":"crossref","unstructured":"Poelmans, J., Ignatov, D. I., Viaene, S., Dedene, G., Kuznetsov, S. O. (2012). Text mining scientific papers: A survey on FCA-based information retrieval research. In Perner, P. (Ed.), ICDM, lecture notes in computer science, Vol. 7377 (pp. 273\u2013287). Berlin: Springer.","DOI":"10.1007\/978-3-642-31488-9_22"},{"issue":"16","key":"5487_CR68","doi-asserted-by":"crossref","first-page":"6538","DOI":"10.1016\/j.eswa.2013.05.009","volume":"40","author":"J Poelmans","year":"2013","unstructured":"Poelmans, J., Ignatov, D. I., Kuznetsov, S. O., & Dedene, G. (2013a). Formal Concept Analysis in knowledge processing: A survey on applications. Expert Systems with Applications, 40(16), 6538\u20136560.","journal-title":"Expert Systems with Applications"},{"issue":"16","key":"5487_CR69","doi-asserted-by":"crossref","first-page":"6601","DOI":"10.1016\/j.eswa.2013.05.007","volume":"40","author":"J Poelmans","year":"2013","unstructured":"Poelmans, J., Kuznetsov, S. O., Ignatov, D. I., & Dedene, G. (2013b). Formal Concept Analysis in knowledge processing: A survey on models and techniques. Expert Systems with Applications, 40(16), 6601\u20136623.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"5487_CR70","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1142\/S0129054108005735","volume":"19","author":"C Roth","year":"2008","unstructured":"Roth, C., Obiedkov, S. A., & Kourie, D. G. (2008). On succinct representation of knowledge community taxonomies with Formal Concept Analysis. International Journal of Foundations of Computer Science, 19(2), 383\u2013404.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"5487_CR71","doi-asserted-by":"crossref","unstructured":"Rudolph, S. (2007). Using FCA for encoding closure operators into neural networks. In Proceedings on 15th international conference on conceptual structures, ICCS 2007, July 22\u201327, 2007 (pp. 321\u2013332). Sheffield.","DOI":"10.1007\/978-3-540-73681-3_24"},{"issue":"8","key":"5487_CR72","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888\u2013905.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"5487_CR73","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1007\/s10618-013-0319-9","volume":"28","author":"E Spyropoulou","year":"2014","unstructured":"Spyropoulou, E., De Bie, T., & Boley, M. (2014). Interesting pattern mining in multi-relational data. Data Mining and Knowledge Discovery, 28(3), 808\u2013849.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"5487_CR74","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10791-007-9038-4","volume":"11","author":"P Symeonidis","year":"2008","unstructured":"Symeonidis, P., Nanopoulos, A., Papadopoulos, A. N., & Manolopoulos, Y. (2008). Nearest-biclusters collaborative filtering based on constant and coherent values. Information Retrieval, 11(1), 51\u201375.","journal-title":"Information Retrieval"},{"issue":"6","key":"5487_CR75","doi-asserted-by":"crossref","first-page":"e116","DOI":"10.1371\/journal.pcbi.0030116","volume":"3","author":"AL Tarca","year":"2007","unstructured":"Tarca, A. L., Carey, V. J., wen Chen, X., Romero, R., & Dr\u01ceghici, S. (2007). Machine learning and its applications to biology. PLOS Computational Biology, 3(6), e116.","journal-title":"PLOS Computational Biology"},{"key":"5487_CR76","unstructured":"Tsopz\u00e9, N., Nguifo, E. M., & Tindo, G. (2007). CLANN: Concept lattice-based artificial neural network for supervised classification. In Proceedings of the 5th international conference on concept lattices and their applications, CLA 2007."},{"issue":"1","key":"5487_CR77","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.inffus.2004.04.003","volume":"6","author":"A Tsymbal","year":"2005","unstructured":"Tsymbal, A., Pechenizkiy, M., & Cunningham, P. (2005). Diversity in search strategies for ensemble feature selection. Information Fusion, 6(1), 83\u201398.","journal-title":"Information Fusion"},{"issue":"3","key":"5487_CR78","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L. G. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3), 410\u2013421.","journal-title":"SIAM Journal on Computing"},{"key":"5487_CR79","unstructured":"Vander Wal, T. (2007). Folksonomy coinage and definition. http:\/\/vanderwal.net\/folksonomy.html . Accessed on 12 03 2012."},{"issue":"4","key":"5487_CR80","first-page":"449","volume":"25","author":"M Visani","year":"2011","unstructured":"Visani, M., Bertet, K., & Ogier, J. (2011). Navigala: An original symbol classifier based on navigation through a Galois lattice. IJPRAI, 25(4), 449\u2013473.","journal-title":"IJPRAI"},{"issue":"3","key":"5487_CR81","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1021252203599","volume":"19","author":"G Voutsadakis","year":"2002","unstructured":"Voutsadakis, G. (2002). Polyadic concept analysis. Order, 19(3), 295\u2013304.","journal-title":"Order"},{"key":"5487_CR82","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01108624","volume":"12","author":"R Wille","year":"1995","unstructured":"Wille, R. (1995). The basic theorem of Triadic Concept Analysis. Order, 12, 149\u2013158.","journal-title":"Order"},{"key":"5487_CR83","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M. J. (2001). Spade: An efficient algorithm for mining frequent sequences. Machine Learning, 42, 31\u201360.","journal-title":"Machine Learning"},{"issue":"1\u20132","key":"5487_CR84","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10994-006-5832-2","volume":"62","author":"MJ Zaki","year":"2006","unstructured":"Zaki, M. J., & Aggarwal, C. C. (2006). Xrules: An effective algorithm for structural classification of XML data. Machine Learning, 62(1\u20132), 137\u2013170.","journal-title":"Machine Learning"},{"issue":"4","key":"5487_CR85","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M. J., & Hsiao, C. (2005). Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering, 17(4), 462\u2013478.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5487_CR86","doi-asserted-by":"crossref","unstructured":"Zhao, L., & Zaki, M. J. (2005). Tricluster: An effective algorithm for mining coherent clusters in 3D microarray data. In \u00d6zcan, F. (Ed.), SIGMOD Conference, (pp. 694\u2013705). New York: ACM.","DOI":"10.1145\/1066157.1066236"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5487-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-015-5487-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5487-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T05:21:16Z","timestamp":1598851276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-015-5487-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,1]]},"references-count":86,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["5487"],"URL":"https:\/\/doi.org\/10.1007\/s10994-015-5487-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,1]]}}}