NDLI: Frequent itemsets hiding: A performance evaluation framework

Content Provider	IEEE Xplore Digital Library
Author	Abul, O. Gokce, H. Sengez, Y.
Copyright Year	2009
Description	Author affiliation: Department of Computer Engineering TOBB University of Economics and Technology, Ankara, Turkey (Abul, O.; Gokce, H.; Sengez, Y.)
Abstract	Sensitive knowledge hiding is an essential requirement to prevent disclosure of any sensitive knowledge holding in shared databases. The security of a database may be risked when it is made public as is: because the data mining tools are so sophisticated that the sensitive knowledge can easily be surfaced by receivers. This gives rise to a sanitization process which transforms the original database into another database, the released one, which does not hold the sensitive knowledge but can substitute the original otherwise. In case the sensitive knowledge is of the form frequent itemsets, the resulting concrete problem is called frequent itemsets hiding. A number of algorithms, exploiting different approaches and techniques, for frequent itemsets hiding problem is proposed in the literature. Since finding optimal solutions is NP-Hard, algorithms resort to certain heuristics having different levels of sophistication, complexity, efficiency and effectiveness. This paper presents an evaluation framework which implements recent algorithms belonging to different approaches and a set of metrics to gauge the performance and problem difficulties. The current work also presents an experimental study and its results where four algorithms and seven datasets are involved. Our results indicate that data distortion levels and runtime requirements are quite high, especially for difficult problem instances. Our conclusion is that there are new rooms for more sophisticated and tuneable (w.r.t. effectiveness/efficiency tradeoff) algorithms.
Starting Page	668
Ending Page	673
File Size	320147
Page Count	6
File Format	PDF
ISBN	9781424450213
DOI	10.1109/ISCIS.2009.5291903
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-09-14
Publisher Place	Cyprus
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Knowledge engineering Data privacy Runtime Itemsets Databases Data security Data engineering Concrete Data mining
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Max-Min Approach for Hiding Frequent Itemsets

Mining Frequent Itemsets Using a Pruned Concept Lattice

Hiding Frequent Patterns in the Updated Database

Adaptive and resource-aware mining of frequent sets

An Efficient Algorithm for Privacy Preserving Maximal Frequent Itemsets Mining

A New Fast Frequent Itemsets Mining Algorithm Based on Forest

Research on Algorithm for Mining Frequent Closed Itemsets over Data Stream

A border-based approach for hiding sensitive frequent itemsets

A lattice-based data sanitization approach

Frequent itemsets hiding: A performance evaluation framework

Similar Documents

A Max-Min Approach for Hiding Frequent Itemsets

Mining Frequent Itemsets Using a Pruned Concept Lattice

Hiding Frequent Patterns in the Updated Database

Adaptive and resource-aware mining of frequent sets

An Efficient Algorithm for Privacy Preserving Maximal Frequent Itemsets Mining

A New Fast Frequent Itemsets Mining Algorithm Based on Forest

Research on Algorithm for Mining Frequent Closed Itemsets over Data Stream

A border-based approach for hiding sensitive frequent itemsets

A lattice-based data sanitization approach

Frequent itemsets hiding: A performance evaluation framework