共查询到20条相似文献,搜索用时 203 毫秒
1.
分布式数据挖掘模型假定数据源分布在多个站点上,而各站点在进行分布式数据挖掘的同时需要隐藏私有数据以便保持隐私。本文将多方计算与数据挖掘技术相结合,在两点积运算的基础上提出安全的两点积运算公式,并将其简化,使得分布式挖掘算法的效能与集中式挖掘一致或近似,而又确保分布于不同站点的数据保持隐私。 相似文献
2.
3.
刘英华 《计算机工程与科学》2014,36(7):1384-1388
隐私保护数据挖掘是当前数据挖掘领域中一个十分重要的研究问题,其目标是在无法获得原始明文数据时可以进行精确的数据挖掘,且挖掘的规则和知识与明文数据挖掘的结果相同或类似。为了强化数据的隐私保护、提高挖掘的准确度,针对分布式环境下聚类挖掘隐私保护问题,结合完全同态加密、解密算法,提出并实现了一种基于完全同态加密的分布式隐私保护FHE DBIRCH模型。模型中数据集传输采用完全同态加密算法加密、解密,保证原始数据的隐私。理论分析和实验结果表明,FHE-DBIRCH模型不仅具有很好的数据隐私性且保持了聚类精度。 相似文献
4.
张国荣 《数字社区&智能家居》2006,(8)
隐私保护是数据挖掘中一个重要的研究方向,如何在不违反隐私规定的情况下,利用数据挖掘工具发现有意义的知识是一个热点问题。本文介绍了分布式数据挖掘中隐私保护的现状,着重介绍分布式数据挖掘中隐私保护问题和技术。 相似文献
5.
随着经济的快速发展,当前很多企业构成了产业链,通过对其进行分布式的商务智能分析,能够获取很多有价值的信.研究了适用于产业链型数据的大规模分布式隐私保护数据挖掘架构,重点研究基于安全多方计算技术的分布式隐私保护数据挖掘通用算法组件,特别是研究面向产业链型数据的分布式隐私保护数据挖掘算法.该研究不仅将有助于大规模分布式环境下的隐私保护数据挖掘系统的研发,而且能够达到更好地服务经济的目的. 相似文献
6.
介绍企业信用评估和当前隐私保护数据挖掘技术的最新进展,利用适用于企业信用评估的大规模分布式隐私保护数据挖掘架构,讨论了基于该架构的面向企业信用评估的分布式隐私保护数据挖掘。该研究不仅将有助于大规模分布式环境下的隐私保护数据挖掘系统的研发,而且能够有力推动“信用中国”的建设步伐,以达到更好地服务经济的目的。 相似文献
7.
张国荣 《数字社区&智能家居》2006,(3):30-30,212
隐私保护是数据挖掘中一个重要的研究方向,如何在不违反隐私规定的情况下,利用数据挖掘工具发现有意义的知识是一个热点问题。本文介绍了分布式数据挖掘中隐私保护的现状,着重介绍分布式数据挖掘中隐私保护问题和技术。 相似文献
8.
9.
10.
保持隐私的决策树的生成过程研究 总被引:1,自引:0,他引:1
介绍了保持隐私的数据挖掘技术,研究了决策树分类器在保持隐私的数据挖掘中的应用。在传统的决策树算法中引入标量积协议,既保持决策树算法本身的优点,又满足了保持隐私的需求。 相似文献
11.
近年来隐私保护数据挖掘已经成为数据挖掘的研究热点, 并取得了丰富的研究成果。但是, 随着移动通信、嵌入式、定位等技术的发展与物联网、位置服务、基于位置的社交网络等应用的出现, 具有个人隐私的信息内容更加丰富, 利用数据挖掘工具对数据进行综合分析更容易侵犯个人隐私。针对新的应用需求, 对隐私保护数据挖掘方法进行深入研究具有重要的现实意义。在分析现有的隐私保护数据挖掘方法分类与技术特点的基础上, 提出现有方法并应用于新型分布式系统架构应用系统、高维数据及时空数据等领域存在的挑战性问题, 并指出了今后研究的方向。 相似文献
12.
Kamalika Das Kanishka Bhaduri Hillol Kargupta 《Peer-to-Peer Networking and Applications》2011,4(2):192-209
This paper proposes a scalable, local privacy-preserving algorithm for distributed Peer-to-Peer (P2P) data aggregation useful
for many advanced data mining/analysis tasks such as average/sum computation, decision tree induction, feature selection,
and more. Unlike most multi-party privacy-preserving data mining algorithms, this approach works in an asynchronous manner
through local interactions and it is highly scalable. It particularly deals with the distributed computation of the sum of
a set of numbers stored at different peers in a P2P network in the context of a P2P web mining application. The proposed optimization-based
privacy-preserving technique for computing the sum allows different peers to specify different privacy requirements without
having to adhere to a global set of parameters for the chosen privacy model. Since distributed sum computation is a frequently
used primitive, the proposed approach is likely to have significant impact on many data mining tasks such as multi-party privacy-preserving
clustering, frequent itemset mining, and statistical aggregate computation. 相似文献
13.
14.
15.
在分布式环境下,实现隐私保护的数据挖掘,已成为该领域的研究热点。文中着重研究在垂直分布数据中,实现隐私保护的决策树分类模型。该模型创建新型的隐私保护决策树,即由在茫然半诚实方存储的全局决策表和各站点存储的局部决策树组成,并结合索引数组和秘密数据比较协议,实现在不泄漏原始信息的前提下决策树的生成和分类。经过理论分析和实验验证,证明该模型具有较好的安全性、准确性和适用性。 相似文献
16.
17.
《Engineering Applications of Artificial Intelligence》2005,18(7):791-807
Multi-agent systems (MAS) offer an architecture for distributed problem solving. Distributed data mining (DDM) algorithms focus on one class of such distributed problem solving tasks—analysis and modeling of distributed data. This paper offers a perspective on DDM algorithms in the context of multi-agents systems. It discusses broadly the connection between DDM and MAS. It provides a high-level survey of DDM, then focuses on distributed clustering algorithms and some potential applications in multi-agent-based problem solving scenarios. It reviews algorithms for distributed clustering, including privacy-preserving ones. It describes challenges for clustering in sensor-network environments, potential shortcomings of the current algorithms, and future work accordingly. It also discusses confidentiality (privacy preservation) and presents a new algorithm for privacy-preserving density-based clustering. 相似文献
18.
Zhiqiang Yang Wright R.N. 《Knowledge and Data Engineering, IEEE Transactions on》2006,18(9):1253-1264
Traditionally, many data mining techniques have been designed in the centralized model in which all data is collected and available in one central site. However, as more and more activities are carried out using computers and computer networks, the amount of potentially sensitive data stored by business, governments, and other parties increases. Different parties often wish to benefit from cooperative use of their data, but privacy regulations and other privacy concerns may prevent the parties from sharing their data. Privacy-preserving data mining provides a solution by creating distributed data mining algorithms in which the underlying data need not be revealed. In this paper, we present privacy-preserving protocols for a particular data mining task: learning a Bayesian network from a database vertically partitioned among two parties. In this setting, two parties owning confidential databases wish to learn the Bayesian network on the combination of their databases without revealing anything else about their data to each other. We present an efficient and privacy-preserving protocol to construct a Bayesian network on the parties' joint data. 相似文献
19.
保密点积协议是许多安全多方计算问题中一个重要的协议,常被用在许多保密数据挖掘协议中,为这些协议提供了重要的安全保证。目前,一些已存在的保密点积协议至多在半诚实模型下是安全的。基于一些基本的密码学技术设计了一个恶意模型下安全的保密两方共享点积协议,这个协议比以往协议具有更高的安全性。该协议潜在的应用领域是广阔的,如计算Euclidean距离、保密计算几何、保密协作统计分析等。 相似文献
20.
With the proliferation of the Web and ICT technologies there have been concerns about the handling and use of sensitive information by data mining systems. Recent research has focused on distributed environments where the participants in the system may also be mutually mistrustful. In this paper we discuss the design and security requirements for large-scale privacy-preserving data mining (PPDM) systems in a fully distributed setting, where each client possesses its own records of private data. To this end we argue in favor of using some well-known cryptographic primitives, borrowed from the literature on Internet elections. More specifically, our framework is based on the classical homomorphic election model, and particularly on an extension for supporting multi-candidate elections. We also review a recent scheme [Z. Yang, S. Zhong, R.N. Wright, Privacy-preserving classification of customer data without loss of accuracy, in: SDM’ 2005 SIAM International Conference on Data Mining, 2005] which was the first scheme that used the homomorphic encryption primitive for PPDM in the fully distributed setting. Finally, we show how our approach can be used as a building block to obtain Random Forests classification with enhanced prediction performance. 相似文献