中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/32042
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41769182      Online Users : 3260
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/32042


    Title: PROWL: An efficient frequent continuity mining algorithm on event sequences
    Authors: Huang,KY;Chang,CH;Lin,KZ
    Contributors: 資訊工程研究所
    Date: 2004
    Issue Date: 2010-07-06 18:17:16 (UTC+8)
    Publisher: 中央大學
    Abstract: Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra- transaction association, which consider only relationship among the item in the same
    Relation: DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS
    Appears in Collections:[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML392View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明