文章詳目資料

Journal of Computers EIMEDLINEScopus

  • 加入收藏
  • 下載文章
篇名 Mining Sequential Association Rules Efficiently by Using Prefix Projected Databases
卷期 22:2
作者 Chen, Yi-chunLee, Guanling
頁次 033-047
關鍵字 Componentsequential association ruleprojected database methoddata miningEIMEDLINEScopus
出刊日期 201107

中文摘要

英文摘要

The mining of sequential patterns has been studied for several years, however, there is little studies pay attention to mining of sequential association rules despite such rules also providing valuable knowledge
about many real applications. The sequential association rule represents the concept that a set of items usually occur after a specific order sequence. In this paper, the idea of sequential association rule is introduced and two algorithms, GSAR and PSAR algorithms, are proposed to discover these hidden knowledge. Moreover,experiments are performed on both synthetic and real datasets to show the benefit of our approach.

相關文獻