On mining progressive positive and negative sequential patterns simultaneously

Jen Wei Huang, Yong Bin Wu, Bijay Prasad Jaysawal

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

Positive sequential pattern (PSP) mining focuses on appearing items, while negative sequential pattern (NSP) mining tends to find the relationship between occurring and non-occurring items. There are few works involved in NSP mining, and the definitions of NSP are inconsistent in each work. The support threshold for PSP is always applied on NSP, which cannot bring out interesting patterns. In addition, PSP has been discovered on incremental databases and progressive databases, while NSP mining is only performed on static databases. Progressive sequential pattern mining finds the most up-to-date patterns, which can provide more valuable information. However, the previous progressive sequential pattern mining algorithm contains some redundant process. In this paper, we aim to find NSP on progressive databases. A new definition of NSP is given to discover more meaningful and interesting patterns. We propose an algorithm, Propone, for efficient mining process. We also propose a level-order traversal strategy and a pruning strategy to reduce the calculation time and the number of negative sequential candidates (NSC). By comparing Propone with some modified previous algorithms, the experimental results show that Propone outperforms comparative algorithms.

原文English
頁(從 - 到)145-169
頁數25
期刊Journal of Information Science and Engineering
36
發行號1
DOIs
出版狀態Published - 2020

All Science Journal Classification (ASJC) codes

  • 軟體
  • 人機介面
  • 硬體和架構
  • 圖書館與資訊科學
  • 計算機理論與數學

指紋

深入研究「On mining progressive positive and negative sequential patterns simultaneously」主題。共同形成了獨特的指紋。

引用此