Article View/Open
Publication Export
|
|
| No doi shows Citation Infomation |
Related Publications in TAIR
- > Simple Record
- > Full Record
| Field |
Value |
| Title: | Online Mining Changes of Items over Continuous Append-only and Dynamic Data Streams |
| Authors: | Hua-Fu Li;李素瑛;沈錳坤 |
| Keywords: | Data streams, change mining, single-pass algorithm. |
| Date: | 2005-08 |
| Issue Date: | 2008-12-16 16:41:58 (UTC+8) |
| Abstract: | Online mining changes over data streams has been recognized to be an important
task in data mining. Mining changes over data streams is both compelling and challenging. In
this paper, we propose a new, single-pass algorithm, called MFC-append (Mining Frequency
Changes of append-only data streams), for discovering the frequent frequency-changed items,
vibrated frequency changed items, and stable frequency changed items over continuous
append-only data streams. A new summary data structure, called Change-Sketch, is developed
to compute the frequency changes between two continuous data streams as fast as possible.
Moreover, a MFC-append-based algorithm, called MFC-dynamic (Mining Frequency Changes
of dynamic data streams), is proposed to find the frequency changes over dynamic data streams.
Theoretical analysis and experimental results show that our algorithms meet the major
performance requirements, namely single-pass, bounded space requirement, and real-time
computing, in mining data streams. |
| Relation: | Journal of Universal Computer Science, 11(8), 1411-1425 |
| Data Type: | article |
| DCField |
Value |
Language |
| dc.creator (Authors) | Hua-Fu Li;李素瑛;沈錳坤 | en_US |
| dc.date (Date) | 2005-08 | en_US |
| dc.date.accessioned | 2008-12-16 16:41:58 (UTC+8) | - |
| dc.date.available | 2008-12-16 16:41:58 (UTC+8) | - |
| dc.date.issued (Issue Date) | 2008-12-16 16:41:58 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccuir.lib.nccu.edu.tw/handle/140.119/14991 | - |
| dc.description.abstract (Abstract) | Online mining changes over data streams has been recognized to be an important
task in data mining. Mining changes over data streams is both compelling and challenging. In
this paper, we propose a new, single-pass algorithm, called MFC-append (Mining Frequency
Changes of append-only data streams), for discovering the frequent frequency-changed items,
vibrated frequency changed items, and stable frequency changed items over continuous
append-only data streams. A new summary data structure, called Change-Sketch, is developed
to compute the frequency changes between two continuous data streams as fast as possible.
Moreover, a MFC-append-based algorithm, called MFC-dynamic (Mining Frequency Changes
of dynamic data streams), is proposed to find the frequency changes over dynamic data streams.
Theoretical analysis and experimental results show that our algorithms meet the major
performance requirements, namely single-pass, bounded space requirement, and real-time
computing, in mining data streams. | en-US |
| dc.format | application/ | en_US |
| dc.format.extent | 0 bytes | - |
| dc.format.mimetype | application/octet-stream | - |
| dc.language (Language) | en | en_US |
| dc.language (Language) | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (Relation) | Journal of Universal Computer Science, 11(8), 1411-1425 | en_US |
| dc.subject (Keywords) | Data streams, change mining, single-pass algorithm. | en-US |
| dc.title (Title) | Online Mining Changes of Items over Continuous Append-only and Dynamic Data Streams | en_US |
| dc.type (Data Type) | article | en |
(1104)