Sciweavers

78 search results - page 2 / 16
» BIDE: Efficient Mining of Frequent Closed Sequences
Sort
View
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 13 days ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
ICDM
2010
IEEE
201views Data Mining» more  ICDM 2010»
13 years 4 months ago
Mining Closed Strict Episodes
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...
Nikolaj Tatti, Boris Cule
DIS
2007
Springer
13 years 10 months ago
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
Andrea Pietracaprina, Fabio Vandin
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 7 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
IEAAIE
2009
Springer
14 years 24 days ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...