In this paper, we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the
โฆ LIBER โฆ
Mining Probabilistically Frequent Sequential Patterns in Large Uncertain Databases
โ Scribed by Zhou Zhao, ; Da Yan, ; Ng, Wilfred
- Book ID
- 121248840
- Publisher
- IEEE
- Year
- 2014
- Tongue
- English
- Weight
- 528 KB
- Volume
- 26
- Category
- Article
- ISSN
- 1041-4347
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Incremental mining of sequential pattern
โ
Florent Masseglia; Pascal Poncelet; Maguelonne Teisseire
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 568 KB
A fast algorithm for mining sequential p
โ
Ning Chen; An Chen; Longxiang Zhou; Lu Liu
๐
Article
๐
2001
๐
Springer
๐
English
โ 875 KB
[ACM Press the 15th International Confer
โ
Zhao, Zhou; Yan, Da; Ng, Wilfred
๐
Article
๐
2012
๐
ACM Press
๐
English
โ 760 KB
[ACM Press the 15th International Confer
โ
Zhao, Zhou; Yan, Da; Ng, Wilfred
๐
Article
๐
2012
๐
ACM Press
๐
English
โ 760 KB
Data uncertainty is inherent in many real-world applications such as environmental surveillance and mobile tracking. As a result, mining sequential patterns from inaccurate data, such as sensor readings and GPS trajectories, is important for discovering hidden knowledge in such applications. Previou
Mining frequent tree-like patterns in la
โ
Tzung-Shi Chen; Shih-Chun Hsu
๐
Article
๐
2007
๐
Elsevier Science
๐
English
โ 566 KB
[IEEE 2013 IEEE International Conference
โ
Li, Yuxuan; Bailey, James; Kulik, Lars; Pei, Jian
๐
Article
๐
2013
๐
IEEE
โ 294 KB