{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:51:39Z","timestamp":1761598299415,"version":"build-2065373602"},"reference-count":68,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1016\/j.engappai.2020.104147","type":"journal-article","created":{"date-parts":[[2021,1,23]],"date-time":"2021-01-23T17:12:15Z","timestamp":1611421935000},"page":"104147","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Scalability achievements for enumerative biclustering with online partitioning: Case studies involving mixed-attribute datasets"],"prefix":"10.1016","volume":"100","author":[{"given":"Rosana","family":"Veroneze","sequence":"first","affiliation":[]},{"given":"Fernando J.","family":"Von Zuben","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.engappai.2020.104147_b1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A., 1993. Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216.","DOI":"10.1145\/170035.170072"},{"key":"10.1016\/j.engappai.2020.104147_b2","unstructured":"Agrawal, R., Srikant, R., et al., 1994. Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, vol. 1215, pp. 487\u2013499."},{"key":"10.1016\/j.engappai.2020.104147_b3","unstructured":"Andrews, S., 2009. In-Close, a fast algorithm for computing formal concepts. In: International Conference on Conceptual Structures."},{"key":"10.1016\/j.engappai.2020.104147_b4","doi-asserted-by":"crossref","unstructured":"Andrews, S., 2011. In-Close2, a high performance formal concept miner. In: International Conference on Conceptual Structures, pp. 50\u201362.","DOI":"10.1007\/978-3-642-22688-5_4"},{"key":"10.1016\/j.engappai.2020.104147_b5","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.ins.2014.10.011","article-title":"A \u2018best-of-breed\u2019approach for designing a fast algorithm for computing fixpoints of galois connections","volume":"295","author":"Andrews","year":"2015","journal-title":"Inform. Sci."},{"key":"10.1016\/j.engappai.2020.104147_b6","series-title":"International Conference on Formal Concept Analysis","first-page":"56","article-title":"Making use of empty intersections to improve the performance of CbO-type algorithms","author":"Andrews","year":"2017"},{"key":"10.1016\/j.engappai.2020.104147_b7","unstructured":"Andrews, S., 2018. A new method for inheriting canonicity test failures in Close-by-One type algorithms. In: The 14th International Conference on Concept Lattices and their Applications."},{"issue":"1\u20132","key":"10.1016\/j.engappai.2020.104147_b8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10472-014-9400-3","article-title":"Characterizing functional dependencies in formal concept analysis with pattern structures","volume":"72","author":"Baixeries","year":"2014","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.engappai.2020.104147_b9","first-page":"1","article-title":"Detecting counterfeit products by means of frequent pattern mining","author":"Benatia","year":"2020","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"key":"10.1016\/j.engappai.2020.104147_b10","series-title":"Knowledge Discovery in Inductive Databases","first-page":"11","article-title":"Mining bi-sets in numerical data","author":"Besson","year":"2007"},{"year":"2004","series-title":"Concept Data Analysis: Theory and Applications","author":"Carpineto","key":"10.1016\/j.engappai.2020.104147_b11"},{"issue":"2","key":"10.1016\/j.engappai.2020.104147_b12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1132956.1132958","article-title":"Association mining","volume":"38","author":"Ceglar","year":"2006","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.engappai.2020.104147_b13","first-page":"1","article-title":"Attribute reduction in formal decision contexts and its application to finite topological spaces","author":"Chen","year":"2020","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10.1016\/j.engappai.2020.104147_b14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.eswa.2018.07.051","article-title":"Emerging topic detection in twitter stream based on high utility pattern mining","volume":"115","author":"Choi","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2020.104147_b15","unstructured":"Codocedo, V., Napoli, A., 2014a. Bicluster enumeration using formal concept analysis. In: What Formal Concept Analysis Can Do for Artificial Intelligence?(FCA4AI 2014) Workshop At ECAI 2014."},{"key":"10.1016\/j.engappai.2020.104147_b16","series-title":"ECAI 2014: 21st European Conference on Artificial Intelligence, vol. 263","first-page":"213","article-title":"Lattice-based biclustering using partition pattern structures","author":"Codocedo","year":"2014"},{"year":"2009","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/j.engappai.2020.104147_b17"},{"key":"10.1016\/j.engappai.2020.104147_b18","series-title":"International Conference on Formal Concept Analysis","first-page":"3","article-title":"Elements about exploratory, knowledge-based, hybrid, and explainable knowledge discovery","author":"Couceiro","year":"2019"},{"key":"10.1016\/j.engappai.2020.104147_b19","series-title":"A Guided Tour of Artificial Intelligence Research","first-page":"411","article-title":"Formal concept analysis: From knowledge discovery to knowledge processing","author":"Ferr\u00e9","year":"2020"},{"issue":"5","key":"10.1016\/j.engappai.2020.104147_b20","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1016\/j.patcog.2012.10.022","article-title":"Predicting missing values with biclustering: A coherence-based approach","volume":"46","author":"de\u00a0Fran\u00e7a","year":"2013","journal-title":"Pattern Recognit."},{"year":"1984","series-title":"Two basic algorithms in concept analysis","author":"Ganter","key":"10.1016\/j.engappai.2020.104147_b21"},{"year":"1997","series-title":"Formal Concept Analysis: Mathematical Foundations","author":"Ganter","key":"10.1016\/j.engappai.2020.104147_b22"},{"year":"2011","series-title":"Discovery of Error-tolerant Biclusters from Noisy Gene Expression Data","author":"Gupta","key":"10.1016\/j.engappai.2020.104147_b23"},{"issue":"12","key":"10.1016\/j.engappai.2020.104147_b24","doi-asserted-by":"crossref","first-page":"3941","DOI":"10.1016\/j.patcog.2015.06.018","article-title":"A structured view on pattern mining-based biclustering","volume":"48","author":"Henriques","year":"2015","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.engappai.2020.104147_b25","series-title":"International Conference on Intelligent Tutoring Systems","first-page":"133","article-title":"On the discovery of educational patterns using biclustering","author":"Henriques","year":"2019"},{"issue":"1","key":"10.1016\/j.engappai.2020.104147_b26","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1186\/s13015-014-0027-z","article-title":"BicPAM: PAttern-based biclustering for biomedical data analysis","volume":"9","author":"Henriques","year":"2014","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"10.1016\/j.engappai.2020.104147_b27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1186\/s13015-016-0085-5","article-title":"Bic2pam: constraint-guided biclustering for biological data analysis with domain knowledge","volume":"11","author":"Henriques","year":"2016","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"10.1016\/j.engappai.2020.104147_b28","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/s10618-017-0521-2","article-title":"Bsig: evaluating the statistical significance of biclustering solutions","volume":"32","author":"Henriques","year":"2018","journal-title":"Data Min. Knowl. Discov."},{"issue":"5","key":"10.1016\/j.engappai.2020.104147_b29","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TCBB.2014.2325016","article-title":"Similarity measures for comparing biclusterings","volume":"11","author":"Horta","year":"2014","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"12","key":"10.1016\/j.engappai.2020.104147_b30","doi-asserted-by":"crossref","first-page":"8279","DOI":"10.1007\/s00521-018-3959-2","article-title":"A collaborative filtering recommendation algorithm based on information theory and bi-clustering","volume":"31","author":"Jiang","year":"2019","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.engappai.2020.104147_b31","series-title":"International Conference on Discovery Science","first-page":"51","article-title":"A unified approach to biclustering based on formal concept analysis and interval pattern structure","author":"Juniarta","year":"2019"},{"key":"10.1016\/j.engappai.2020.104147_b32","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.jocs.2017.03.018","article-title":"Nearest biclusters collaborative filtering framework with fusion","volume":"25","author":"Kant","year":"2018","journal-title":"J. Comput. Sci."},{"key":"10.1016\/j.engappai.2020.104147_b33","unstructured":"Kaytoue, M., Codocedo, V., Baixeries, J., Napoli, A., 2014. Three related FCA methods for mining biclusters of similar values on columns. In: Proceedings of the Eleventh International Conference on Concept Lattices and their Applications, Kosice, Slovakia, October 7\u201310, 2014."},{"key":"10.1016\/j.engappai.2020.104147_b34","doi-asserted-by":"crossref","unstructured":"Kaytoue, M., Kuznetsov, S.O., Napoli, A., 2011. Biclustering numerical data in formal concept analysis. In: 9th International Conference on Formal Concept Analysis. pp. 135\u2013150.","DOI":"10.1007\/978-3-642-20514-9_12"},{"issue":"1","key":"10.1016\/j.engappai.2020.104147_b35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-018-28948-z","article-title":"GOATOOLS: A python library for gene ontology analyses","volume":"8","author":"Klopfenstein","year":"2018","journal-title":"Sci. Rep."},{"issue":"3","key":"10.1016\/j.engappai.2020.104147_b36","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1007\/s11280-018-0578-x","article-title":"Copfun: An urban co-occurrence pattern mining scheme based on regional function discovery","volume":"22","author":"Kong","year":"2019","journal-title":"World Wide Web"},{"key":"10.1016\/j.engappai.2020.104147_b37","unstructured":"Krajca, P., Outrata, J., Vychodil, V., 2010. Advances in algorithms based on CbO. In: Proceedings of the 8th International Conference on Concept Lattices and their Applications, vol. 672, pp. 325\u2013337."},{"issue":"2","key":"10.1016\/j.engappai.2020.104147_b38","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1007\/BF02362847","article-title":"Mathematical aspects of concept analysis","volume":"80","author":"Kuznetsov","year":"1996","journal-title":"J. Math. Sci."},{"key":"10.1016\/j.engappai.2020.104147_b39","series-title":"Principles of Data Mining and Knowledge Discovery","first-page":"384","article-title":"Learning of simple conceptual graphs from positive and negative examples","author":"Kuznetsov","year":"1999"},{"key":"10.1016\/j.engappai.2020.104147_b40","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.ins.2018.02.032","article-title":"On interestingness measures of formal concepts","volume":"442","author":"Kuznetsov","year":"2018","journal-title":"Inform. Sci."},{"key":"10.1016\/j.engappai.2020.104147_b41","series-title":"Formal Concept Analysis: Foundations and Applications","first-page":"180","article-title":"Efficient mining of association rules based on formal concept analysis","author":"Lakhal","year":"2005"},{"key":"10.1016\/j.engappai.2020.104147_b42","series-title":"Advances in Neural Information Processing Systems","first-page":"1324","article-title":"Evaluating the statistical significance of biclusters","author":"Lee","year":"2015"},{"year":"1995","series-title":"A Triadic Approach to Formal Concept Analysis","author":"Lehmann","key":"10.1016\/j.engappai.2020.104147_b43"},{"key":"10.1016\/j.engappai.2020.104147_b44","unstructured":"Liu, B., Hsu, W., Ma, Y., 1998. Integrating classification and association rule mining. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining."},{"issue":"6","key":"10.1016\/j.engappai.2020.104147_b45","doi-asserted-by":"crossref","DOI":"10.1002\/widm.1329","article-title":"Frequent itemset mining: A 25 years review","volume":"9","author":"Luna","year":"2019","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl Discov."},{"issue":"1","key":"10.1016\/j.engappai.2020.104147_b46","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCBB.2004.2","article-title":"Biclustering algorithms for biological data analysis: a survey","volume":"1","author":"Madeira","year":"2004","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10.1016\/j.engappai.2020.104147_b47","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.neucom.2013.01.056","article-title":"Selecting the best measures to discover quantitative association rules","volume":"126","author":"Mart\u00ednez-Ballesteros","year":"2014","journal-title":"Neurocomputing"},{"issue":"Feb","key":"10.1016\/j.engappai.2020.104147_b48","first-page":"377","article-title":"Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining","volume":"10","author":"Novak","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.engappai.2020.104147_b49","doi-asserted-by":"crossref","unstructured":"Oliveira, S., Veroneze, R., Von\u00a0Zuben, F.J., 2015. On bicluster aggregation and its benefits for enumerative solutions. In: 11th International Conference on Machine Learning and Data Mining, pp. 135\u2013150.","DOI":"10.1007\/978-3-319-21024-7_18"},{"issue":"1","key":"10.1016\/j.engappai.2020.104147_b50","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","article-title":"Fast algorithm for computing fixpoints of galois connections induced by object-attribute relational data","volume":"185","author":"Outrata","year":"2012","journal-title":"Inform. Sci."},{"key":"10.1016\/j.engappai.2020.104147_b51","doi-asserted-by":"crossref","unstructured":"Pandey, G., Atluri, G., Steinbach, M., Myers, C.L., Kumar, V., 2009. An association analysis approach to biclustering. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 677\u2013686.","DOI":"10.1145\/1557019.1557095"},{"year":"2005","series-title":"Introduction to Data Mining","author":"Pang-Ning","key":"10.1016\/j.engappai.2020.104147_b52"},{"issue":"2","key":"10.1016\/j.engappai.2020.104147_b53","first-page":"1","article-title":"Mining quantitative association rules in large relational tables","volume":"25","author":"Srikant","year":"1996"},{"key":"10.1016\/j.engappai.2020.104147_b54","unstructured":"Uno, T., Kiyomi, M., Arimura, H., 2004. LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Workshop on Frequent Itemset Mining Implementations, vol. 19. p. 30."},{"year":"2018","series-title":"Supervised Descriptive Pattern Mining","author":"Ventura","key":"10.1016\/j.engappai.2020.104147_b55"},{"year":"2016","series-title":"Enumerating all maximal biclusters in numerical datasets","author":"Veroneze","key":"10.1016\/j.engappai.2020.104147_b56"},{"key":"10.1016\/j.engappai.2020.104147_b57","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.ins.2016.10.029","article-title":"Enumerating all maximal biclusters in numerical datasets","volume":"379","author":"Veroneze","year":"2017","journal-title":"Inform. Sci."},{"year":"2017","series-title":"Efficient mining of maximal biclusters in mixed-attribute datasets","author":"Veroneze","key":"10.1016\/j.engappai.2020.104147_b58"},{"year":"2018","series-title":"RIN-close_cvc2: an even more efficient enumerative algorithm for biclustering of numerical datasets","author":"Veroneze","key":"10.1016\/j.engappai.2020.104147_b59"},{"issue":"4","key":"10.1016\/j.engappai.2020.104147_b60","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1093\/bib\/bby014","article-title":"It is time to apply biclustering: a comprehensive review of biclustering applications in biological and biomedical data","volume":"20","author":"Xie","year":"2019","journal-title":"Brief. Bioinform."},{"key":"10.1016\/j.engappai.2020.104147_b61","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Xin, D., 2005. Summarizing itemset patterns: a profile-based approach. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. pp. 314\u2013323.","DOI":"10.1145\/1081870.1081907"},{"key":"10.1016\/j.engappai.2020.104147_b62","doi-asserted-by":"crossref","DOI":"10.1016\/j.elerap.2019.100857","article-title":"Collaborative targeting: Biclustering-based online ad recommendation","volume":"35","author":"Yoldar","year":"2019","journal-title":"Electron. Commer. Res. Appl."},{"key":"10.1016\/j.engappai.2020.104147_b63","series-title":"Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"34","article-title":"Generating non-redundant association rules","author":"Zaki","year":"2000"},{"key":"10.1016\/j.engappai.2020.104147_b64","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J., 2002. CHARM: An efficient algorithm for closed itemset mining. In: Proceedings of the 2002 SIAM International Conference on Data Mining, vol. 2, pp. 457\u2013473.","DOI":"10.1137\/1.9781611972726.27"},{"year":"2014","series-title":"Data Mining and Analysis: Fundamental Concepts and Algorithms","author":"Zaki","key":"10.1016\/j.engappai.2020.104147_b65"},{"issue":"6","key":"10.1016\/j.engappai.2020.104147_b66","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MIS.2005.112","article-title":"Microcluster: Efficient deterministic biclustering of microarray data","volume":"20","author":"Zhao","year":"2005","journal-title":"Intell. Syst."},{"key":"10.1016\/j.engappai.2020.104147_b67","series-title":"Encyclopedia of Database Systems","first-page":"2240","article-title":"Quantitative association rules","author":"Zhu","year":"2009"},{"issue":"3","key":"10.1016\/j.engappai.2020.104147_b68","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10844-013-0297-9","article-title":"Objectively evaluating condensed representations and interestingness measures for frequent itemset mining","volume":"45","author":"Zimmermann","year":"2015","journal-title":"J. Intell. Inf. Syst."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0952197620303845?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0952197620303845?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:14:56Z","timestamp":1760598896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197620303845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":68,"alternative-id":["S0952197620303845"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.engappai.2020.104147","relation":{},"ISSN":["0952-1976"],"issn-type":[{"type":"print","value":"0952-1976"}],"subject":[],"published":{"date-parts":[[2021,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Scalability achievements for enumerative biclustering with online partitioning: Case studies involving mixed-attribute datasets","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.engappai.2020.104147","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104147"}}