文章基本信息

标题：Distributed Data Mining based on Random Projection with Optimal Communication
本地全文：下载
作者：T.Revathi ; P.Sumathi
期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2013
卷号：2
期号：6
页码：246-251
出版社：International Journal of Soft Computing & Engineering
摘要：Distributed data mining discovers hidden useful information from data sources distributed among several sites. Privacy of participating sites becomes great concern and sensitive information pertaining to the individual sites needs high protection when data mining occurs among several sites. Different approaches for mining data securely in a distributed environment have been proposed but in the existing approaches, collusion among the participating sites may reveal sensitive information about other participating sites and they suffer from the intended purposes of maintaining privacy of the individual participating sites, reducing computational complexity and minimizing communication overhead. The proposed method finds global frequent itemsets in a distributed environment with minimal communication among sites and ensures higher degree of privacy with randomized site selection. The experimental analysis shows that proposed method generates global frequent itemsets among colluded sites without affecting mining performance and confirms optimal communication among sites.
关键词：Distributed data mining; privacy; secure;multiparty computation; frequent itemsets.