Combining subgroup discovery and permutation testing to reduce reduncancy

Authors:
Jeroen S. De Bruin;Joost N. Kok
Affiliations:
LIACS, Leiden University, Leiden, The Netherlands and LUMC, Biomolecular Mass Spectrometry unit, Department of Parasitology, Einthovenweg, Leiden, The Netherlands;LIACS, Leiden University, Leiden, The Netherlands
Venue:
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Year:
2010

Citing 6
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Automated genome annotation and pathway identification using the KEGG Orthology (KO) as a controlled vocabulary

Bioinformatics
PAGE: phase-shifted analysis of gene expression

Bioinformatics
SEGS: Search for enriched gene sets in microarray data

Journal of Biomedical Informatics
Relational subgroup discovery for descriptive analysis of microarray data

CompLife'06 Proceedings of the Second international conference on Computational Life Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scientific workflows are becoming more popular in the research community, due to their ease of creation and use, and because of the benefits of repeatability of such workflows. In this paper we investigate the benefits of workflows in a genomics experiment which requires intensive computing as well as parallelization, and show that substantial optimizations in rule redundancy reduction can be achieved by simple workflow parallelization.