{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:50:06Z","timestamp":1781110206853,"version":"3.54.1"},"reference-count":30,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7,1]]},"abstract":"<p>Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. In this paper, the authors introduce a novel framework called BLOSOM for mining (frequent) boolean expressions over binary-valued datasets. Boolean expressions can be grouped into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. The authors\u2019 main focus is on mining the simplest expressions (the minimal generators), but also to propose closure operators that yield closed (or unique maximal) boolean expressions. BLOSOM efficiently mines frequent boolean expressions by utilizing a number of methodical pruning techniques. Experiments showcase the behavior of BLOSOM for different input settings and parameter thresholds. Application studies on gene expression and gene regulation patterns showcase the effectiveness of this approach.<\/p>","DOI":"10.4018\/jkdb.2010070105","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T15:20:07Z","timestamp":1297783207000},"page":"68-96","source":"Crossref","is-referenced-by-count":4,"title":["Mining Frequent Boolean Expressions"],"prefix":"10.4018","volume":"1","author":[{"given":"Mohammed J.","family":"Zaki","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naren","family":"Ramakrishnan","sequence":"additional","affiliation":[{"name":"Virginia Tech., USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lizhuang","family":"Zhao","sequence":"additional","affiliation":[{"name":"Microsoft Corp., USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jkdb.2010070105-0","first-page":"307","article-title":"Fast discovery of association rules","author":"R.Agrawal","year":"1996","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"jkdb.2010070105-1","unstructured":"Akutsu, T., Kuhara, S., Maruyama, O., & Miyano, S. (1998). Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms."},{"key":"jkdb.2010070105-2","doi-asserted-by":"crossref","unstructured":"Antonie, M.-L., & Zaiane, O. (2004). Mining positive and negative association rules: An approach for confined rules. In Proceedings of the European PKDD Conf.","DOI":"10.1007\/978-3-540-30116-5_6"},{"key":"jkdb.2010070105-3","first-page":"2","article-title":"Mining frequent patterns with counting inference.","author":"Y.Bastide","year":"2000","journal-title":"SIGKDD Explorations"},{"key":"jkdb.2010070105-4","doi-asserted-by":"crossref","unstructured":"Bayardo, R. J., & Agrawal, R. (1999). Mining the most interesting rules. In Proceedings of the ACM SIGKDD Conf.","DOI":"10.1145\/312129.312219"},{"key":"jkdb.2010070105-5","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1164"},{"key":"jkdb.2010070105-6","doi-asserted-by":"crossref","unstructured":"Calders, T., & Goethals, B. (2003). Minimal k-free representations of frequent sets. In Proceedings of the European PKDD Conf.","DOI":"10.1007\/978-3-540-39804-2_9"},{"key":"jkdb.2010070105-7","doi-asserted-by":"crossref","unstructured":"Calders, T., & Goethals, B. (2005). Quick inclusion-exclusion. In Proceedings of the ECML-PKDD Workshop on Knowl-edge Discovery in Inductive Databases.","DOI":"10.1007\/11733492_6"},{"key":"jkdb.2010070105-8","author":"B. A.Davey","year":"1990","journal-title":"Introduction to lattices and order"},{"key":"jkdb.2010070105-9","doi-asserted-by":"crossref","unstructured":"Dong, G., Jiang, C., Pei, J., Li, J., & Wong, L. (2005). Mining succinct systems of minimal generators of formal concepts. In Proceedings of the Int\u2019l Conf. Database Systems for Advanced Applications.","DOI":"10.1007\/11408079_17"},{"key":"jkdb.2010070105-10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","author":"B.Ganter","year":"1999","journal-title":"Formal concept analysis: Mathematical foundations"},{"key":"jkdb.2010070105-11","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007744"},{"key":"jkdb.2010070105-12","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777945"},{"key":"jkdb.2010070105-13","doi-asserted-by":"crossref","unstructured":"Jaroszewicz, S., & Simovici, D. A. (2002). Support approximations using bonferroni-type inequalities. In Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery.","DOI":"10.1007\/3-540-45681-3_18"},{"key":"jkdb.2010070105-14","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M. (2001). Concise representation of frequent patterns based on disjunction-free generators. In Proceedings of the Int\u2019l Conf. on Data Mining.","DOI":"10.1007\/3-540-47887-6_15"},{"key":"jkdb.2010070105-15","doi-asserted-by":"publisher","DOI":"10.1080\/09528130512331315882"},{"key":"jkdb.2010070105-16","unstructured":"Mannila, H., & Toivonen, H. (1996). Multiple uses of frequent sets and condensed representations. In Proceedings of the International Conference on Knowledge Discovery and Data Mining."},{"key":"jkdb.2010070105-17","unstructured":"Mielikainen, T. (2003). Intersecting data to closed sets with constraints. In Proceedings of the Workshop on Frequent Itemset Mining Implementations."},{"key":"jkdb.2010070105-18","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(82)90040-6"},{"key":"jkdb.2010070105-19","doi-asserted-by":"crossref","unstructured":"Nanavati, A., Chitrapura, K., Joshi, S., & Krishnapuram, R. (2001). Association rule mining: Mining generalised disjunctive association rules. In Proceedings of the ACM CIKM Conf.","DOI":"10.1145\/502585.502666"},{"key":"jkdb.2010070105-20","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In Proceedings of the 7th Intl. Conf. on Database Theory.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"jkdb.2010070105-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(01)00169-4"},{"key":"jkdb.2010070105-22","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, N., Kumar, D., Mishra, B., Potts, M., & Helm, R. (2004). Turning cartwheels: An alternating algorithm for mining redescriptions. In Proceedings of the ACM SIGKDD Conf.","DOI":"10.1145\/1014052.1014083"},{"key":"jkdb.2010070105-23","doi-asserted-by":"crossref","unstructured":"Savasere, A., Omiecinski, E., & Navathe, S. (1998). Mining for strong negative associations in a large database of customer transactions. In Proceedings of the ICDE Conf.","DOI":"10.1109\/ICDE.1998.655812"},{"key":"jkdb.2010070105-24","doi-asserted-by":"crossref","unstructured":"Shima, Y., Mitsuishi, S., Hirata, K., & Harao, M. (2004). Extracting minimal and closed monotone dnf formulas. In Proceedings of the Int\u2019l Conf. on Discovery Science.","DOI":"10.1007\/978-3-540-30214-8_24"},{"key":"jkdb.2010070105-25","doi-asserted-by":"publisher","DOI":"10.1145\/1010614.1010616"},{"key":"jkdb.2010070105-26","unstructured":"Yuan, X., Buckles, B. P., Yuan, Z., & Zhang, J. (2002). Mining negative association rules. In Proceedings of the 7th International Symposium on Computers and Communications."},{"key":"jkdb.2010070105-27","doi-asserted-by":"crossref","unstructured":"Zaki, M., & Ramakrishnan, N. (2005). Reasoning about sets using redescription mining. In Proceedings of the ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining.","DOI":"10.1145\/1081870.1081912"},{"key":"jkdb.2010070105-28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"jkdb.2010070105-29","doi-asserted-by":"crossref","unstructured":"Zhao, L., Zaki, M., & Ramakrishnan, N. (2006). Blosom: A framework for mining arbitrary boolean expressions. In Proceedings of the ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining.","DOI":"10.1145\/1150402.1150511"}],"container-title":["International Journal of Knowledge Discovery in Bioinformatics"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=47097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:19:38Z","timestamp":1654096778000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jkdb.2010070105"}},"subtitle":["Application to Gene Expression and Regulatory Modeling"],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jkdb.2010070105","relation":{},"ISSN":["1947-9115","1947-9123"],"issn-type":[{"value":"1947-9115","type":"print"},{"value":"1947-9123","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}