Frequent 2-Episode Mining with Minimal Occurrences Based on Episode Matrix and Lock State[J]. Chinese Journal of Electronics, 2012, 21(4): 633-635.
Citation: Frequent 2-Episode Mining with Minimal Occurrences Based on Episode Matrix and Lock State[J]. Chinese Journal of Electronics, 2012, 21(4): 633-635.

Frequent 2-Episode Mining with Minimal Occurrences Based on Episode Matrix and Lock State

  • Received Date: 2010-09-01
  • Rev Recd Date: 2012-05-01
  • Publish Date: 2012-10-25
  • Frequent episode mining helps to set up episode rules and predict future events. In frequent episode mining, 2-episode mining plays an important role. The mining methods for 2-episodes determine the global strategies of frequent episode mining. The paper focuses on minimal occurrence based frequent 2-episode mining. For the problems existing in the current methods, a novel frequent 2-episode mining method is proposed with high efficiency based on episode matrix and the lock strategy. It does not need to generate candidate episodes and only scans data once. A series of experiments on real data sets show the advantages of the proposed method at time and space cost.
  • loading
  • E. Wu, Y. Diao and S. Rizvi, “High-performance complexevent processing over streams”, Proc. SIGMOD’06, pp.407-418, 2006.
    A. Demers, et al., “Cayuga: A general purpose event monitoringsystem”, Proc. CIDR’07, pp.412-422, 2007.
    R. Agrawal, T. Imielinski and A. Swami, “Mining associationrules between sets of items in large databases”, Proc. SIGMOD’93, pp.207-216, 1993.
    J.B. Zhao, A.G. Dong and G. Lin, “An algorithm for frequentpattern mining in biological networks”, Acta Electronica Sinica,Vol.38, No.8, pp.1803-1807, 2010. (in Chinese)
    R. Agrawal and R. Srikant, “Mining sequential pattern”, Proc.ICDE’95, pp.3-14, 1995.
    R. Agrawal and R. Srikant, “Fast algorithms for mining associationrules”, Proc. VLDB’94, pp.487-499, 1994.
    S. Laxman, P.S. Sastry and K.P. Unnikrishnan, “A fast algorithmfor finding frequent episodes in event streams”, Proc.KDD’07, pp.410-419, 2007.
    H. Mannila, H. Toivonen and I. Verkamo, “Discovery of frequentepisodes in event sequences”, Data Mining and Knowledge Discovery,Vol.1, No.3, pp.259-289, 1997.
    H. Mannila, H. Toivonen and A.I. Verkamo, “Discovering frequentepisodes in sequences”, Proc. KDD’95, pp.210-215, 1995.
    D. Patel, W. Hsu and M.L. Lee, “Mining relationship amonginterval-based events for classification”, Proc. SIGMOD’08,pp.393-404, 2008.
    W.Z. Zhou, H.Y. Liu and H. Cheng, “Mining closed episodesfrom event sequences efficiently”, Proc. PAKDD’10, pp.310-318, 2010.
    The UCSC Genome Bioinformatics Site [Online]. Available:http://hgdownload.cse. ucsc.edu/downloads.html, 2010.
    Intel Lab Data Site [Online]. Available: http://db.csail.mit.edu/labdata/labdata.html, 2010.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (377) PDF downloads(1009) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return