On discovery of maximal con-dent rules without support pruning in microarray data.

Tara Mcintosh, Sanjay Chawla

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Microarray data provides a pcrfcct riposte to the original assumption underlying association rule mining - large but sparse transaction sets. Tn a typical microarray the number of columns (genes) is an order of magnitude larger than the number of rows (experiments). A new family of row enumerated rule mining algorithms have emerged to facilitate mining in dense sets. However, to date, all the algorithms proposed to mine expression relationships alone rely on the support measure to prune the search space. This is a major shortcoming as it results in the pruning of many potentially interesting rules which have low support but high confidence. In this paper we propose the MaxConf algorithm which exploits the weak downward closure of confidence to directly mine for high confidence rules. We also provide a means to evaluate the biological significance of the gene relationships identified. An evaluation of MaxConf with RERTT on the database BIND shows that their recall is 94% and .15% respectively.

Original languageEnglish
Title of host publicationProceedings of the 5th International Workshop on Bioinformatics, BIOKDD 2005
Pages37-45
Number of pages9
DOIs
StatePublished - 2005
Externally publishedYes
Event5th International Workshop on Bioinformatics, BIOKDD 2005 - In Conjunction with 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2005 - Chicago, IL, United States
Duration: Aug 21 2005Aug 21 2005

Publication series

NameProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Conference

Conference5th International Workshop on Bioinformatics, BIOKDD 2005 - In Conjunction with 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2005
Country/TerritoryUnited States
CityChicago, IL
Period08/21/0508/21/05

Keywords

  • Association rules
  • Maximum confidence
  • Microarray
  • Row-enumeration

Fingerprint

Dive into the research topics of 'On discovery of maximal con-dent rules without support pruning in microarray data.'. Together they form a unique fingerprint.

Cite this