Mining Frequent Episodes on Data Streams

碩士 === 銘傳大學 === 資訊工程學系碩士班 === 97 === Data mining is a useful technique for data analysis, One of kind is mining frequent episodes in sequences. Users can predict event by mining frequent episodes in the future. They use level-wise in traditional methods, for example, candidate episodes are generated...

Full description

Bibliographic Details
Main Authors: Chia-Chang Nien, 粘嘉菖
Other Authors: Show-Jan Yen
Format: Others
Language:zh-TW
Published: 2009
Online Access:http://ndltd.ncl.edu.tw/handle/03264312408289986161
id ndltd-TW-097MCU05392012
record_format oai_dc
spelling ndltd-TW-097MCU053920122017-05-14T04:31:27Z http://ndltd.ncl.edu.tw/handle/03264312408289986161 Mining Frequent Episodes on Data Streams 在資料串流中探勘頻繁情節 Chia-Chang Nien 粘嘉菖 碩士 銘傳大學 資訊工程學系碩士班 97 Data mining is a useful technique for data analysis, One of kind is mining frequent episodes in sequences. Users can predict event by mining frequent episodes in the future. They use level-wise in traditional methods, for example, candidate episodes are generated firstly, and we will find the frequent episodes by mining sequences. They spend a lot of time on scanning sequences and searching candidate episodes. In addition, data add with time in sequences continuously, it is called data streams. They consume time in scanning sequence. Data streams can be use in many applications, such as Intrusion Detection, web log, and meteorology. Users need to know the result immediately, but they must mining sequence by using previous methods again. For this reason, in this paper, we propose a method that they can only mining for additional data on data stream. They do not need to scan sequences and search candidate episodes, and only update frequent episodes. Show-Jan Yen 顏秀珍 2009 學位論文 ; thesis 37 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 銘傳大學 === 資訊工程學系碩士班 === 97 === Data mining is a useful technique for data analysis, One of kind is mining frequent episodes in sequences. Users can predict event by mining frequent episodes in the future. They use level-wise in traditional methods, for example, candidate episodes are generated firstly, and we will find the frequent episodes by mining sequences. They spend a lot of time on scanning sequences and searching candidate episodes. In addition, data add with time in sequences continuously, it is called data streams. They consume time in scanning sequence. Data streams can be use in many applications, such as Intrusion Detection, web log, and meteorology. Users need to know the result immediately, but they must mining sequence by using previous methods again. For this reason, in this paper, we propose a method that they can only mining for additional data on data stream. They do not need to scan sequences and search candidate episodes, and only update frequent episodes.
author2 Show-Jan Yen
author_facet Show-Jan Yen
Chia-Chang Nien
粘嘉菖
author Chia-Chang Nien
粘嘉菖
spellingShingle Chia-Chang Nien
粘嘉菖
Mining Frequent Episodes on Data Streams
author_sort Chia-Chang Nien
title Mining Frequent Episodes on Data Streams
title_short Mining Frequent Episodes on Data Streams
title_full Mining Frequent Episodes on Data Streams
title_fullStr Mining Frequent Episodes on Data Streams
title_full_unstemmed Mining Frequent Episodes on Data Streams
title_sort mining frequent episodes on data streams
publishDate 2009
url http://ndltd.ncl.edu.tw/handle/03264312408289986161
work_keys_str_mv AT chiachangnien miningfrequentepisodesondatastreams
AT zhānjiāchāng miningfrequentepisodesondatastreams
AT chiachangnien zàizīliàochuànliúzhōngtànkānpínfánqíngjié
AT zhānjiāchāng zàizīliàochuànliúzhōngtànkānpínfánqíngjié
_version_ 1718448359872659456