Untitled Document
| |
|
|
| |
OLS Digital Library |
| |
DL
Home
=> Proceedings => WINBIS'11
=> Citation |
| |
|
|
Paper
Title : A Classification Based Dependent Approach for Suppressing Data |
| |
Full text |
PDF |
| |
Source |
3rd International Conference
on Wireless Information Networks & Business Information System ( WINBIS'11
) |
| |
|
Hotel Marshyandi, Kathmandu, Nepal |
| |
|
Pages : 29 - 33 |
| |
|
Year of Publication : 2011 |
| |
|
ISSN : 2091-0266 |
| |
|
|
| |
Authors |
Vamshi
Batchu, Hindustan University, Chennai, India |
| |
|
D.John
Aravindhar, Hindustan University, Chennai, India |
| |
|
J.Thangakumar,
Hindustan University, Chennai, India |
| |
|
Dr.M.Roberts,
Hindustan University, Chennai, India |
| |
|
|
| |
Sponsor |
: Open
Learning Society (P) Ltd. |
| |
Abstract : |
|
| |
|
Data mining plays an important role in internet with
the computer technology this makes easy to collect the information from
the related data sets. The different methods used in this paper are decision
tree algorithm, the decision tree algorithm used hears is to classify
the data elements by considering a set of constraints, we consider this
method to suppress the data by doing so we can secure the data. We extend
our work on micro data suppression (1) to prevent not only probabilistic
but also decision tree classification based inference, and (2) to handle
not only single but also multiple confidential data value suppression
to reduce the side-effects. The paper aims to enhance the Data classification
and Data Generalization. It shows that how the data is secured using ‘Generalization’
and moreover. It provides efficiency in Data Generalization and discusses
some of the major challenges for what kind of data to be suppressed. We
consider the following privacy problem: a data holder wants to release
a version of data for building classification models, but wants to protect
against linking the released data to an external source for inferring
sensitive information. The generalized data remains useful to classification
but becomes difficult to link to other sources. The generalization space
is specified by a hierarchical structure of generalizations. A key is
identifying the best generalization to climb up the hierarchy at each
iteration. Enumerating all candidate generalizations is impractical. |
| |
References : |
|
| |
|
-
Klein
RJ, Proctor SE, Bouderault MA, Turczyn KM. Healthy People 2010 criteria
for data suppression. Healthy People 2010 Statistical Notes. No.24.
Hyattsville, MD: National Center for Health Statistics; pp. (2002).
-
“Data
mining: Concepts and Techniques”, Jiawei Han, Macheline Kamber, Morgan
Kaufmann Publishers, chapter-6, page no 358.pp. (2005)
-
Aggarwal,
C.: On k-anonymity and the curse of dimensionality. In: Proceedings
of the 31st VLDB Conference (2005).
-
Doyle
P, Lane JI, Theeuwes JM, Zayatz LM, eds. Confidentiality, Disclosure
and Data Access: Theory and Practical Applications for Statistical
Agencies. Amsterdam, Netherlands: Elsevier Science pp.185–213 (2001).
-
Ayca
Azgin Hintoglu, Yucel Saygın, “Suppressing microdata to prevent classification
based inference”, ACM .pp. (2009).
|
| |
|
|
| |
|
|
| |
|
|
|