| 保持隐私的关联规则挖掘 |
| |
| 引用本文： | 沈旭昌.保持隐私的关联规则挖掘[J].计算机工程与设计,2005,26(3):750-751,767. |
| |
| 作者姓名： | 沈旭昌 |
| |
| 作者单位： | 浙江工业大学,信息学院,浙江,杭州,310032 |
| |
| 摘 要： | 隐私保护是数据挖掘中很有意义的研究方向。M．Kantarcioglu等提出了针对水平分割数据的保持隐私的关联规则挖掘的算法，探讨了如何在两个垂直分布的私有数据库的联合样本集上施行数据挖掘算法，同时保证不向对方泄露任何与结果无关的数据库数据，针对资料分类算法中应用非常普遍的关联规则挖掘算法，利用安全两方计算协议．给出一个保持隐私的关联规则挖掘协议。
|
| 关 键 词： | 安全两方计算 数据挖掘 关联规则 |
| 文章编号： | 1000-7024(2005)03-0750-02 |
Private-preserving association rules mining |
| |
| SHEN Xu-chang.Private-preserving association rules mining[J].Computer Engineering and Design,2005,26(3):750-751,767. |
| |
| Authors: | SHEN Xu-chang |
| |
| Abstract: | Privacy preserving in datamining is a significant direction. M. Kantarcioglu hasproposed a method for horizontally partitioned data . A scenario in which two parties owning confidential databases wish to run an algorithm on the union of their database is addressed 2] without revealing any unnecessary information. A two-party algorithm for efficiently discovering frequent item setswith minimum support level is presented without either site reveal individual transaction values. |
| |
| Keywords: | secure two-party computation data mining association rules |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
