检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵乐 张恩[1,2] 秦磊勇[1,2] 李功丽 ZHAO Le;ZHANG En;QIN Leiyong;LI Gongli(College of Computer and Information Engineering,Henan Normal University,Xinxiang Henan 453007,China;Engineering Lab of Intelligence Business and Internet of Things of Henan Province(Henan Normal University),Xinxiang Henan 453007,China)
机构地区:[1]河南师范大学计算机与信息工程学院,河南新乡453007 [2]智慧商务与物联网技术河南省工程实验室(河南师范大学),河南新乡453007
出 处:《计算机应用》2022年第12期3801-3812,共12页journal of Computer Applications
基 金:国家自然科学基金资助项目(U1604156,61901160,U1804164);河南省科技攻关计划项目(192102210131,212102210388);河南省软科学研究计划项目(212400410109)。
摘 要:针对现有隐私保护k-means聚类方案迭代效率不高,中心化差分隐私保护k-means聚类方案中服务器会遭受攻击,以及本地化差分隐私保护k-means聚类方案中服务器会返回错误聚类结果的问题,提出了一种基于区块链的多方隐私保护k-means聚类方案(M-PPkCS/B)。利用本地化差分隐私技术的优势及区块链公开透明、不可篡改的特性,首先,设计一种多方k-means聚类中心初始化算法(M-kCCIA),在保护用户隐私的同时,提高聚类的迭代效率,并确保用户联合产生初始聚类中心的正确性;然后,设计一种基于区块链的隐私保护k-means聚类算法(Bc-PpkCA),并构建聚类中心更新算法的智能合约来在区块链上迭代更新聚类中心,从而保证各个用户都能得到正确的聚类结果。在数据集HTRU2和Abalone上进行实验的结果表明,在确保各个用户得到正确聚类结果的同时,两个数据集的准确率分别能达到97.53%和96.19%,M-kCCIA的平均迭代次数与随机化初始聚类中心算法RS的平均迭代次数相比,在两个数据集上分别减少了5.68次和2.75次。In order to solve the problems that the iterative efficiencies of the existing privacy protection k-means clustering schemes are low,the server in the centralized differential privacy preserving k-means clustering scheme may be attacked,and the server in the localized differential privacy protection k-means clustering scheme may return wrong clustering results,a Multi-party Privacy Protection k-means Clustering Scheme based on Blockchain(M-PPkCS/B)was proposed.Taking advantages of localized differential privacy technology and the characteristics of the blockchain such as being open,transparent,and non-tamperable,firstly,a Multi-party k-means Clustering Center Initialization Algorithm(MkCCIA)was designed to improve the iterative efficiency of clustering while protecting user privacy,and ensure the correctness of initial clustering centers jointly generated by the users.Then,a Blockchain-based Privacy Protection k-means Clustering Algorithm(Bc-PPkCA)was designed,and a smart contract of clustering center updating algorithm was constructed.The clustering center was updated iteratively by the above smart contract on the blockchain to ensure that each user was able to obtain the correct clustering results.Through experiments on the datasets HTRU2 and Abalone,the results show that while ensuring that each user obtains the correct clustering results,the accuracy can reach 97.53%and 96.19%respectively,the average iteration times of M-kCCIA is 5.68 times and 2.75 times less than that of the algorithm of randomly generating initial cluster center called Random Selection(RS).
关 键 词:K-MEANS聚类 隐私保护 本地化差分隐私 区块链 智能合约
分 类 号:TP309.2[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.252.90