首页    期刊浏览 2024年10月05日 星期六
登录注册

文章基本信息

  • 标题:Fp-Tree Algorithm Using Modified-Ck Secure Sum Method
  • 本地全文:下载
  • 作者:JYOTIRMAYEE RAUTARAY ; RAGHVENDRA KUMAR
  • 期刊名称:International Journal of Innovative Research in Science, Engineering and Technology
  • 印刷版ISSN:2347-6710
  • 电子版ISSN:2319-8753
  • 出版年度:2013
  • 卷号:2
  • 期号:1
  • 页码:315
  • 出版社:S&S Publications
  • 摘要:Privacy consideration is frequently moderation of data mining. This paper addresses the problem of association rulemining using the FP tree algorithm where operation is scattered across multiple parties. Each party holds the number oftransaction and the parties wish to work together to recognize globally valid Association rule. We presents the multi partytransaction data that discovers frequent item sets with minimum support, without either parties revelling the individual data.
  • 关键词:Horizontal Partitioning; FP tree algorithm; Secure multi party computation; Modified Ck secure sum.
国家哲学社会科学文献中心版权所有