位图
计算机科学
数据库事务
序列(生物学)
数据挖掘
序列数据库
国家(计算机科学)
职位(财务)
光学(聚焦)
关联规则学习
数据库
算法
人工智能
生物化学
化学
物理
财务
生物
基因
光学
经济
遗传学
作者
Chuanhou Sun,Yongshun Gong,Ying Guo,Long Zhao,Dong Xiang,Xinwang Liu,Dong Xiang
标识
DOI:10.1016/j.knosys.2024.111449
摘要
Negative sequential patterns (NSP) focus on non-occurring events and play a role that cannot be replaced by positive sequential patterns (PSP). Considering the repetitive occurrence of sequential patterns in a sequence, repetitive NSP (RNSP) mining captures frequent NSP across different sequences from a database. Those patterns benefit many tasks of transaction services, e.g., fraud detection and medical diagnosis. However, limited studies focusing on mining RNSP are proposed, e.g., e-RNSP and ONP-Miner, and they are devised under strict constraints and are inefficient in practice. To address these issues, this paper proposes a Self-adaptive Nonoverlapping RNSP mining method SN-RNSP to mine nonoverlapping RNSP with the self-adaptive gap between successive elements from transaction sequences, which requires that each element cannot be reused at the same position in occurrences, and the gap value does not need to be specified in advance. First, this paper develops a method that maintains occurrences of pattern candidates via the bitmap structure to capture all repetitive PSP (RPSP), which utilizes the bitmap-based operation to calculate support efficiently. Second, SN-RNSP leverages bitmaps to record the locations of RPSP and RNSP in the database and query the repetition times of corresponding RPSP for the support calculation of RNSP. Conducted on real-world and synthetic datasets, extensive experiments demonstrate that SN-RNSP can discover more patterns with better mining performance than the state-of-the-art RNSP mining algorithms in transaction sequence databases.
科研通智能强力驱动
Strongly Powered by AbleSci AI