政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/69141
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 20 |  全文笔数/总笔数 : 90029/119959 (75%)
造访人次 : 24029329      在线人数 : 275
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/69141


    请使用永久网址来引用或连结此文件: http://nccur.lib.nccu.edu.tw/handle/140.119/69141


    题名: On-line rule matching for event prediction
    作者: 陳良弼
    Cho,Chung-Wen;Wu,Yi-Hung;Yen,Show-Jane;Zheng,Ying;Chen,Arbee L. P.
    贡献者: 資科系
    关键词: Continuous query;Episode rules;Minimal occurrence;Event stream;Prediction
    日期: 2011
    上传时间: 2014-08-21 15:00:51 (UTC+8)
    摘要: The prediction of future events has great importance in many applications. The prediction is based on episode rules which are composed of events and two time constraints which require all the events in the episode rule and in the predicate of the rule to occur in a time interval, respectively. In an event stream, a sequence of events which matches the predicate of the rule satisfying the specified time constraint is called an occurrence of the predicate. After finding the occurrence, the consequent event which will occur in a time interval can be predicted. However, the time intervals computed from some occurrences for predicting the event can be contained in the time intervals computed from other occurrence and become redundant. As a result, how to design an efficient and effective event predictor in a stream environment is challenging. In this paper, an effective scheme is proposed to avoid matching the predicate events corresponding to redundant time intervals for prediction. Based on the scheme, we respectively consider two methodologies, forward retrieval and backward retrieval, for the efficient matching of predicate events over event streams. The approach based on forward retrieval construct a queue structure to incrementally maintain parts of the matched results as events arrive, and thus it avoids backward scans of the event stream. On the other hand, the approach based on backward retrieval maintains the recently arrived events in a tree structure. The matching of predicate events is triggered by identifiable events and achieved by an efficient retrieval on the tree structure, which avoids exhaustive scans of the arrived events. By running a series of experiments, we show that each of the proposed approaches has its advantages on particular data distributions and parameter settings.
    關聯: The VLDB Journal,20(3),303-334
    数据类型: article
    DOI 連結: http://dx.doi.org/10.1007/s00778-010-0197-3
    DOI: 10.1007/s00778-010-0197-3
    显示于类别:[資訊科學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    303-334.pdf1536KbAdobe PDF663检视/开启


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈