Benchmarking the effectiveness of sequential pattern mining methods

被引:11
作者
Kum, Hye-Chung [1 ]
Chang, Joong Hyuk
Wang, Wei
机构
[1] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
[2] Yonsei Univ, Dept Comp Sci, Seoul 120749, South Korea
关键词
benchmarking effectiveness; evaluating quality of results; sequential pattern mining;
D O I
10.1016/j.datak.2006.01.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, there is an increasing interest in new intelligent mining methods to find more meaningful and compact results. In intelligent data mining research, accessing the quality and usefulness of the results from different mining methods is essential. However, there is no general benchmarking criteria to evaluate whether these new methods are indeed more effective compared to the traditional methods. Here we propose a novel benchmarking criteria that can systematically evaluate the effectiveness of any sequential pattern mining method under a variety of situations. The benchmark evaluates how well a mining method finds known common patterns in synthetic data. Such an evaluation provides a comprehensive understanding of the resulting patterns generated from any mining method empirically. In this paper, the criteria are applied to conduct a detailed comparison study of the support-based sequential pattern model with an approximate pattern model based on sequence alignment. The study suggests that the alignment model will give a good summary of the sequential data in the form of a set of common patterns in the data. In contrast, the support model generates massive amounts of frequent patterns with much redundancy. This suggests that the results of the support model require more post processing before it can be of actual use in real applications. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:30 / 50
页数:21
相关论文
共 14 条
  • [1] AGRAWAL R, 1995, PROC INT CONF DATA, P3, DOI 10.1109/ICDE.1995.380415
  • [2] Agrawal R., 1994, Proceedings of the 20th International Conference on Very Large Data Bases. VLDB'94, P487
  • [3] [Anonymous], 1996, EDBT, DOI 10.1007/BFb0014140
  • [4] Ayres J., 2002, Proceedings of the 8th ACM International Conference on Knowledge Discovery and Data Mining, P429, DOI 10.1145/775047.775109
  • [5] A scalable algorithm for clustering sequential data
    Guralnik, V
    Karypis, G
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 179 - 186
  • [6] KOHAVI R, 2000, P SIGKDD EXPLORATION, V2, P86
  • [7] Kum HC, 2003, SIAM PROC S, P311
  • [8] KUM HC, 2002, IEEE ICDM WORKSH FDN
  • [9] BASIC PRINCIPLES OF ROC ANALYSIS
    METZ, CE
    [J]. SEMINARS IN NUCLEAR MEDICINE, 1978, 8 (04) : 283 - 298
  • [10] Mining sequential patterns by pattern-growth: The PrefixSpan approach
    Pei, J
    Han, JW
    Mortazavi-Asl, B
    Wang, JY
    Pinto, H
    Chen, QM
    Dayal, U
    Hsu, MC
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2004, 16 (11) : 1424 - 1440