A MaxMin approach for hiding frequent itemsets-Reference-Cited by-同舟云学术

A MaxMin approach for hiding frequent itemsets

Published:2008-04 Issue:1 Volume:65 Page:75-89
ISSN:0169-023X
Container-title:Data & Knowledge Engineering
language:en
Short-container-title:Data & Knowledge Engineering

Author:

Moustakides George V.,Verykios Vassilios S.

Publisher

Elsevier BV

Subject

Information Systems and Management

Reference20 articles.

1. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: Proceedings of the 20th VLDB, 1994.

2. M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, V.S. Verykios, Disclosure limitation of sensitive rules, in: Proceedings of the 1999 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX’99), 1999, pp. 45–52.

3. Roberto Bayardo, Efficiently mining long patterns from databases, in: SIGMOD ’98: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, 1998.

4. A framework for evaluating privacy preserving data mining algorithms;Bertino;Data Mining and Knowledge Discovery,2005

5. E. Dasseni, V.S. Verykios, A.K. Elmagarmid, E. Bertino, Hiding association rules by using confidence and support, in: Proceedings of the Fourth International Workshop on Information Hiding, 2001, pp. 369–383.

Cited by 57 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Edge Deletion based Subgraph Hiding;WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS;2024-07-17

2. Identify Risky Rules to Reduce Side Effects in Association Rule Hiding;Proceedings of the 32nd ACM International Conference on Information and Knowledge Management;2023-10-21

3. Statistical limitations of sensitive itemset hiding methods;Applied Intelligence;2023-07-20

4. Decision-making approaches in the antagonistic digital communication of the online communities users;Social Network Analysis and Mining;2023-01-03

5. NOVEL APPROACH TO HIDE SENSITIVE ASSOCIATION RULES BY INTRODUCING TRANSACTION AFFINITY;COMPUT INFORM;2023