loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Harun Gökçe and Osman Abul

Affiliation: TOBB University of Economics and Technology, Turkey

ISBN: 978-989-8425-28-7

Keyword(s): Data mining, Frequent itemset mining, Privacy, Sensitive knowledge hiding.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Data and Application Security and Privacy ; Foundations of Knowledge Discovery in Databases ; Information and Systems Security ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Privacy ; Symbolic Systems

Abstract: Sensitive frequent itemset hiding problem is typically solved by applying a sanitization process which transforms the source database into a release version. The main challenge in the process is to preserve the database utility while ensuring no sensitive knowledge is disclosed, directly or indirectly. Several algorithmic solutions based on different approaches are proposed to solve the problem. We observe that the available algorithms are like seesaws as far as both effectiveness and efficiency performances are considered. However, most practical domains demand for solutions with satisfactory effectiveness/efficiency performances, i.e., solutions balancing the tradeoff between the two. Motivated from this observation, in this paper, we present yet a simple and practical frequent itemset hiding algorithm targeting the balanced solutions. Experimental evaluation, on two datasets, shows that the algorithm indeed achieves a good balance between the two performance criteria.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 100.24.122.228

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Gökçe, H. and Abul, O. (2010). A TRADEOFF BALANCING ALGORITHM FOR HIDING SENSITIVE FREQUENT ITEMSETS.In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2010) ISBN 978-989-8425-28-7, pages 200-205. DOI: 10.5220/0003088302000205

@conference{kdir10,
author={Harun Gök\c{C}e. and Osman Abul.},
title={A TRADEOFF BALANCING ALGORITHM FOR HIDING SENSITIVE FREQUENT ITEMSETS},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2010)},
year={2010},
pages={200-205},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003088302000205},
isbn={978-989-8425-28-7},
}

TY - CONF

JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2010)
TI - A TRADEOFF BALANCING ALGORITHM FOR HIDING SENSITIVE FREQUENT ITEMSETS
SN - 978-989-8425-28-7
AU - Gökçe, H.
AU - Abul, O.
PY - 2010
SP - 200
EP - 205
DO - 10.5220/0003088302000205

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.