Download now Free registration required
One of the important problems in data mining is discovering association rules from spatial gene expression data where each transaction consists of a set of genes and probe patterns. The most time consuming operation in this association rule discovery process is the computation of the frequency of the occurrences of interesting subset of genes (Called candidates) in the database of spatial gene expression data. A fast algorithm has been proposed for generating frequent itemsets without generating candidate itemsets along with strong association rules.
- Format: PDF
- Size: 589.11 KB