Sciweavers

13 search results - page 1 / 3
» BLOSOM: a framework for mining arbitrary boolean expressions
Sort
View
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 5 months ago
BLOSOM: a framework for mining arbitrary boolean expressions
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishna...
IJKDB
2010
141views more  IJKDB 2010»
13 years 2 months ago
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 framew...
Mohammed Javeed Zaki, Naren Ramakrishnan, Lizhuang...
TCS
2008
13 years 4 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
12 years 7 months ago
Multidimensional Association Rules in Boolean Tensors
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, J...
DAWAK
2001
Springer
13 years 9 months ago
A Theoretical Framework for Association Mining Based on the Boolean Retrieval Model
Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining is one of the important...
Peter Bollmann-Sdorra, Aladdin Hafez, Vijay V. Rag...