Sciweavers

873 search results - page 22 / 175
» Reducing the Frequent Pattern Set
Sort
View
JIIS
2010
106views more  JIIS 2010»
13 years 2 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...
IS
2008
13 years 7 months ago
Efficient mining of frequent episodes from complex sequences
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
Kuo-Yu Huang, Chia-Hui Chang
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 2 months 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
WWW
2006
ACM
14 years 8 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
NPL
2006
90views more  NPL 2006»
13 years 7 months ago
Hierarchical Incremental Class Learning with Reduced Pattern Training
Hierarchical Incremental Class Learning (HICL) is a new task decomposition method that addresses the pattern classification problem. HICL is proven to be a good classifier but clos...
Sheng Uei Guan, Chunyu Bao, Ru-Tian Sun