Mining actionable repetitive positive and negative sequential patterns

被引:1
|
作者
Sun, Chuanhou [1 ,2 ]
Ren, Xiaoqiang [1 ,2 ]
Dong, Xiangjun [1 ,2 ]
Qiu, Ping [3 ]
Wu, Xiaoming [1 ,2 ]
Zhao, Long [1 ,2 ]
Guo, Ying [1 ,2 ]
Gong, Yongshun [4 ]
Zhang, Chengqi [5 ]
机构
[1] Qilu Univ Technol, Shandong Acad Sci, Shandong Comp Sci Ctr, Natl Supercomp Ctr Jinan,Minist Educ,0Key Lab Comp, Jinan, Peoples R China
[2] Shandong Fundamental Res Ctr Comp Sci, Shandong Prov Key Lab Comp Networks, Jinan, Peoples R China
[3] Nanjing Univ Posts & Telecommun, Sch Internet Things, Nanjing, Peoples R China
[4] Shandong Univ, Sch Software, Jinan, Peoples R China
[5] Univ Technol Sydney, Fac Engn & Informat Technol, Ctr Artificial Intelligence, Ultimo, NSW 2007, Australia
基金
中国国家自然科学基金;
关键词
Sequential pattern mining; Repetitive sequential pattern; Actionable negative sequential pattern; Self-adaptive gap; Nonoverlapping; ALGORITHM;
D O I
10.1016/j.knosys.2024.112398
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Repetitive positive and negative sequential patterns (PNSPs) recognize the repetitive characteristics of positive (occurring) and negative (nonoccurring) sequential patterns, thereby providing more comprehensive information than traditional PNSPs. However, existing repetitive PNSP mining methods produce numerous conflict patterns that do not benefit decision-making. To address this issue, we propose an actionable repetitive PNSP mining method, namely ARPNSP, for transaction databases. First, we propose the definition of negative occurrence under the self-adaptive gap and nonoverlapping conditions, which makes it possible to identify whether a pattern is actionable via correlation analysis. Second, we propose an offset sequence definition by adding a dummy character at the head of the sequences, which determines the population of repetitive PNSP. Finally, we utilize the bitmap structure to represent databases and occurrences of patterns, which avoids rescanning data sequences to calculate support. To the best of our knowledge, this study is the first attempt at actionable repetitive PNSP mining. Extensive experiments on real-world datasets show that ARPNSP can efficiently discover more actionable PNSPs with high correlation than the considered methods.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] e-RNSP: An Efficient Method for Mining Repetition Negative Sequential Patterns
    Dong, Xiangjun
    Gong, Yongshun
    Cao, Longbing
    IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (05) : 2084 - 2096
  • [32] Mining Actionable Combined Patterns of High Utility and Frequency
    Shao, Jingyu
    Yin, Junfu
    Liu, Wei
    Cao, Longbing
    PROCEEDINGS OF THE 2015 IEEE INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (IEEE DSAA 2015), 2015, : 549 - 558
  • [33] Mining hybrid sequential patterns and sequential rules
    Chen, YL
    Chen, SS
    Hsu, PY
    INFORMATION SYSTEMS, 2002, 27 (05) : 345 - 362
  • [34] Mining sequential patterns for classification
    Fradkin, Dmitriy
    Moerchen, Fabian
    KNOWLEDGE AND INFORMATION SYSTEMS, 2015, 45 (03) : 731 - 749
  • [35] Mining Compressing Sequential Patterns
    Lam, Hoang Thanh
    Moerchen, Fabian
    Fradkin, Dmitriy
    Calders, Toon
    STATISTICAL ANALYSIS AND DATA MINING, 2014, 7 (01) : 34 - 52
  • [36] Mining interval sequential patterns
    Chiang, DA
    Lee, SL
    Chen, CC
    Wang, MH
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2005, 20 (03) : 359 - 373
  • [37] Mining conjunctive sequential patterns
    Chedy Raïssi
    Toon Calders
    Pascal Poncelet
    Data Mining and Knowledge Discovery, 2008, 17 : 77 - 93
  • [38] Mining sequential patterns for classification
    Dmitriy Fradkin
    Fabian Mörchen
    Knowledge and Information Systems, 2015, 45 : 731 - 749
  • [39] Mining compressed sequential patterns
    Chang, Lei
    Yang, Dongqing
    Tang, Shiwei
    Wang, Tengjiao
    ADVANCED DATA MINING AND APPLICATIONS, PROCEEDINGS, 2006, 4093 : 761 - 768
  • [40] Mining maximal sequential patterns
    Guan, EZ
    Chang, XY
    Wang, Z
    Zhou, CG
    PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON NEURAL NETWORKS AND BRAIN, VOLS 1-3, 2005, : 525 - 528