pdf

Privacy-preserving association mining algorithm for horizontally distributed datasets

  • 2013-09-18
  • 163.96KB
  • Points it Requires : 2

This paper studies the privacy-preserving association rule mining algorithm for horizontally distributed data sets. In view of the shortcomings of existing algorithms that require multiple scans of the data set, a privacy-preserving mining algorithm based on distributed FP-tree is proposed, which only requires two scans of the data set. This algorithm can effectively reduce the amount of communication and protect the original data while ensuring accuracy. Keywords: privacy protection; distributed association rule mining; frequent itemsets; multi-party secure computing

unfold

You Might Like

Uploader
jujuyaya222
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×