1. NCCU Academic Hub
  2. 學術產出
  3. College of Informatics
  4. Periodical Articles
  5. Item

學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Efficient Frequent Sequence Mining by a Dynamic Strategy Switching Algorithm
作者 陳良弼
Chiu, Ding-Ying; Wu,Yi-Hung ;Chen,Arbee L. P.
貢獻者 資科系
關鍵詞 Data mining;Frequent sequence;Sequence comparison;Strategy switching
日期 2009.01
上傳時間 11-Nov-2013 16:28:38 (UTC+8)
摘要 Mining frequent sequences in large databases has been an important research topic. The main challenge of mining frequent sequences is the high processing cost due to the large amount of data. In this paper, we propose a novel strategy to find all the frequent sequences without having to compute the support counts of non-frequent sequences. The previous works prune candidate sequences based on the frequent sequences with shorter lengths, while our strategy prunes candidate sequences according to the non-frequent sequences with the same lengths. As a result, our strategy can cooperate with the previous works to achieve a better performance. We then identify three major strategies used in the previous works and combine them with our strategy into an efficient algorithm. The novelty of our algorithm lies in its ability to dynamically switch from a previous strategy to our new strategy in the mining process for a better performance. Experiment results show that our algorithm outperforms the previous ones under various parameter settings.
關聯 VLDB Journal, 18(1) , 303-327
資料類型 article
DOI http://dx.doi.org/10.1007/s00778-008-0100-7
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) Chiu, Ding-Ying; Wu,Yi-Hung ;Chen,Arbee L. P.-
dc.date (日期) 2009.01en_US
dc.date.accessioned 11-Nov-2013 16:28:38 (UTC+8)-
dc.date.available 11-Nov-2013 16:28:38 (UTC+8)-
dc.date.issued (上傳時間) 11-Nov-2013 16:28:38 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/61586-
dc.description.abstract (摘要) Mining frequent sequences in large databases has been an important research topic. The main challenge of mining frequent sequences is the high processing cost due to the large amount of data. In this paper, we propose a novel strategy to find all the frequent sequences without having to compute the support counts of non-frequent sequences. The previous works prune candidate sequences based on the frequent sequences with shorter lengths, while our strategy prunes candidate sequences according to the non-frequent sequences with the same lengths. As a result, our strategy can cooperate with the previous works to achieve a better performance. We then identify three major strategies used in the previous works and combine them with our strategy into an efficient algorithm. The novelty of our algorithm lies in its ability to dynamically switch from a previous strategy to our new strategy in the mining process for a better performance. Experiment results show that our algorithm outperforms the previous ones under various parameter settings.en_US
dc.format.extent 1428427 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.relation (關聯) VLDB Journal, 18(1) , 303-327en_US
dc.subject (關鍵詞) Data mining;Frequent sequence;Sequence comparison;Strategy switching-
dc.title (題名) Efficient Frequent Sequence Mining by a Dynamic Strategy Switching Algorithmen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1007/s00778-008-0100-7en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1007/s00778-008-0100-7en_US