首页    期刊浏览 2024年11月08日 星期五
登录注册

文章基本信息

  • 标题:A New Approach to Discover Periodic Frequent Patterns
  • 本地全文:下载
  • 作者:K. Duraiswamy ; B. Jayanthi
  • 期刊名称:Computer and Information Science
  • 印刷版ISSN:1913-8989
  • 电子版ISSN:1913-8997
  • 出版年度:2011
  • 卷号:4
  • 期号:2
  • 页码:75
  • DOI:10.5539/cis.v4n2p75
  • 出版社:Canadian Center of Science and Education
  • 摘要:Mining Frequent Patterns in transaction database TD has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithm does not consider the time stamps associated with the transactions. Temporal periodicity of pattern appearance can be regarded as an important criterion for measuring the interestingness of frequent patterns in several applications. In this paper, we extend the existing frequent pattern mining framework to take into account the time stamp as periodicity i.e., the time stamp from the month January to June is as First Period  and from July to December as Second Period , and discover frequent patterns for each period. An efficient tree based data structure called periodic-frequent pattern tree that captures the database TD in a highly compact manner and enables a pattern growth mining techniques to generate the complete set of Periodic-Frequent patterns. Example illustrating the proposed approach is given. The characteristics of the algorithm are discussed.
国家哲学社会科学文献中心版权所有