Using transposition for pattern discovery from microarray data
François Rioult, Jean‐François Boulicaut, Bruno Crémilleux et al. · 2003
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biological situations (the lines) and given genes (columns). The frequent itemset (sets of columns) extraction technique enables to process difficult cases (millions of lines, hundreds of columns) provided that data is not too dense. However, expression matrices can be dense and have generally only few lines w.r.t. the number of columns. Known algorithms, including the recent algorithms that compute the so-called condensed representations can fail. Thanks to the properties of Galois connections, we propose an original technique that processes the transposed matrices while computing the sets of genes. We validate the potential of this framework by looking for the closed sets in two microarray data sets.
Cited by 54 works. doi:10.1145/882082.882099
Authors
References
- Fast discovery of association rules
- Generalization as search
- Efficiently mining long patterns from databases
- RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
- Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
- Levelwise Search and Borders of Theories in Knowledge Discovery
- CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
- Generating non-redundant association rules
- Efficient mining of association rules using closed itemset lattices
- INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES