English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 49199/83642 (59%)
造访人次 : 7093812      在线人数 : 57
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/17387


    题名: Discover Sequential Patterns in Incremental Database
    作者: Lin, Nancy P.;Hao, Wei Hua;Chen, Hung Jen;Chueh, Hao En;Chang, Chung I
    贡献者: 淡江大學資訊工程學系;軍訓室
    关键词: Data mining;Sequential patterns;condensed representations;Maximal sequential patterns
    日期: 2007-11
    上传时间: 2013-06-07 10:47:25 (UTC+8)
    出版者: Braga: North Atlantic University Union
    摘要: The task of sequential pattern mining is to discover the complete set of sequential patterns in a given sequence database with minimum support threshold. But in practice, minimum support some time is defined afterward, or need to be adjusted to discover information that interest to knowledge workers. In the same time, the problem of discover sequential patterns in a incremental database is an essential issue in real world practice of datamining. This paper discusses the issue of maintaining discovered sequential patterns when some information is appended to a sequence database. Many previous works based on Apriori-like approaches are not capable to do so without re-running previously presented algorithms on the whole updated database. We propose a novel algorithm, called DSPID, which takes full advantage of the information obtained from previous mining results to cut down the cost of finding new sequential patterns in an incremental database.
    關聯: International Journal of Computers 4(1), pp.197-201
    DOI: 
    显示于类别:[軍訓室] 期刊論文
    [資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML327检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈