Increase of Privacy Coefficient in Classification Based On Wavelet Transformation

Increase of Privacy Coefficient in Classification
based on Wavelet Transformation

M. Aamoot, S. Karbasi, and A. Faraahi
AbstractIn data mining, maintaining individuals privacy is one of the complicated issues, which must be noticed in data distribution
to conduct analysis. Thus, the main subject is the method of data values preservation while preserving existing data patterns in data
sets. In other words, data owners must be able to guarantee the reliability of results obtained from data mining in addition to preserv-
ing individuals privacy. In this research, data transformation method was proposed by implementing the haar wavelet transformation,
which preserves the features required for the K-Nearest Neighbor classification algorithm in addition to hiding private data. The results
obtained from conduction of the above method indicated that the proposed method not only enhanced the privacy coefficient but also
maintained classification patterns at an appropriate level.

Index TermsClassification, Data Mining, Privacy Preserving, Wavelet Transform

1 INTRODUCTION
ata mining is the process of extracting valid models
from data. It is one of ten knowledge in developing
that facing the next decade with the new revolution
and thus has spread extremely rapidly in world in recent
years. Data mining science with a wide range of specia-
lized sub fields by describe, explain, predict and control a
variety of phenomena, now has a very wide application
in various fields, including industrial, medical, communi-
cations, agriculture, energy, social, cultural, political, eco-
nomic, Commercial, military, educational and etc, so no-
wadays no boundaries and limits intended to its applica-
tion andusable fields of this knowledge is in all fields in-
volving the data.
Today in the information age with increased use of
new technologies, high volumes of personal data such as
credit information, shopping habits, medical history an-
detc collected and the amount of it are increasing day by
day [2]. Hence in this situation the use of appropriate so-
lutions for the classification and production of informa-
tion from bulk of data is essential and critical. In this situ-
ation, using technology such as data mining, as a mechan-
ism for extracting hidden knowledge from large volumes
of data to templates and models, more than ever neces-
sary [1].But analyzing data by use of data mining tech-
niques becomes real threat to privacy since data mining
techniques are able to derive knowledge from data which
is not even known to data owners[5].In order to overcome
this issue the data owners may decide not to share or
sharing some parts that leaves in trouble the extracting
knowledge[6]. Despite its benefit in a wide range of ap-
plications, data mining techniques also have raised a
number of ethicalissues such as privacy, data security,
intellectual property rights and etc [3]. Security is defined
as the right people have at the time, manner and extent of
use of their information by others. Privacy is defined, the
social right to know and the individual's right to private
life [23]. Data security and privacy, although often used
interchangeably, but they represent two different aspects
of data protection and various techniques have been de-
veloped for them. The goal here is to find a tradeoff be-
tween two incompatible goals: benefits from mining and
privacy. Endeavors to find a solution to this two-goal lead
to the creation of new branches was in data mining, with
name privacy preserving data mining. The main goal of
privacy preserving data mining, developing of algorithms
for data transformation, so that private data and know-
ledge before and after data mining, stay is private[24]. In
this situation presentingways that ensure the privacy of
individuals during the mining process, seems to be neces-
sary. The aim of this study is propose an approach, could
do classification as one of the data mining tasks by using
capabilities of wavelet transform, with preserving priva-
cy.
The rest of this paper is organized as follows. In Sec-
tion 2 will review related work. Basic concepts are de-
fined in section 3. The proposed method is discussed in
Section 4. Section 5 contains the results of simulation of
the proposed method and section 6concludes this paper.
2 RELATAED WORK
Till date, many techniques proposed in order to do priva-
cy preserving data minings. The related proposed me-
thods mainly dividing in two generic groups: data per-
turbation methods, and secure multi-party computations
[15]. Data perturbation refers to a data transformation
process typically performed by the data owners before
publishing data. The transformation process must be
done in a way that while disguising the sensitive infor-

M. Aamoot is with theEngineering Department, University of Payame
Noor, Tehran, Iran.
S.Karbasi is with the Department of Science, Golestan University, Iran.
A. Faraahi is with the Engineering Department, University of Payame
Noor, Tehran, Iran.

D
2011 Journal of Computing Press, NY, USA, ISSN 2151-9617
http://sites.google.com/site/journalofcomputing/
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 1, JANUARY 2012, ISSN 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 59

mation contained in the published data, required charac-
teristics of data mining algorithms (eg, Euclidean dis-
tance, etc.) are also be preserve in best until after apply
the data transformation methods need not make changes
in available data mining algorithms[1]. This means that
existing methods of data transformation during the pre-
serve privacy must be care accuracy of data mining re-
sults. In some perturbation techniques, although recon-
structing of the original data distribution is possible, but
distances between data points are not preserved. There-
fore, these methods are not suitable for Euclidean dis-
tance-based data mining algorithms such as classification.
Besides, they do not generally focus on data reduction.
Examples of these methods in [2], [7] and [8] are shown.
The secure multi-party computation does data reduction
by using cryptography methods [12], [13] or by sharing
intermediate results of data mining algorithms [9], [10]
and [11]. But intermediate results of each algorithm are
different and are often difficult to generalize to other min-
ing algorithms. Also, the use of these methods requires
modification in the data mining algorithms and mainly
distributed.
Depending on the weak performance of pervious two
groups for use in Euclidean distance-based data mining
algorithms such as classification, such techniques with
considering Euclidean distance as the measure of similari-
ty between data values have been proposed.
In [3] the use of geometric transformation is proposed.
This transformation is: translation, rotation and scaling
that preserve Euclidean distance, but, since the transform
is the same for all records, if third party can discover the
original values of one record, all original records can be
fully reconstructed. Therefore, these methods have not
been adequate security, also dimensionality reductions
are not considered. Another method proposed in [14], is
use of random projection. It reduces the dimension of
data from m to k. It is observed that Euclidean distance is
often distorted to a great extent using this method when k
is small. Thus, despite the random projection reduce the
dimensions of data, did not preserve the Euclidean dis-
tance properly. Besides, by increasing the number of data
records, the execution time of it, increases. Using of
Fourier transform is introduced in [15]. This method con-
verts data from original domain to a different domain.
Despite this method preserve Euclidean distance between
data points and dimensionality reduction, the execution
time is longer than the wavelet transform. Wavelet trans-
form in [16], [17] has been used as another way to trans-
form data. But none of them used Euclidean distance as
similarity measure between data values. To the best of
knowledge gathered from literature, use of wavelet trans-
form for classification with considering Euclidean dis-
tance as similarity measure have not been proposed till
date. Thus it seems necessary propose a method can do
classification with preserving privacy based on Euclidean
distance by using wavelet transform.
3 BASIC CONCEPTS
3.1 Wavelet transforms
In this section the basic concepts needed to understand
and use wavelets will be discussed. The first question in
this section is that, what is Wavelet? Simply speaking, a
mother wavelet is a function (x) such that
{(2
j
x - k), i, k Z] (1)
is an orthonormal basis of L
2
(R)[18].
The term wavelet means a small wave. The smallness
refers to the condition that we desire that the function is
of finite length or compactly supported. The wave refers
to the condition that the function is oscillatory. The wave-
let transform is a synthesis of ideas that emerged over
many years from different fields, such as mathematics
and signal processing. Generally speaking, the wavelet
transform is a tool that divides up data, functions, or op-
erators into different frequency components and then
studies each component with a resolution matched to its
scale. A wavelet transformation converts data from an
original domain to a wavelet domain by expanding the
raw data in an orthonormal basis generated by dilation
and translation of a father and mother wavelet [18].
A wavelet can own many attractable properties, in-
cluding the essential properties such as compact support,
vanishing moments, multiresolution and hierarchical
analysis, linear space and time complexity, decorrelated
coefficients and dilating relation and being a generator of
an orthonormal basis of functions. Compact support
guarantees the localization of wavelets. In other words,
processing a region of data with wavelets does not affect
the data out of this region. Vanishing moment guarantees
wavelet processing can distinguish the essential informa-
tion from non-essential information. With decorrelated
coefficients wavelets have ability to reduce temporal cor-
relation so that, the correlation of wavelet coefficients are
much smaller than the correlation of the corresponding
temporal process. Hence, the wavelet transform could be
able used to reduce the complex process in the time do-
main into a much simpler process in the wavelet domain
[18]. It is the requirements of localization, hierarchical
representation and manipulation, feature selection, and
efficiency in many tasks in data mining that make wave-
lets is a very powerful tool.
Another important feature of wavelets is Parseval
theorem which is defined as follows. Assume that e L
2

and
I
be the orthonormal basis of L
2
. The Parsevals
theorem states the energy, which is defined to be the
square of its L
2
, is preserved under the orthonormal
wavelet transform.
e
2
2
= |e,
I
|
2
I
(2)
These properties could provide considerably more effi-
cient and effective solutions to many data mining prob-
lems. First, wavelets could provide presentations of data
that make mining process more efficient and accurate.
Second, wavelets could be incorporated into the kernel of
many data mining algorithms. The novelty of the ap-
proach lies in the fact that it does not depend on modify-

ing the mining algorithms themselves but just prepares
the data that can then directly be fed to these available
algorithms.
Discrete wavelet transforms (DWTs) divide an input
signal into two components at each level. These compo-
nents are calledapproximations and details coefficients
and represent low-frequency and high-frequency subsig-
nals of the original signal, respectively. The approxima-
tion coefficient can be recursively decomposed into high-
er-level and lower-level resolution subsignals, thereby
enabling analysis at multiple resolutions. In many signals
because the identity information are kept in low-
frequency component, these components have great im-
portance [17].

3.2 Haar wavelet
One of the most widely used types of wavelets in com-
puter science is haar wavelet. This type of wavelet aside
from high power, easy understandable and compute of
them is quite easy. Haar transform can be viewed as a
series of averaging and differencing operations on a dis-
crete function. We compute the averages and differences
between every two adjacent values of f(x) [19]. The moth-
er wavelet of haar wavelet transformation is as follows:

(x) = _
1 u < x < u.S
-1 u.S < x < 1
u otbcrwisc
(3)

And the scaling function of it defined as follows:
(t) = ]
1 u < t < 1
u otbcrwisc
(4)

We want to have a decomposition that is fast to com-
pute and requires little storage for each sequence. The
Haar wavelet is chosen for the following reasons: 1) it
allows good approximation with a subset of coefficients,
2) it can be computed quickly and easily, requiring linear
time in the length of the sequence and simple coding, and
3) it preserves Euclidean distance [19]. In general, trans-
formations using the simple Haar wavelet not only pro-
vide comparable accuracy in classification, but are also
more difficult to breach [17].
4 PROPOSED METHOD
The proposed method was presented by considering
wavelet transformations features, which were discussed
in the previous section. In presentation of this method,
two parameters of accuracy and privacy were taken into
account. The main purpose for applying wavelet trans-
formation for privacy preservation in conducting classifi-
cation through KNN Algorithm was inspired by the fol-
lowing facts:
1) An inverse wavelet transform can convert data form
wavelet domain to the original domain. Therefore, wave-
let transformation and inverse wavelet transformation are
transformations without losing data or the main data
quality irrespective of computer errors. In other words,
wavelet transformation preserves datastructure. In addi-
tion, Parseval theory guarantees that Euclidean distance
between data points in wavelet transformation does not
change [18]. Concerning this attribute, it can be expected
that the K-Nearest Neighbor Classification Algorithm,
whose major need is Euclidean distance, performs on the
transformed data set with enough accuracy as well.
2) As it was mentioned in the aforementioned section,
wavelet transformation divides signal into two compo-
nents of the approximation coefficients (low-frequency
components) and detail coefficients (high-frequency
components) at every level. In this condition, the main
signal is retrievable at every level providing that the ap-
proximation and details coefficients at that level and all
previous levels are preserved. Fig.1 illustrates the decom-
position process phases at various levels.
Asit is observed in the Fig.1, the main signal was de-
composed into two components of cA1 cD1at the first
level, which were indicative of the approximation coeffi-
cients (cA1) and details coefficients (cD1). In this figure
the dependency of retrieval process on details coefficients
at each level is presented.
Therefore, considering the fact that identity informa-
tion of signals are maintained in components with low
frequency and the fact that components with high fre-
quency are exclusively utilized for preservation of deli-
cate and precise points and lack any basic information of
signal, they can be deleted.By removing details coeffi-
cients and due to dependency of reconstruction process
on existence of details coefficients at each level, it was-
completely impossible to retrieve the main data and pri-
vacy of data values was preserved. Furthermore, the data
remain efficient due to preservation of the approximation
coefficients, which contain basic information.

4.1 Proposed Algorithm
The pseudo code of proposed algorithm is as follow:
(1) for each record i in Dataset without Class Label Attribute
(2) convarr(cAi , cDi) = Transform(record(i))
Fig.1.Decomposition levels in wavelet transform

(3) fconvarr(i) = Delete Detail coefficient (convarr(cAi))
(4) end
(5) for each record i in fconvarr
(6) finalarr(i) = concatenate(record(i),class-label)
(7) end
(8) specify a random order for final attributes
(9) send the transformed dataset to third party
In the above mentioned algorithm, first, the class labels of
data records were separated from them and Haar Wave-
let Transformation was performed on each data record
existing in data collection with the purpose of obtaining
wavelet coefficients. Then, details coefficients were oblite-
rated in order to preserve privacy. Since classification is a
controlled data mining approach, class labels were added
to data records before generating new data collection.
Afterward, the arrangements of attributes were changed
in line 8 for privacy intensification purposes. Consequent-
ly, the final data collection was sent to third party.
5 EXPRIMENTAL RESULTS
In this section, the results of simulation were presented in
order to assess the hypothesis offered based on the as-
sumption that wavelet transformation preserves classifi-
cation patterns (distance between data points) and data
privacy. In analysis of results, two factors of accuracy and
preserving privacy of data set were taken into considera-
tion before and after transformation. The simulation in
question was conducted by Matlab software, wavelet tool
box, in order to implement and carrying out the proposed
method on data sets, and Weka data mining software was
applied for performing classification through KNN me-
thod.

5.1 Data Sets
All assessments have been done on four data sets taken
from UCI Machine Learning Repository [20]. These data
sets include Iris, Pendigits, Letter-Recognition and Wall-
Following-Robot-Navigation. Features of each data set
are shown in the Table 1.

Table 1.Characterstic of Data Sets
data set number of data
type
record feild class
Iris 150 4 3 Real
Wall-Following-
Robot-Navigation
5456 24 4 Real
Pendigits 10992 16 10 Integer
Letter-Recognition 20000 16 26 Integer

5.2 Accuracy Measure
Accuracy of classification process for original data and
data obtained after transformation were taken into ac-
count for examining classification quality. For this reason,
KNN method was used for performing classification of
data set. In calculation of accuracy, a parameter called F-
measure was implemented.F-measure can be calculated
through Precision and Recall measures, which are
defined as follows:
Precision, p =
1P
PP+1P
(5)
Recall, r =
1P
PN+1P
(6)
F - mcosurc =
2p
+P
(7)
In fact F-measure the harmonic mean between Preci-
sion and Recall. Take two real numbers of a, b to show
the concept of harmonic mean. Harmonic mean of c is
between two numbers in interval of [a, b], which can be
calculated via(c-a)/a = (b-c)/b relationship. In fact, the
harmonic mean is closer to the smaller number.

5.3 Privacy Measure
As it was mentioned earlier, in the proposed method, it is
impossible to reconstruct the details of the main signal
due to removal of coefficients. In addition, due to dimen-
sionality reduction, the resultant data after transforma-
tion are completely different from the preliminary data.
However, there is need for a kind of measure, which pri-
vacy can be expressed based on it. There have been plenty
of approaches presented in this field for measuring priva-
cy:
1. utilization of confidence interval
2. employemtn of information theory
3. application of privacy concept violation
4. Data values variance.

In [4] the imperfection of the first measure was demon-
strated. Furthermore, information theory is not appropri-
ate for Euclidean distance due to the fact that only value
distribution is considered as the evaluation measure. The
third measure assumes the worst scenario case; however,
the current research concentrates on the average case.
Moreover, considering the sizes of data dimensions,
number of attributes before and after transformation was
not same. Therefore, in this section, a type of measure is
required, which is only dependent on the main data and
the resultant data after transformation.
Concerning the above-mentioned material, we imple-
mented the variance between the original values and
transformed ones in assessment of the level of privacy
preservation [21], [22]. For this purpose, the attributes
variances were measured before and after transformation,
and mean of them was measured for determining the
whole collections privacy.

5.4 Methodology
In the proposed approach, considering the fact that classi-
fication was a supervised method and required class labe-
ling, the class label for data collection, which was sepa-
rated before performing transformation and then added
to the data collection after transformation, was sent to the
third party. Since the distance between data records is the
basis for classification in KNN classification algorithm,
the dimensionality reduction was carried out in column
major in order to preserve the distances between
records.In the conducted evaluation, the dimensionality
reduction rate was measured 50% using Haar wavelet
transformation and because field titles could not be dis-
tinguished after transformation, the applied titles were
optional and no given basis was implemented for labeling
them.
In the proposed approach, downsampling method was
used for producing wavelet coefficients (approximation
and details).In this approach since the generated coeffi-
cients each are half the main signal length; therefore, by
removing details coefficients, 50% was eliminated from
the main signal and that was the reason for dimensionali-
ty reduction up to 50% in this approach.

5.5 Results of Classification Accuracy
For analyzing the proposed approach, it was applied on
each one of the four data sets. Subsequently, KNN algo-
rithm was implemented for these collections before and
after transformation. The values 1, 5, and 10 were
adopted for K in KNN Classification Algorithm to
achieve better and more precise results. The results ob-
tained from application of the proposed approach and
KNN algorithm are presented in the following diagrams
and tables.

Fig.4. Accuracy of Wall-Following-Robot-Navigation data set
Fig.2. Accuracy of Iris data set
Fig.3. Accuracy of Pendigits data set
Fig.5. Accuracy of Letter-Recognition data set

Table 2. Accuracy of data sets with different figures of K

In the Table 2, the measured accuracy for different figures
of K is presented. The applied numbers demonstrate the
accuracy measure for the whole data set. The existing
numbers in the Table 2indicate that the proposed ap-
proach not only reduced data dimensions but also pre-
served Euclidean distance between data values efficiently.

5.6 Results of Privay Preservation
In this section, the proposed approach was utilized on
each of the four data sets for examining the impact of
wavelet transformation on privacy. Table 3indicates the
obtained results for each of the four data sets. As it can be
observed from the above table, the level of privacy after
performing transformation had a considerable boost.

Table 3. Increase Privacy Coefficient
Data Set Privacy Increase
or De-
crease
Before trans-
formation
After trans-
formation
Iris 1.14 1.77 55.26%
Wall-
Following
1.614 2.216 37.27%
Pendigits 929.67 1209.804 30.13%
Letter-
Recogni-
tion
5.34 6.52 22.10%

6 CONCLUSION
In this paper, an approach was proposed for carrying out
classification while preserving privacy through Haar
Wavelet Transformation. The results obtained from simu-
lation of the proposed method indicated the applicability
of this approach in preserving Euclidean distance be-
tween data points, which was the key requirement of data
mining algorithms based on Euclidean Distance. Fur-
thermore, the resulting data thoroughly differ drastically
from the original data as a result of the performed trans-
formation. In this approach, due to removal of details
coefficients, there was no possibility of retrieving the orig-
inal data. Moreover, the data obtained after transforma-
tion wasfunctional for the existing data mining algo-
rithms and there was no need for modifications in the
existing algorithms or creating a new algorithm.

REFERENCES
[1] Aggarwal CC, Yu PS, Privacy-Preserving data mining, models and
algorithms. Advances in database Systems, vol.34. Springer; 2008.
[2] Agrawal R, Srikant R, Privacy-preserving data mining, Proceedings
of the 2000 ACM SIGMOD Conference on Management of Data, Dal-
las, TX, pp. 439-50,2000.
[3] Oliveira S. R. M, Zaiane O. R, Privacy preserving clustering by data
transformation, Proceedings of the 18th Brazilian Symposium on Da-
tabases, Manaus, Amazonas, Brazil, pp. 304318, 2003.
[4] Agrawal D, Aggarwal D, On the design and quantification of privacy
preserving data mining algorithms, Proceedings of the 20th ACM
Symposium on Principles of Database Systems, pp. 247255, 2001.
[5] Bertino E, Sandhu R, Database security-concepts, approaches and
challenges, IEEE Trans, Dependable Secure Computing.,Vol 2,2-19
2005.
[6] Castro E, Brankovic V. and L., Data swapping: Balancing privacy
against precision in mining for logic rules, Proceedings of Data Ware-
housing and Knowledge Discovery Dawak99, Aug.30-Sept.1, Florence,
Italy, pp: 389-398, 1999.
[7] Machanavajjhala A., Gehrke J., Kifer D. -diversity: Privacy beyond k-
anonymity,IEEE ICDE Conference, 2006.
[8] Sweeney L, k-Anonymity,A model for protecting privacy, Interna-
tional Journal on Uncertainty Fuzziness and Knowledge-based Sys-
tems, 2002.
[9] Merugu, S, Ghosh, J, Privacy-preserving distributed clustering using
generative models, 3rd IEEE international conference on data mining
(ICDM03) pp. 211218. Melbourne, 2003.
[10] Vaidya, J.S, Clifton C, Privacy-preserving k-means clustering over
vertically partitioned data. Nineth ACM SIGKDD international confe-
rence on knowledge discovery and data mining, pp. 206215, Washing-
ton D.C,2003.
Data set Accuracy before transformation Accuracy after transformation
K=1 K=5 K=10 K=1 K=5 K=10
Iris 95.33% 95.33% 96% 95.33% 97.33% 94.66%
Wall-Following 88.17% 86.07% 83.92% 87.55% 85.24% 82.56%
Pendigits 99.36% 99.26% 99.02% 95.56% 95.56% 94.92%
Letter-Recognition 95.95% 95.48% 94.74% 84.95% 84.02% 83.09%

[11] Vaidya, J.S, Clifton C, Privacy preserving association rule mining in
vertically partitioned data, ACM SIGKDD 02, pp. 639644. Edmon-
ton,2002.
[12] Dwork, C,Nissim, K, Privacy-preserving data mining on vertically
partitioned databases, CRYPTO, pp. 528544,2004.
[13] Lindell, Y., Pinkas, B, Privacy preserving data mining. Advances in
Cryptology, (CRYPTO00), Lect. Notes Comput. Sci. 180, 3653,2000.
[14] Liu K, Kargupta H, Ryan J, Random projection-based multiplicative
perturbation for privacy preserving distributed data mining, IEEE
Transactions on Knowledge and Data Engineering, pp.92106, 2006.
[15] Mukherjee S, Chen Z, Gangopadhyay A, A Privacy Preserving Tech-
nique for Euclidean Distance-Based Mining Algorithms Using Fourier-
Related Transforms, The VLDB Journal, pp.293315, 2006.
[16] Lian Liu, Jie Wang and Jun Zhang, Wavelet-based Data Perturbation
for Simultaneous Privacy-preserving and Statistics-
preserving,proceedings of the 2008 IEEE International Conference on
Data Mining (ICDM 08) - Workshops, ICDMW. The 2nd Workshop on
Reliability Issues in Knowledge Discovery. pp. 27-35, Pisa, Italy, De-
cember 15, 2008.
[17] Bapna S, Gangopadhyay A, A Wavelet-Based Approach to Preserve
Privacy for Classification Mining, Decision Sciences,Volume 37 Num-
ber 4,2006.
[18] Tao Li, Qi Li, Shenghuo Zhu, A survey on wavelet applications in data
mining, SIGKDD Explor, Newsl, pp.49-68, 2002.
[19] Chan K. P, Fu A.W, Efficient time series matching by wavelets, In
Proceedings of the 15th International Conference on Data Engineering,
pp.126 133, 1999.
[20] http://archive.ics.uci.edu/ml.
[21] N. R. Adam, J. C. Worthmann,Security-Control Methods for Statistical
Databases: A Comparative Study, ACM Computing Surveys,
21(4):515556, December 1989.
[22] M. J. Culnan, HowDid They GetMy Name?: An Exploratory Investi-
gation of Consumer Attitudes Toward Secondary Information, MIS
Quartely, 17(3):341363, September 1993.
[23] Josep D.F, Vicen T., Privacy in Data Mining, Springer Science, Data
Mining and knowledge Discovery,11, pp.117-119, 2005.
[24] Verykios S, Bertino E, Fovino I, Provenza L, Saygin Y, Theodoridis Y,
State-of-the-art in privacy preserving data mining, ACM SIGMOD
Record, pp. 50-57, 2004.


Increase of Privacy Coefficient in Classification Based On Wavelet Transformation

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Increase of Privacy Coefficient in Classification Based On Wavelet Transformation

Uploaded by

Copyright:

Available Formats

Increase of Privacy Coefficient in Classification

based on Wavelet Transformation

You might also like