Approximate Frequent Pattern Discovery Over Data Stream

被引：0

作者：

Kerdprasop, Kittisak ^{[1
]}

Kerdprasop, Nittaya ^{[1
]}

机构：

[1] Suranaree Univ Technol, DEKD Res Unit, Sch Comp Engn, 111 Univ Ave, Nakhon Ratchasima 30000, Thailand

来源：

PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 26, PARTS 1 AND 2, DECEMBER 2007 | 2007年 / 26卷

关键词：

Frequent pattern discovery; Approximate algorithm; Data stream analysis;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Frequent pattern discovery over data stream is a hard problem because a continuously generated nature of stream does not allow a revisit on each data element. Furthermore, pattern discovery process must be fast to produce timely. results. Based on these requirements, we propose an approximate approach to tackle the problem of discovering frequent patterns over continuous stream. Our approximation algorithm is intended to be applied to process a stream prior to the pattern discovery process. The results of approximate frequent pattern discovery have been reported in the paper.

引用

下载

页码：478 / +

页数：2

共 50 条

[31] A novel frequent pattern mining technique for prediction of user behavior on web stream data
Dhanalakshmi P.
Ingenierie des Systemes d'Information, 2019, 24 (01): : 51 - 56
[32] Efficient algorithm for frequent pattern mining over uncertain data streams
Du, Congqiang
Shao, Zengzhen
Journal of Computational Information Systems, 2015, 11 (21): : 7799 - 7808
[33] A New Adaptive Algorithm for Frequent Pattern Mining over Data Streams
Deypir, Mahmood
Sadreddini, Mohammad Hadi
2011 1ST INTERNATIONAL ECONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), 2011, : 230 - 235
[34] Graseq: A novel approximate mining approach of sequential patterns over data stream
School of Information, Renmin University, Beijing
100872, China
Lect. Notes Comput. Sci., 2007, (401-411):
[35] Dynamically computing approximate frequency counts in sliding window over data stream
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
Wuhan Univ J Nat Sci, 2006, 1 (283-288):
[36] Dynamically Computing Approximate Frequency Counts in Sliding Window over Data Stream
NIE Guo-liang
Wuhan University Journal of Natural Sciences, 2006, (01) : 283 - 288
[37] GraSeq: A novel approximate mining approach of sequential patterns over data stream
Li, Haifeng
Chen, Hong
ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2007, 4632 : 401 - +
[38] On finding frequent elements in a data stream
Charikar, Moses
Chen, Kevin
Farach-Colton, Martin
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 584 - +
[39] Frequent events and epochs in data stream
Cabaj, Krzysztof
ROUGH SETS AND INTELLIGENT SYSTEMS PARADIGMS, PROCEEDINGS, 2007, 4585 : 475 - 484
[40] Parallel Frequent Pattern Discovery: Challenges and Methodology
Zhang, Yuzhou
Wang, Jianyong
Zhou, Lizhu
Tsinghua Science and Technology, 2007, 12 (06) : 719 - 728

← 1 2 3 4 5 →