Sciweavers

8 search results - page 2 / 2
» A Survey on Condensed Representations for Frequent Sets
Sort
View
IDA
2002
Springer
13 years 5 months ago
Optimization of association rule mining queries
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
Baptiste Jeudy, Jean-François Boulicaut
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
13 years 10 months ago
Using transposition for pattern discovery from microarray data
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 biol...
François Rioult, Jean-François Bouli...
AIIA
2005
Springer
13 years 11 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut