Constraint-based concept mining and its application to microarray data analysis
Jérémy Besson, Céline Robardet, Jean‐François Boulicaut et al. · Intelligent Data Analysis · 2005
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets, i.e., sets of objects (or transactions) and associated sets of attributes (or items). It improves the state of the art in many application domai
Cited by 104 works. doi:10.3233/ida-2005-9105
Authors
References
- Cluster analysis and display of genome-wide expression patterns
- Mining association rules between sets of items in large databases
- Exploring the Metabolic and Genetic Control of Gene Expression on a Genomic Scale
- Fast discovery of association rules
- RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
- Exploratory mining and pruning optimizations of constrained associations rules
- CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
- CHARM: An Efficient Algorithm for Closed Itemset Mining
- Cluster analysis for gene expression data: a survey
- Efficient mining of association rules using closed itemset lattices