9 search results - page 2 / 2 » Direct Candidates Generation: A Novel Algorithm for Discover... |
AICCSA
2008
IEEE
13 years 5 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
TKDE
2008
13 years 4 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
HICSS
2003
IEEE
13 years 10 months ago
2003
IEEE
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
BMCBI
2006
13 years 4 months ago
2006
Background: RNA editing is one of several post-transcriptional modifications that may contribute to organismal complexity in the face of limited gene complement in a genome. One f...