A heuristic data reduction approach for associative classification rule hiding
When data are to be shared between business partners, there could be some sensitive patterns which should not be disclosed to the other parties. On the other hand, the "quality" of the data must also be preserved. This creates an interesting question: how can we maintain the shared data th...
Saved in:
Main Authors: | , , |
---|---|
Format: | Book Series |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=58349098012&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60281 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
id |
th-cmuir.6653943832-60281 |
---|---|
record_format |
dspace |
spelling |
th-cmuir.6653943832-602812018-09-10T03:44:56Z A heuristic data reduction approach for associative classification rule hiding Juggapong Natwichai Xingzhi Sun Xue Li Computer Science Mathematics When data are to be shared between business partners, there could be some sensitive patterns which should not be disclosed to the other parties. On the other hand, the "quality" of the data must also be preserved. This creates an interesting question: how can we maintain the shared data that are guaranteed to have the quality, and the certain types of sensitive patterns be removed or "hidden"? In this paper, we address such the problem of sensitive classification rule hiding by using data reduction approach, i.e. removing the whole selected tuples in the given dataset. We focus on a specific type of classification rules, i.e. associative classification rules. In our context, a sensitive rule is hidden when its support falls below a minimal support threshold. Meanwhile, the impact on the data quality of the dataset is represented in term of a number of false-dropped rules, and a number of ghost rules. We present a few observations on the data quality with regard to the data reduction processes. From the observations, we can represent the impact by each reduction precisely without any re-applying the classification algorithm. Subsequently, we propose a heuristic algorithm to hide the sensitive rules based on the observations. Experimental results are presented to show the effectiveness and the efficiency of the proposed algorithm. © 2008 Springer Berlin Heidelberg. 2018-09-10T03:40:32Z 2018-09-10T03:40:32Z 2008-12-01 Book Series 16113349 03029743 2-s2.0-58349098012 10.1007/978-3-540-89197-0_16 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=58349098012&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60281 |
institution |
Chiang Mai University |
building |
Chiang Mai University Library |
country |
Thailand |
collection |
CMU Intellectual Repository |
topic |
Computer Science Mathematics |
spellingShingle |
Computer Science Mathematics Juggapong Natwichai Xingzhi Sun Xue Li A heuristic data reduction approach for associative classification rule hiding |
description |
When data are to be shared between business partners, there could be some sensitive patterns which should not be disclosed to the other parties. On the other hand, the "quality" of the data must also be preserved. This creates an interesting question: how can we maintain the shared data that are guaranteed to have the quality, and the certain types of sensitive patterns be removed or "hidden"? In this paper, we address such the problem of sensitive classification rule hiding by using data reduction approach, i.e. removing the whole selected tuples in the given dataset. We focus on a specific type of classification rules, i.e. associative classification rules. In our context, a sensitive rule is hidden when its support falls below a minimal support threshold. Meanwhile, the impact on the data quality of the dataset is represented in term of a number of false-dropped rules, and a number of ghost rules. We present a few observations on the data quality with regard to the data reduction processes. From the observations, we can represent the impact by each reduction precisely without any re-applying the classification algorithm. Subsequently, we propose a heuristic algorithm to hide the sensitive rules based on the observations. Experimental results are presented to show the effectiveness and the efficiency of the proposed algorithm. © 2008 Springer Berlin Heidelberg. |
format |
Book Series |
author |
Juggapong Natwichai Xingzhi Sun Xue Li |
author_facet |
Juggapong Natwichai Xingzhi Sun Xue Li |
author_sort |
Juggapong Natwichai |
title |
A heuristic data reduction approach for associative classification rule hiding |
title_short |
A heuristic data reduction approach for associative classification rule hiding |
title_full |
A heuristic data reduction approach for associative classification rule hiding |
title_fullStr |
A heuristic data reduction approach for associative classification rule hiding |
title_full_unstemmed |
A heuristic data reduction approach for associative classification rule hiding |
title_sort |
heuristic data reduction approach for associative classification rule hiding |
publishDate |
2018 |
url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=58349098012&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60281 |
_version_ |
1681425406892179456 |