Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling

Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. We 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. Our main focus on mining the simplest expressions (the minimal generators), but we also 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 our approach.

• Type: Journal
• Year: 2010
• Where: IJKDB
• Authors: Mohammed Javeed Zaki, Naren Ramakrishnan, Lizhuang Zhao
• Keywords: Arbitrary Boolean Expressions, Boolean Expressions, Frequent Boolean Expressions, IJKDB 2010