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
相关论文
共 50 条
  • [1] Generalization of pattern-growth methods for sequential pattern mining with gap constraints
    Antunes, C
    Oliveira, AL
    MACHINE LEARNING AND DATA MINING IN PATTERN RECOGNITION, PROCEEDINGS, 2003, 2734 : 239 - 251
  • [2] Constraint-based sequential pattern mining: the pattern-growth methods
    Jian Pei
    Jiawei Han
    Wei Wang
    Journal of Intelligent Information Systems, 2007, 28 : 133 - 160
  • [3] Constraint-based sequential pattern mining: the pattern-growth methods
    Pei, Jian
    Han, Jiawei
    Wang, Wei
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2007, 28 (02) : 133 - 160
  • [4] Sequential Pattern Mining with Wildcards
    Xie, Fei
    Wu, Xindong
    Hu, Xuegang
    Gao, Jun
    Guo, Dan
    Fei, Yulian
    Hua, Ertian
    22ND INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2010), PROCEEDINGS, VOL 1, 2010,
  • [5] Mining Sequential Pattern Changes
    Li, I-Hui
    Huang, Jyun-Yao
    Liao, I-En
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2014, 30 (04) : 973 - 990
  • [6] Benchmarking Data Mining Methods in CAT
    Ince, Ibrahim Furkan
    Karahoca, Adem
    Karahoca, Dilek
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2012, 6839 : 716 - +
  • [7] From sequential pattern mining to structured pattern mining: A pattern-growth approach
    Han, JW
    Pei, J
    Yan, XF
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (03) : 257 - 279
  • [8] From sequential pattern mining to structured pattern mining: A pattern-growth approach
    Jia-Wei Han
    Jian Pei
    Xi-Feng Yan
    Journal of Computer Science and Technology, 2004, 19 : 257 - 279
  • [9] A sequential tree approach for incremental sequential pattern mining
    Boghey, Rajesh Kumar
    Singh, Shailendra
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2016, 41 (12): : 1369 - 1380
  • [10] A sequential tree approach for incremental sequential pattern mining
    Rajesh Kumar Boghey
    Shailendra Singh
    Sādhanā, 2016, 41 : 1369 - 1380