首页    期刊浏览 2025年02月26日 星期三
登录注册

文章基本信息

  • 标题:Bi-Directional Prefix Preserving Closed Extension For Linear Time Closed Pattern Mining
  • 本地全文:下载
  • 作者:R. Sandeep Kumar ; R.Suhasini ; B.Sivaiah
  • 期刊名称:International Journal of Computer Trends and Technology
  • 电子版ISSN:2231-2803
  • 出版年度:2013
  • 卷号:4
  • 期号:10-1
  • 出版社:Seventh Sense Research Group
  • 摘要:In data mining frequent closed pattern has its own role we undertake the closed pattern which was frequent discovery crisis for structured data class, which is an extended version of a perfect algorithm Linear time Closed pattern Miner (LCM) for the purpose of mining closed patterns which are frequent from huge transaction databases. LCM is based on prefix preserving closed extension and depth first search. As an extension to this proposed model, we devise a itemset pruning process under support proportionality, which causes computational and search process time scalability in closed itemset discovery. The proposed model can be labeled as bidirectional prefix preserving closed extension for LCM.
  • 关键词:Text mining; query languages; information storage and retrieval
国家哲学社会科学文献中心版权所有