Sciweavers

302 search results - page 23 / 61
» Efficient frequent pattern mining over data streams
Sort
View
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
15 years 10 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
14 years 9 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
15 years 4 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
ICMCS
2006
IEEE
344views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Pattern Mining in Visual Concept Streams
Pattern mining algorithms are often much easier applied than quantitatively assessed. In this paper we address the pattern evaluation problem by looking at both the capability of ...
Lexing Xie, Shih-Fu Chang
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
15 years 3 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