首页> 外文期刊>電子情報通信学会技術研究報告 >A Secure Association Rules Mining Scheme Based on Frequent-Pattern Tree
【24h】

A Secure Association Rules Mining Scheme Based on Frequent-Pattern Tree

机译:基于频繁树的安全关联规则挖掘方案

获取原文
获取原文并翻译 | 示例
           

摘要

Many government organizations and companies want to share their documents in a similar theme to get the joint benefits. Textual document clustering is a powerful data mining technique to analyze the large amount of documents and structure large sets of text or hypertext documents. While doing the document clustering in the distributed environment, it may involve the users' privacy of their own document. In this paper, we propose a framework to do the privacy-preserving text mining among the users under the distributed environment: multiple parties, each having their private documents, want to collaboratively execute agglomerative document clustering without disclosing their private contents to any other parties.
机译:许多政府组织和公司都希望以相似的主题共享其文档,以获得共同的利益。文本文档聚类是一种强大的数据挖掘技术,可以分析大量文档并构造大量文本或超文本文档。在分布式环境中进行文档聚类时,它可能涉及用户对自己文档的隐私。在本文中,我们提出了一个在分布式环境下在用户之间进行隐私保护文本挖掘的框架:每个都有其私人文档的多方希望共同执行聚集文档的聚类,而又不将其私人内容透露给任何其他方。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号