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

文章基本信息

  • 标题:Privacy Preserving CART Algorithm over Vertically Partitioned Data
  • 本地全文:下载
  • 作者:Raghvendra Kumar ; Ashish Jaiswal ; Divyarth Rai
  • 期刊名称:International Journal of Innovative Research in Computer and Communication Engineering
  • 印刷版ISSN:2320-9798
  • 电子版ISSN:2320-9801
  • 出版年度:2013
  • 卷号:1
  • 期号:9
  • 出版社:S&S Publications
  • 摘要:Data mining classification algorithms are centralized algorithm and works on centralized database. In this information age, organizations uses distributed database. Since data minin g of private data is one of the keys to success for an organization, it is a challenging task to implement data mining in distributed database. Collaboration of different organization brings mutual benefits to the party involved . So different organizations wants to collaborate and execute efficient data mining algorithm. This arises privacy issues. Organizations are unable to collaborate because the privacy of private data is not fully preserved. In this paper CART algorithm is implemented over vertically partitioned data. For efficient privacy preservation of private data, privacy preserving protocols such as scalar product, x (ln x) protocols are used.
  • 关键词:Privacy Preserving; CART; decision tree
国家哲学社会科学文献中心版权所有