Upload
aideen
View
36
Download
1
Embed Size (px)
DESCRIPTION
Working Set Selection - a faster approach. R92922006 鄭先廷 R92922054 李明翰 R93922071 李德軒 D90942011 陳冠廷. Outline. The faster approach Algorithm Experimental Result vs. libsvm. Faster approach. - PowerPoint PPT Presentation
Citation preview
Working Set Selection- a faster approach
R92922006 鄭先廷R92922054 李明翰R93922071 李德軒D90942011 陳冠廷
Outline
The faster approach Algorithm Experimental Result vs. libsvm
Faster approach
There exists a decomposition algorithm that, given the current feasibl
e solution x and ∆f(x) in the beginning of the next iteration, computes an (1/m^2)-rate pair for x in O(m) steps
Algorithm
index
+
μ
…..
…..
31
12
1
13
> max∆f(x)+ ? 10.0
7
3
1
…..2m
€ μ+ / μ-
_
+
_
< min∆f(x)- ?
> max∆f(x)+ ?
< min∆f(x)- ?
> max( {max∆f(x)+ - min∆f(x)- }μ )?
> max( {max∆f(x)+ - min∆f(x)- }μ )?
> max( {max∆f(x)+ - min∆f(x)- }μ )?
Experimental Result
a1a twonorm image banana ringnorm
# of train data 29589 7000 1010 4900 7000
libsvm Our libsvm Our libsvm Our libsvm Our libsvm Our
Accuracy(%)
83.49 75.88 52 49.95 57.32 57.42 43.59 42.38 49.38 50.61
Time(sec) 826.18 55.96 17.2 4.97 568.35 9.87 258.02 2.54 25.23 5.04
Iteration 115295 142 719 5 184825 26 6068 5 640 5
811 143 7108 1213 128
diabetes splice titanic tree waveform
# of train data 300 2175 2051 11692 4600
libsvm Our libsvm Our libsvm Our libsvm Our libsvm Our
Accuracy(%) 71.33 51.66 52 52 67.43 68.79 78.21 80.29 77.80 70.15
Time(sec) 202.4 3.94 388.56 28.97 22.46 2.01 421.04 9.29 23.58 4.80
nSV 71525 20 7790 5 314 9 1285518 334 1290 5
3576 1558 34 3848 258