共查询到20条相似文献，搜索用时 578 毫秒
1.
2.
基于现行数据隐私问题日益严重,如何防止数据挖掘过程中隐私信息的泄漏,将是一个重要的研究议题。本文主要针对关联规则挖掘技术,从安全多方计算方面探讨隐私信息的保护,提出适用于挖掘水平分割数据的保护机制。方法设计采用集中式挖掘,过程中加入信息安全技术以确保参与单位的数据隐私,以求在隐私保护和知识获取间取得一个平衡。 相似文献
3.
在分析与研究分布式数据挖掘和频繁闭项集挖掘的基础上,通过设计一个Unite_Tree算法构建全局FP-Tree树,并在全局FP-Tree树的基础上设计了一种分布式环境下动态频繁闭项集的挖掘算法D-MFCI。最后,通过仿真实验证明D-MFCI算法可以实现分布式数据库中关联规则的快速挖掘,减少生成规则的冗余度,提高规则的可读性。 相似文献
4.
分析了在分布式环境下,能否将各种数据挖掘工具挖掘到的知识和规则能够很好的共享的问题,借助了XML语言格式和PMML语言格式,使用Web（Web service）服务的方式来建立与平台无关的接口,采用动态的可扩展结构（UDDI）,来搭建分布式环境下集成数据挖掘系统（distributed data mining,DDM）,本系统为地理上分布的软件之间如何协作及如何动态执行的问题提供了一个解决方案。 相似文献
5.
结合了分布式入侵检测技术和数据挖掘技术,对基于数据挖掘的分布式入侵检测系统进行了研究.在对经典的关联规则挖掘Apriori算法改进的基础上,提出了适用于分布式入侵检测系统中基于网络数据源的关联规则挖掘DZApriori算法. 相似文献
6.
数据挖掘的隐私保护研究 总被引：1，自引：0，他引：1
随着数据量的增大,数据挖掘技术应用不断扩大,如何在挖掘过程中不泄露私有信息或敏感知识,同时能得到比较准确的挖掘效果,已经成为数据挖掘研究中的一个热点课题。文章从数据分布的角度结合挖掘算法对目前几种关键的隐私保护方法进行了介绍、分析,给出算法的评估,最后分析总结了数据挖掘隐私保护未来的研究方向。 相似文献
7.
在现有的网格和数据挖掘技术基础上,研究OGSA面向服务的体系结构,建立了网格平台下的分布式数据挖掘系统模型。基于该模型。对经典关联规则算法FP—tree算法作了改进,提出分布式频繁模式挖掘算法,并对该模型和算法进行了分析、测试、和评估。 相似文献
8.
数据挖掘是目前信息领域和数据库技术领域的前沿研究课题,它涉及到数理统计、模糊理论、神经网络和人工智能等多种技术,技术含量比较高,实现难度也较大.本文研究了关联规则挖掘技术的基本概念、过程和算法等,为提高数据挖掘效率,提出了基于聚类划分的增量式关联规则挖掘算法.即运用快速聚类方法实现数据划分、运用改进的FP-growth算法实现关联规则的挖掘和运用增量FP-growth挖掘算法实现增量数据挖掘的关联规则挖掘算法. 相似文献
9.
铁路运输、公路运输、水路运输和航空运输等系统中积累了大量的原始数据信息,为了有效地从这些异地的海量数据信息中抽取知识给无缝运输管理者提供决策支持,结合网格技术和数据挖掘技术提出了一个基于无缝运输信息网格（STIG）的并行数据挖掘方案。该方案的架构包括四层：用户层、挖掘任务分析和管理层、计算层、数据层。该方案的实现主要涉及数据挖掘算法服务的发现、数据分配和大数据源的分布式处理等技术。 相似文献
10.
基于现行数据隐私问题日益严重,如何防止数据挖掘过程中隐私信息的泄漏,将是一个重要的研究议题。就此提出了一个多单位合作的决策树隐私保护方法,并重点分析了该方法所具有的安全性和通讯量,方法以C4.5算法为基础并利用垂直属性分割在水平数据库环境下进行挖掘,方法主要是保护不同单位间挖掘出的规则不被其它单位获取,同时又能达到准确无误差的共同挖掘结果。 相似文献
11.
《Information processing & management》2020,57(5):102255
Collaborative frequent itemset mining involves analyzing the data shared from multiple business entities to find interesting patterns from it. However, this comes at the cost of high privacy risk. Because some of these patterns may contain business-sensitive information and hence are denoted as sensitive patterns. The revelation of such patterns can disclose confidential information. Privacy-preserving data mining (PPDM) includes various sensitive pattern hiding (SPH) techniques, which ensures that sensitive patterns do not get revealed when data mining models are applied on shared datasets. In the process of hiding sensitive patterns, some of the non-sensitive patterns also become infrequent. SPH techniques thus affect the results of data mining models. Maintaining a balance between data privacy and data utility is an NP-hard problem because it requires the selection of sensitive items for deletion and also the selection of transactions containing these items such that side effects of deletion are minimal. There are various algorithms proposed by researchers that use evolutionary approaches such as genetic algorithm(GA), particle swarm optimization (PSO) and ant colony optimization (ACO). These evolutionary SPH algorithms mask sensitive patterns through the deletion of sensitive transactions. Failure in the sensitive patterns masking and loss of data have been the biggest challenges for such algorithms. The performance of evolutionary algorithms further gets degraded when applied on dense datasets. In this research paper, victim item deletion based PSO inspired evolutionary algorithm named VIDPSO is proposed to sanitize the dense datasets. In the proposed algorithm, each particle of the population consists of n number of sub-particles derived from pre-calculated victim items. The proposed algorithm has a high exploration capability to search the solution space for selecting optimal transactions. Experiments conducted on real and synthetic dense datasets depict that VIDPSO algorithm performs better vis-a-vis GA, PSO and ACO based SPH algorithms in terms of hiding failure with minimal loss of data. 相似文献
12.
[目的/意义] 数字图书馆逐渐向智慧图书馆转变。图书馆数据的收集、分析等数据使用行为不断被实践,并对业务管理与服务创新做出一定的贡献。然而,涉及用户隐私敏感数据的使用可能会带来安全方面的问题。[方法/过程] 本文在分析传统的图书馆数据挖掘方法基础上,尝试引用PPDM（Privacy-Preserving Data Mining）的数据泛化、清洗、屏蔽、扭曲等方法,将数据挖掘与业务需求相融合,并以用户数据规范化使用为目标,探索智慧服务背景下用户隐私保护机制,构建业务实施与数据保护融合的可行性方案。[结果/结论] 智慧图书馆数据收集、数据发布、数据共享、数据汇聚都可以借鉴PPDM方法对用户隐私数据加以保护。智慧图书馆只有紧密联系技术创新才能够保障服务创新,从而促进智慧图书馆事业的发展。 相似文献
13.
在电子通讯中,签名私钥的安全性尤其重要,而解决这个问题的有效方法是把签名私钥分成若干部分并发放给多个私钥持有者.但是,通常来说在一般的门限签名中,要生成合法的签名,必然要有一定数量的私钥持有者参与签名.那么,这样的门限签名就不适用于服务器作为私钥持有者来参与门限签名.针对这个问题,本文提出一种高效的服务器协助门限签名方案.在该方案中,签名由用户提出,且用户持有的设备可以进行模指数运算.同时,只要新模集合能满足某些安全性质.方案中的模集合就能被新的模集合替换且不降低方案的安全性. 相似文献
14.
15.
The identification of a favorable location for investment is a key aspect influencing the real estate market of a smart city. The number of factors that influence the identification easily runs into a few hundreds (including floor space area, crime in the locality and so on). Existing literature predominantly focuses on the analysis of price trends in a given location. This paper aims to develop a set of tools to compute an optimal location for investment, a problem which has received little attention in the literature (analysis of house price trends has received more attention). In previous work the authors proposed a machine learning approach for computing optimal locations. There are two main issues with the previous work. All real estate factors were assumed to be independent and identically distributed random variables. To address this, in the current paper we propose a network structure to derive the relational inferences between the factors. However, solving the location identification problem using only a network incurs computational burden. Hence, the machine learning layers from the previous work is combined with a network layer for computing an optimal location with proven lower computational cost. A second issue is that the computations are performed on an online database which has inherent privacy risks. The online data, user information and the algorithms can be tampered through privacy breaches. We present a privacy preservation technique to protect the algorithms, and use blockchains to secure the identity of the user. This paper presents solutions to two interesting problems in the analysis of real estate networks: a) to design tools that can identify an optimal location for investment and b) to preserve the privacy of the entire process using privacy preserving techniques and block chains. 相似文献
16.
17.
文本挖掘是数据挖掘技术的一个重要方面,本文根据句法规则的特征,利用文本挖掘技术,提出基于句法规则的文本知识挖掘设计模型,从数据准备、句法规则构造、文本预处理、文本知识挖掘、挖掘结果评价等方面对工作原理进行了分析,重点阐述了句法规则的构造过程,最后通过实验验证了该模型,该设计对实现文本知识的智能化挖掘具有一定的研究意义和应用价值。 相似文献
18.
《Journal of The Franklin Institute》2023,360(12):8954-8972
This paper aims to create a secure environment for state estimation and control design of a networked system composed of multiple dynamic entities and remote computational units, in the presence of disclosure attacks. In particular, both dynamic entities and computational units may be vulnerable to attacks and become malicious. The objective is to ensure that the input and output data of the benign entities are protected from the malicious parties as well as protected when they are transmitted over the network in a distributed environment. We propose a methodology integrating a novel double-layer cryptographic technique with an observer-based control algorithm to achieve the objective where the cryptographic technique addresses the security requirements and the control algorithm satisfies the performance requirements. 相似文献
19.
20.
《Journal of The Franklin Institute》2022,359(5):2377-2402
Distributed target tracking is an important problem in sensor networks (SNs). In this paper, the problem of distributed target tracking is addressed under cyber-attacks for targets with discrete-time and continuous-time nonlinear dynamics. Two distributed filters are obtained for every node of the SN to estimate the states of a general class of nonlinear targets which can be seen in many practical applications. Compared with the existing results in the literature, the network topology of the SN is assumed to be subjected to the denial-of-service attack such that the communication links among sensor nodes are paralyzed or destroyed by this kind of attack. Moreover, the proposed algorithms are designed based on an event-triggered communication strategy that means the frequency of information transmission and unnecessary resource consumption are significantly reduced. The presented algorithms’ stability is also analyzed in the presence of noise to achieve secure event-triggered target tracking in mean-square. Two simulation examples are utilized to demonstrate the efficiency of the proposed event-triggered algorithms. 相似文献