A Constraint-Based Model for the Frequent Itemset Hiding Problem-Reference-Cited by-同舟云学术

A Constraint-Based Model for the Frequent Itemset Hiding Problem

Published:2019-12-10 Issue: Volume: Page:49-64
ISSN:1865-0929
Container-title:Communications in Computer and Information Science
language:
Short-container-title:

Author:

Verykios Vassilios S.,Stavropoulos Elias C.,Zorkadis Vasilis,Elmagarmid Ahmed K.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-37545-4_4

Reference43 articles.

1. Abul, O., Gökçe, H.: Knowledge hiding from tree and graph databases. Data Knowl. Eng. 72, 148–171 (2012)

2. Advances in Database Systems;C Aggarwal,2008

3. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)

4. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOD Conference, pp. 439–450 (2000)

5. Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure limitation of sensitive rules. In: KDEX Workshop, pp. 45–52. IEEE (1999)

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

1. Interoperability of Information Sources for Identification With Privacy Preservation and Early Fraud Detection;2023 14th International Conference on Information, Intelligence, Systems & Applications (IISA);2023-07-10

2. Research on improved full-factor deep information mining algorithm;Cognitive Robotics;2022

3. A Database Reconstruction Approach for the Inverse Frequent Itemset Mining Problem;Learning and Analytics in Intelligent Systems;2021-10-03

4. Frequent itemset hiding revisited: pushing hiding constraints into mining;Applied Intelligence;2021-06-16