Name
Abstract | ||
|---|---|---|
The existing pattern analysis algorithms in data streams environment have only focused on studying performance improvement and effective memory usage. But when new data streams come, existing pattern analysis algorithms have to analyze patterns again and have to regenerate pattern tree. This approach needs many calculations in real time environments having real time pattern analysis needs. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. The proposed method analyzes patterns first, and then after obtains real time patterns by updating previously analyzed patterns. The patterns form a pattern tree, and freshly created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree and old patterns in the tree are deleted easily using FIFO method. The advantage of our algorithm is proved by performance comparison with existing methods, MILE, with a condition that pattern is changed continuously. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72909-9_9 | ADVANCES IN WEB AND NETWORK TECHNOLOGIES, AND INFORMATION MANAGEMENT, PROCEEDINGS |
Keywords | Field | DocType |
real time,pattern analysis | Mile,Time patterns,Data mining,Data stream mining,FIFO (computing and electronics),Data stream,Computer science,Pattern analysis,Performance improvement,Hash table | Conference |
Volume | ISSN | Citations |
4537 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ho-Seok Kim | 1 | 0 | 1.35 |
| Jae-jyn Shin | 2 | 0 | 0.34 |
| Yongil Jang | 3 | 5 | 2.45 |
| Gyoung-Bae Kim | 4 | 14 | 5.11 |
| Hae-Young Bae | 5 | 78 | 31.47 |