• Nie Znaleziono Wyników

Clustering Methods Applied to Reduce the Training Sample Size in Support Vector Machines

N/A
N/A
Protected

Academic year: 2021

Share "Clustering Methods Applied to Reduce the Training Sample Size in Support Vector Machines"

Copied!
11
0
0

Pełen tekst

(1)

A C T A U N I V E R S I T A T I S L O D Z I E N S I S

FO LIA O ECONOM ICA 225, 2009

Joanna Trzęsiok

THE WAVELET TRANSFORM IN REGRESSION

A b stract

The wavelet transform was introduced in the 1980’s and it was developed as an alternative to the short time Fourier transform. The wavelets theory is very popular in signal processing and pattern recognition and its applications are still growing.

This paper presents the wavelet transform in nonparametric regression. The use o f wavelets in statistical applications was pioneered by D. Donoho and I. Johnstone. Here we discuss their methodology - wavelet shrinkage. The wavelet transform is compared with another nonparametric regression method - splines.

Key w ords: wavelets, wavelet transform, wavelet thresholding, nonparametric regression.

1. Introduction

The subject o f the regression analysis is a set o f observations:

U = {(x„y,):i =

We look for a function

f

which describes the connection between the response

Y

and the predictor X :

Y = f ( X ) + s (1)

where

e

is an error rate (noise).

There are m any ideas for solving the problem. Am ong them there is a fast developing group o f methods called nonparam etric m ethods o f regression. In these methods we do not have to make any assum ptions about

(2)

the distribution o f a variable X . They produce models which are often better fitted to the data than functions obtained by the least squares method. N onparam etric m odels are more robust and resistant against outliers. The wavelet estim ation m ethodology is one o f the nonparam etric methods o f regression.

Wavelets are applied in a diverse set of fields, such as signal processing, pattern recognition, data compression, and numerical analysis. This methodology includes a wide range o f tools, such as the wavelet transform, multiresolution analysis or wavelet decomposition.

Wavelet methods were introduced to statistics by D. D o n o h o and I. J o h n s t o n e in 1994. They developed the procedure based on the wavelet transform and thresholding for approxim ating an unknown function / .

2. O rthon orm al basis function

In signal processing, a popular approach for approximating a univariate function is to use orthonormal basis functions g,(x), i.e. functions satisfying following condition:

o,

1, if i - j

* j (2)

We seek a function / in an additive form:

f ( x ) = Y , W j - g j ( x ) i-1

(3 )

Finding this function is equivalent to estimating values o f parameters ил We get the values o f parameters Wj by minimizing theoretical risk:

R (

w ) = o-2 + J

f ( x ) ~ Y uwJ g j (x) j- 1

dx (4 )

w h e r e / i s an unknown function in (1), and cr2 denotes the noise variance. Solving this problem leads to:

(3)

We cąnnot evaluate (5), because the target function / is unknown. We estimate w . using the given training set U:

* ./= 7 7 £ Я '£ ;(* /) for j = (6) N /-i

The wavelet transform is defined as a decomposition o f the fu n ctio n /u sin g a specified set o f orthonormal basis functions.

3. W avelets

In this section we present the construction o f the set o f orthonormal basis functions - wavelet functions. We start with defining the mother wavelet as a function у/ satisfying the following conditions:

1) j V ( x ) r / x = 0,

2) jV2(x)ifc<°o» ( ^ e Z 2(R)).

The examples o f mother wavelet functions are:

• Ilaar wavelet - used only in theoretical examples and illustrations.

m ó >< о > d Ю 9 --- 1---1-0 .1---1-0 0.2 0 .4 0.6 0 .8 1.0 H a a r w a v e le t

Fig. I . Haar wavelet

Doublets - the first type o f continuous wavelet with compact support

(4)

Fig. 2. Three different Daublcts (with different param eter settings)

Symmlets - an “nearly symmetric” equivalent o f Daublets also

constructed by Ingrid Daubechies.

Fig. 3. Four different Symmlets (with different param eter settings)

Let us assume that a set o f functions i//a h is generated from mother wavelet through scaling and translation:

(5)

V «

x - b

K a J (7 )

where a > 0 is a scale factor and b > 0 is a translation parameter. When a gets larger, i//a b gets shorter and more spread out. Functions i//u b defined by (7) are called wavelet functions.

The wavelet functions y/a b are orthonormal functions in L2 ( R )

( C h e r k a s s k y et al., 1998). So we can approximate a target function f as in (3) by: f ( x ) = Y Jwj --T = -y / j-1 x - b . V aJ J (8)

We can estimate the parameters o f the function (8) by minimizing the loss function L ( y , f ( x ) ) over the training sample U :

(w ,á, b) = arg min J L{yt, f ( x t))

w.a.b /“ 1 (9 )

To solve the optimization problem (9) we can apply adaptive methods, e.g. the gradient descent method. Here we present a common nonadaptive implementation o f wavelet basis function expansion that uses a basis function with fixed scale and translation parameters:

Uj = 2 J where j - 0,1, ..., J - 1 bj = к ■2 ~J where к = 0,1, ..., 2 J - 1

Then substituting (10) into (7) we obtain:

Ya,,bl (x ) = 4/ j , Á x ) = 2 2 ■4/ (2 Jx - k )

The orthogonality o f y/j k is easy to check. It is apparent that:

\y/J k ( x ) -4/ r k ,(x)dx =

-(

10

)

(1 1)

[1, if

j = j ' л к = к \

[o, if

j Ф j ' v к * k '

(

12

)

Thus the set {i//j k : j e Z , k e Z } defines an orthonormal basis for L2(R)

(6)

4. T he w avelet transform

Given the wavelet functions o f the form (11) we obtain approximation of the target function / :

/ ( * ) = Ž Ż wj c '2V (2Jx - k ) (13)

y-0 A=0

The formula (13) defines the wavelet transform o f a function / . Coefficients wjk in (13) have the following form:

wjk = \ f ( x ) - ^ j , k ( x ) d x (14)

Hence the target function / is unknown we estimate the values o f parameters wjk by wjk using the training set:

1 N

'Zyi-rjM

(

15

)

/v i=i

5. T he w avelet th resholdin g

The presence o f noise in the training data set implies the values o f many coefficients wjk close to zero. It is connected with the problem o f overfitting the data. Donoho and Johnstone addressed the issue with wavelet thresholding. There are two popular approaches to it:

a) “hard" thresholding where all wavelet coefficients smaller than a certain threshold в are set to zero:

™]к =™jk -I{\ wjk \ >0 ) (16)

b) “s o ft " thresholding, where:

w 5Jk = s g n ( wJk) • m a x {0, | wy k \ - в ) (17)

There are many ideas for choosing the value o f the threshold 0 , e.g. a very popular formula:

0 - < y - ^ 2 \ n N (18)

where N is the number o f observations in the data set and a is the standard deviation o f noise (usually estimated from the data).

(7)

Summarizing, the regression function has the form o f wavelet decom-position:

/ M = I Z 4 ' 2 V ( 2 ' * - i ) (19)

j=0 к *0

where wsJk are adjusted coefficients given by the formula (16) or (17).

6. E xam ple o f app lication o f w avelet tran sform

For the illustration o f the wavelet transform and wavelet thresholding we conduct computation on the bev data set. This set contains the well-known

Beveridge Wheat Price Index which gives the annual price data from 1500 to

1869, averaged over many locations in western and central Europe. It is an univariate time series with 370 observations (Fig. 4).

Time

Fig. 4. Plot o f the bev time series

D. Donoho and I. Johnstone developed the WaveShrink procedure estimating an unknown function f . WaveShrink is able to remove the noise from the time series while preserving the spike. Traditional noise reduction methods, such as splines, would result in some smoothing o f the spike.

(8)

The WaveShrink procedure can be presented as follows:

1) Apply the wavelet transform (decomposition) o f observations from the

bev set.

2) Threshold the wavelet coefficients towards zero. 3) Use the wavelet reconstruction as an estimate / .

The process o f shrinking coefficients is much like the process o f keeping only important coefficients o f wavelet decomposition.

Coefficients of wavelet transform

ф

Translate

Daub cmpct on ext. phase N=2

Adjusted coefficients

<B Ct

Translate

Daub cmpct on ext. phase N=2

Fig. 5. Coefficients o f wavelet transform for the bev series (upper plot) and shrinking coefficients o f wavelet transform (lower plot)

Figure 5 presents coefficients of the wavelet transform o f observations from the bev data set and adjusted coefficients given by the “hard” thresholding procedure. Figure 6 displays the estimating function / via the WaveShrink

(9)

W a v ele t tran sfo rm

Time

Fig. 6. Estimating fu n c tio n /v ia the wavelet transform for the bev series

Splines

Tim e

(10)

For a comparison o f the results o f the wavelet transform and thresholding procedure other nonparametric methods for regression are presented. Here is the splines method. Estimating an unknown function / v i a splines is illustrated in Fig. 7.

The goodness o f fit o f model / , obtained by WaveShrink procedure, was measured with the use o f a coefficient R 2 . For a comparison purpose, R2 is also

calculated for the splines model. The results are collected in Table 1.

T a b l e 1 Accuracy o f the various regression models

Model Wavelet Transform Splines

R2 0.738 0.956

S o u r c e : own study.

The model obtained with a use o f the wavelet transform has lower accuracy than the splines model, but it preserves the spike in the bev time series.

R eferences

B r u c e A., G a o H.-Y. (1996), Applied wavelet analysis with S-Pltis, Springer-Verlag, New York.

C h e r k a s s k y V., M u l i e r F. (1998), Learning fro m data - concepts, theory, and methods, John W iley & Sons, Inc., New York.

D o n o h o D., J o h n s t o n e I. (1994), Ideal spatial adaptation via wavelet shrinkage, „Biom etrika”, 81: 425-455.

D o n o h o D., J о h n s t о n с I. (1995), Adapting to unknown sm oothness via wavelet shrinkage, „Journal o f the American Statistical A ssociation”, 90: 1200-1224.

H a s t i e T., 1 i b s h i r a n i R . , F r i e d m a n J. H. (2001), The elem ents o fs ta tistic a l learning, Springer-Verlag, New York.

Joanna Trzęsiok

Z astosow an ie transform acji falkow ej

do bu dow y m odeli regresyjn ych

Transform acja lalkowa zostala zaproponowana na początku lat osiem dziesiątych, jako alternatywa do transformacji Fouriera. Metoda ta szybko znalazła swoje zastosow anie w teorii sygnałów oraz w rozpoznaw aniu obrazów, a zakres jej aplikacji nadal dynam icznie się rozwija.

(11)

Autorami pionierskich prac z zakresu zastosowań teorii falek w statystyce są David Donoho and lain Johnstone. Zaproponowali oni w roku 1994 procedurę WaveShrink w ykorzystywaną do estymacji funkcji gęstości oraz budowy nieparametrycznych modeli regresji opartą na transformacji lalkowej.

W artykule przedstawione zostało zastosowanie transformacji falkowej oraz procedury

WaveShrink do budowy modelu regresyjnego. O m aw ianą metodę porów nano z inną

Cytaty

Powiązane dokumenty

Idea wychowania narodowego w poglądach Wincentego Lutosławskiego // W: 62. Wincenty Lutosławski 1863–1954, Materiały z Posiedzenia Naukowego PAU w dniu 19. – Tłumaczenie z

Przyzwyczailiśmy się wprawdzie, że literatura romantyczna jest wieloznaczna, że otwiera się na nowe odczytania, ale jej wieloznaczność, jak to ma miejsce w przypadku

Therefore, Theorem 4.3 may be generalized to all line graphs of multigraphs which possess maximal matchable subsets of vertices – for example, the line graphs of multigraphs

Four theorems of Ahmad [1] on absolute N¨ orlund summability factors of power series and Fourier series are proved under weaker

These notions were intended as a refinement to the Nielsen theory of periodic orbits in that isotopy is much stronger than homotopy for closed curves in 3-manifolds, hence an

ANNALES SOCIETATIS MATHEMATICAE POLONAE Series I: COMMENTATIONES MATHEMATICAE X IX (1976) ROCZNIKI POLSKIEGO TOWARZYSTWA MATEMATYCZNEGO.. Séria I: PRACE MATEMATYCZNE

This invariant takes a value less than or equal to 1 for compact metric spaces that are Lipschitz isomorphic to ultrametric ones.. Furthermore, a theorem is provided which makes

Concerning the present problem - the problem clearly is the giving of a satisfactory account of the relation between Fact and Norm, if facts are facts and norms are norms how are