NDLI: A Hybrid Approach to Frequent Itemset Hiding

Content Provider	IEEE Xplore Digital Library
Author	Gkoulalas-Divanis, A. Gkoulalas-Divanis, A. Verykios, V.S. Verykios, V.S.
Copyright Year	2007
Description	Author affiliation: Patras Univ. Campus, Rio (Gkoulalas-Divanis, A.; Verykios, V.S.) \|\| Univ. of Thessaly, Volos (Gkoulalas-Divanis, A.; Verykios, V.S.)
Abstract	In this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent itemsets by (i) minimally extending the original database by a synthetically generated database part - the database extension, (ii) formulating the creation of the database extension as a constraint satisfaction problem that is solved by using binary integer programming, and (Hi) providing an approximate solution close to the optimal one when an ideal solution does not exist. Extending the original database for sensitive itemset hiding is proved to provide optimal solutions to an extended set of hiding problems compared to previous approaches and to provide solutions of higher quality.
Starting Page	297
Ending Page	304
File Size	491377
Page Count	8
File Format	PDF
ISBN	9780769530154
ISSN	10823409
DOI	10.1109/ICTAI.2007.68
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-10-29
Publisher Place	Greece
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Itemsets Linear programming Transaction databases Protection Artificial intelligence Data engineering Data privacy Hybrid power systems Data mining Production
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

An Integer Linear Programming Scheme to Sanitize Sensitive Frequent Itemsets

Privacy-preserving frequent itemset mining in outsourced transaction databases

A new approach of modified transaction reduction algorithm for mining frequent itemset

Frequent Closed Itemset Mining with Privacy Preserving for Distributed Databases

Approximate inverse frequent itemset mining: privacy, complexity, and approximation

Performance Analysis of Frequent Itemset Mining Using Hybrid Database Representation Approach

Hiding sensitive predictive frequent itemsets.

A New Algorithm for Mining Sequential Patterns

A border-based approach for hiding sensitive frequent itemsets

A Hybrid Approach to Frequent Itemset Hiding

Similar Documents

An Integer Linear Programming Scheme to Sanitize Sensitive Frequent Itemsets

Privacy-preserving frequent itemset mining in outsourced transaction databases

A new approach of modified transaction reduction algorithm for mining frequent itemset

Frequent Closed Itemset Mining with Privacy Preserving for Distributed Databases

Approximate inverse frequent itemset mining: privacy, complexity, and approximation

Performance Analysis of Frequent Itemset Mining Using Hybrid Database Representation Approach

Hiding sensitive predictive frequent itemsets.

A New Algorithm for Mining Sequential Patterns

A border-based approach for hiding sensitive frequent itemsets

A Hybrid Approach to Frequent Itemset Hiding