BLOSOM

A framework for mining arbitrary boolean expressions

Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishnan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

We introduce a novel framework, called BLOSOM, for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. We focus on mining the simplest expressions (the minimal generators) for each class. We also propose a closure operator for each class that yields closed boolean expressions. BLOSOM efficiently mines frequent boolean expressions by utilizing a number of methodical pruning techniques. Experiments showcase the behavior of BLOSOM, and an application study on a real dataset is also given.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Pages827-832
Number of pages6
Volume2006
Publication statusPublished - 16 Oct 2006
Externally publishedYes
EventKDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - Philadelphia, PA, United States
Duration: 20 Aug 200623 Aug 2006

Other

OtherKDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
CountryUnited States
CityPhiladelphia, PA
Period20/8/0623/8/06

Fingerprint

Experiments

Keywords

  • Boolean Expression
  • Closed Itemsets
  • Data Mining
  • Minimal Generator

ASJC Scopus subject areas

  • Information Systems

Cite this

Zhao, L., Zaki, M. J., & Ramakrishnan, N. (2006). BLOSOM: A framework for mining arbitrary boolean expressions. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Vol. 2006, pp. 827-832)

BLOSOM : A framework for mining arbitrary boolean expressions. / Zhao, Lizhuang; Zaki, Mohammed J.; Ramakrishnan, Naren.

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Vol. 2006 2006. p. 827-832.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhao, L, Zaki, MJ & Ramakrishnan, N 2006, BLOSOM: A framework for mining arbitrary boolean expressions. in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. vol. 2006, pp. 827-832, KDD 2006: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, United States, 20/8/06.
Zhao L, Zaki MJ, Ramakrishnan N. BLOSOM: A framework for mining arbitrary boolean expressions. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Vol. 2006. 2006. p. 827-832
Zhao, Lizhuang ; Zaki, Mohammed J. ; Ramakrishnan, Naren. / BLOSOM : A framework for mining arbitrary boolean expressions. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Vol. 2006 2006. pp. 827-832
@inproceedings{3bfa4708e0274012b4bd78fd323ef192,
title = "BLOSOM: A framework for mining arbitrary boolean expressions",
abstract = "We introduce a novel framework, called BLOSOM, for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. We focus on mining the simplest expressions (the minimal generators) for each class. We also propose a closure operator for each class that yields closed boolean expressions. BLOSOM efficiently mines frequent boolean expressions by utilizing a number of methodical pruning techniques. Experiments showcase the behavior of BLOSOM, and an application study on a real dataset is also given.",
keywords = "Boolean Expression, Closed Itemsets, Data Mining, Minimal Generator",
author = "Lizhuang Zhao and Zaki, {Mohammed J.} and Naren Ramakrishnan",
year = "2006",
month = "10",
day = "16",
language = "English",
isbn = "1595933395",
volume = "2006",
pages = "827--832",
booktitle = "Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",

}

TY - GEN

T1 - BLOSOM

T2 - A framework for mining arbitrary boolean expressions

AU - Zhao, Lizhuang

AU - Zaki, Mohammed J.

AU - Ramakrishnan, Naren

PY - 2006/10/16

Y1 - 2006/10/16

N2 - We introduce a novel framework, called BLOSOM, for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. We focus on mining the simplest expressions (the minimal generators) for each class. We also propose a closure operator for each class that yields closed boolean expressions. BLOSOM efficiently mines frequent boolean expressions by utilizing a number of methodical pruning techniques. Experiments showcase the behavior of BLOSOM, and an application study on a real dataset is also given.

AB - We introduce a novel framework, called BLOSOM, for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: pure conjunctions, pure disjunctions, conjunction of disjunctions, and disjunction of conjunctions. We focus on mining the simplest expressions (the minimal generators) for each class. We also propose a closure operator for each class that yields closed boolean expressions. BLOSOM efficiently mines frequent boolean expressions by utilizing a number of methodical pruning techniques. Experiments showcase the behavior of BLOSOM, and an application study on a real dataset is also given.

KW - Boolean Expression

KW - Closed Itemsets

KW - Data Mining

KW - Minimal Generator

UR - http://www.scopus.com/inward/record.url?scp=33749571956&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749571956&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1595933395

SN - 9781595933393

VL - 2006

SP - 827

EP - 832

BT - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

ER -