Reduction Relaxation in Privacy Preserving Association Rules Mining

被引：0

作者：

Andruszkiewicz, Piotr ^{[1
]}

机构：

[1] Warsaw Univ Technol, Inst Comp Sci, PL-00661 Warsaw, Poland

来源：

ADVANCES IN DATABASES AND INFORMATION SYSTEMS | 2013年 / 186卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In Privacy Preserving Association Rules Mining, when frequent sets are discovered, the relaxation can be used to decrease the false negative error component and, in consequence, to decrease the number of true frequent itemsets that are missed. We introduce the new type of relaxation - the reduction relaxation that enable a miner to decrease and control the false negative error for different lengths of frequent itemsets.

引用

页码：1 / 8

页数：8

共 6 条

[1] Agrawal R., 1994, P 20 INT C VER LARG, P487, DOI DOI 10.5555/645920.672836
[2] Agrawal S., 2003, CSDB0310038 CORR
[3] Andruszkiewicz P, 2007, LECT NOTES ARTIF INT, V4585, P465, DOI 10.1007/978-3-540-73451-2_49
[4] Rizvi S. J., 2002, Proceedings of the Twenty-eighth International Conference on Very Large Data Bases, P682
[5] Srikant R., 1995, VLDB '95. Proceedings of the 21st International Conference on Very Large Data Bases, P407
[6] Srikant R., 1996, Mining sequential patterns: Generalizations and performance improvements, P1, DOI [DOI 10.1145/235968.233311, 10.1007/BFb0014140]

← 1 →