Sciweavers

873 search results - page 8 / 175
» Reducing the Frequent Pattern Set
Sort
View
BMCBI
2008
126views more  BMCBI 2008»
13 years 8 months ago
c-REDUCE: Incorporating sequence conservation to detect motifs that correlate with expression
Background: Computational methods for characterizing novel transcription factor binding sites search for sequence patterns or "motifs" that appear repeatedly in genomic ...
Katerina Kechris, Hao Li
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
14 years 24 days ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 2 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
FIMI
2003
170views Data Mining» more  FIMI 2003»
13 years 9 months ago
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
Salvatore Orlando, Claudio Lucchese, Paolo Palmeri...
IDEAL
2003
Springer
14 years 1 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo