Hiding association rules by using confidence and support

Elena Dasseni, Vassilios S. Verykios, Ahmed Elmagarmid, Elisa Bertino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

169 Citations (Scopus)

Abstract

Large repositories of data contain sensitive information which must be protected against unauthorized access. Recent advances, in data mining and machine learning algorithms, have increased the disclosure risks one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, which are called association rules. If the disclosure risk of some of these rules are above a certain privacy threshold, those rules must be characterized as sensitive. Sometimes, sensitive rules should not be disclosed to the public since, among other things, they may be used for inferencing sensitive data, or they may provide business competitors with an advantage.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages369-383
Number of pages15
Volume2137
ISBN (Print)3540427333, 9783540427339
Publication statusPublished - 2001
Externally publishedYes
Event4th International Information Hiding Workshop, IHW 2001 - Pittsburgh, United States
Duration: 25 Apr 200127 Apr 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2137
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Information Hiding Workshop, IHW 2001
CountryUnited States
CityPittsburgh
Period25/4/0127/4/01

Fingerprint

Association rules
Association Rules
Confidence
Disclosure
Learning algorithms
Data mining
Learning systems
Confidentiality
Industry
Repository
Thing
Privacy
Learning Algorithm
Data Mining
Machine Learning

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dasseni, E., Verykios, V. S., Elmagarmid, A., & Bertino, E. (2001). Hiding association rules by using confidence and support. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2137, pp. 369-383). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2137). Springer Verlag.

Hiding association rules by using confidence and support. / Dasseni, Elena; Verykios, Vassilios S.; Elmagarmid, Ahmed; Bertino, Elisa.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2137 Springer Verlag, 2001. p. 369-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2137).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dasseni, E, Verykios, VS, Elmagarmid, A & Bertino, E 2001, Hiding association rules by using confidence and support. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2137, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2137, Springer Verlag, pp. 369-383, 4th International Information Hiding Workshop, IHW 2001, Pittsburgh, United States, 25/4/01.
Dasseni E, Verykios VS, Elmagarmid A, Bertino E. Hiding association rules by using confidence and support. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2137. Springer Verlag. 2001. p. 369-383. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Dasseni, Elena ; Verykios, Vassilios S. ; Elmagarmid, Ahmed ; Bertino, Elisa. / Hiding association rules by using confidence and support. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2137 Springer Verlag, 2001. pp. 369-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{86dab2150d3447a485dae176acb84c9a,
title = "Hiding association rules by using confidence and support",
abstract = "Large repositories of data contain sensitive information which must be protected against unauthorized access. Recent advances, in data mining and machine learning algorithms, have increased the disclosure risks one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, which are called association rules. If the disclosure risk of some of these rules are above a certain privacy threshold, those rules must be characterized as sensitive. Sometimes, sensitive rules should not be disclosed to the public since, among other things, they may be used for inferencing sensitive data, or they may provide business competitors with an advantage.",
author = "Elena Dasseni and Verykios, {Vassilios S.} and Ahmed Elmagarmid and Elisa Bertino",
year = "2001",
language = "English",
isbn = "3540427333",
volume = "2137",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "369--383",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Hiding association rules by using confidence and support

AU - Dasseni, Elena

AU - Verykios, Vassilios S.

AU - Elmagarmid, Ahmed

AU - Bertino, Elisa

PY - 2001

Y1 - 2001

N2 - Large repositories of data contain sensitive information which must be protected against unauthorized access. Recent advances, in data mining and machine learning algorithms, have increased the disclosure risks one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, which are called association rules. If the disclosure risk of some of these rules are above a certain privacy threshold, those rules must be characterized as sensitive. Sometimes, sensitive rules should not be disclosed to the public since, among other things, they may be used for inferencing sensitive data, or they may provide business competitors with an advantage.

AB - Large repositories of data contain sensitive information which must be protected against unauthorized access. Recent advances, in data mining and machine learning algorithms, have increased the disclosure risks one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, which are called association rules. If the disclosure risk of some of these rules are above a certain privacy threshold, those rules must be characterized as sensitive. Sometimes, sensitive rules should not be disclosed to the public since, among other things, they may be used for inferencing sensitive data, or they may provide business competitors with an advantage.

UR - http://www.scopus.com/inward/record.url?scp=84947271833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947271833&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947271833

SN - 3540427333

SN - 9783540427339

VL - 2137

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 369

EP - 383

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -