Gulfoss fault, Iceland
Separation
Separation
glycaem ia vs. azotaem ia
0 10 20 30 40 50 60 70 80 90
40 60 80 100 120 140
glycaemia (mg/dl)
azotaemia (mg/dl)
separa tion hype
rplane
a
1x
1
+ a
2
x
2
= b
(x
1’, x
2’)
a
1x
1’ + a
2x
2’ > b
(x
1”, x
2”)
a
1x
1” + a
2x
2” < b
d’ = a
1
x
1
’ + a
2
x
2
’ – b d” = b –
a
1x
1
” – a
2x
2
”
d
i> 0 x
i∈ P”
Separation
Problem Find a separation hyperplane H which lies as far as possible from two given sets P’, P” ⊆ IR
n(to be withdrawn)
Call d
ithe distance of H from x
i∈ P’ ∪ P”
max Σ d
i+ Σ d
ixi∈P’ xi∈P”
d
i= a
1x
1i+ a
2x
2i+ … + a
nx
ni– b x
i∈ P’
d
i= b – a
1x
1i– a
2x
2i– … – a
nx
nix
i∈ P”
d
i> 0 x
i∈ P’
optimal separator
a
1+ a
2+ … + a
n= 1
see the discussion on regression curvesSeparation
Problem Find a separation hyperplane H which lies as far as possible from two given sets P’, P” ⊆ IR
n(to be withdrawn)
x
1ia
1+ x
2ia
2+ … + x
nia
n– b > 0 x
i∈ P’
– x
1ia
1– x
2ia
2– … – x
nia
n+ b > 0 x
i∈ P”
optimal separator
a
1+ a
2+ … + a
n= 1 max Σ ( Σ x
ki– Σ x
ki) a
k+ (|P”| – |P’|) b
xi∈P’ xi∈P”
n
k=1
Separation
39 68
Lucio
67 67
Kevin
80 59
Jean
26 80
Igino
55 58
Harry
28 47
Giulio
37 112
Fabio
47 108
Ernesto
16 98
Davide
38 80
Claudio
44 94
Bruno
41 79
Antonio
azotaemia glycaemia
name
30 85
Zeno
28 85
Walter
26 127
Vittorio
26 112
Ugo
51 64
Tito
54 102
Silvio
39 97
Ramon
32 69
Qalbi
48 60
Piero
42 99
Oreste
44 81
Nicola
32 72
Mauro
azotaemia glycaemia
name
Separation
39 68
Lucio
67 67
Kevin
80 59
Jean
26 80
Igino
55 58
Harry
28 47
Giulio
37 112
Fabio
47 108
Ernesto
16 98
Davide
38 80
Claudio
44 94
Bruno
41 79
Antonio
azotaemia glycaemia
name
30 85
Zeno
28 85
Walter
26 127
Vittorio
26 112
Ugo
51 64
Tito
54 102
Silvio
39 97
Ramon
32 69
Qalbi
48 60
Piero
42 99
Oreste
44 81
Nicola
32 72
Mauro
azotaemia glycaemia
name
Separation
68a1 + 39a2 – b + dL = 0 L
67a1 + 67a2 – b – dK = 0 K
59a1 + 80a2 – b – dJ = 0 J
80a1 + 26a2 – b + dI = 0 I
58a1 + 55a2 – b + dH = 0 H
47a1 + 28a2 – b + dG = 0 G
112a1 + 37a2 – b – dF = 0 F
108a1 + 47a2 – b – dE = 0 E
98a1 + 16a2 – b – dD = 0 D
80a1 + 38a2 – b – dC = 0 C
94a1 + 44a2 – b – dB = 0 B
79a1 + 41a2 – b – dA = 0 A
dA + dB + dC + dE + … max
85a1 + 30a2 – b – dZ = 0 Z
85a1 + 28a2 – b – dW= 0 W
127a1 + 26a2 – b – dV = 0 V
112a1 + 26a2 – b – dU= 0 U
64a1 + 51a2 – b + dT = 0 T
102a1 + 54a2 – b – dS = 0 S
97a1 + 39a2 – b – dR = 0 R
69a1 + 32a2 – b + dQ = 0 Q
60a1 + 48a2 – b + dP = 0 P
99a1 + 42a2 – b – dO= 0 O
81a1 + 44a2 – b – dN= 0 N
72a1 + 32a2 – b + dM = 0 M
… + dT + dU + dV + dW+ dZ
a1 + a2 = 1 dA, …, dG, …, dZ > 0
Separation
glycaem ia vs. azotaem ia
0 10 20 30 40 50 60 70 80 90
40 60 80 100 120 140
glycaemia (mg/dl)
azotaemia (mg/dl)
sapara tion hype
rplane
18 x
1
+ 7 x
2
= 1 62 2
But what if a separation hyperplane does not exists?
Separation
39 68
Lucio
67 67
Kevin
80 59
Jean
26 80
Igino
55 58
Harry
28 47
Giulio
37 112
Fabio
47 108
Ernesto
16 98
Davide
38 80
Claudio
44 94
Bruno
41 79
Antonio
azotaemia glycaemia
name
30 85
Zeno
28 85
Walter
26 127
Vittorio
26 112
Ugo
51 64
Tito
54 102
Silvio
39 97
Ramon
32 69
Qalbi
48 60
Piero
42 99
Oreste
44 81
Nicola
32 72
Mauro
azotaemia glycaemia
name
Separation
68a1 + 39a2 – b + dL = 0 L
67a1 + 67a2 – b – dK = 0 K
59a1 + 80a2 – b – dJ = 0 J
80a1 + 26a2 – b + dI = 0 I
58a1 + 55a2 – b + dH = 0 H
47a1 + 28a2 – b + dG = 0 G
112a1 + 37a2 – b – dF = 0 F
108a1 + 47a2 – b – dE = 0 E
98a1 + 16a2 – b – dD = 0 D
80a1 + 38a2 – b – dC = 0 C
94a1 + 44a2 – b – dB = 0 B
79a1 + 41a2 – b – dA = 0 A
dA + dB + dC + dE + … max
85a1 + 30a2 – b – dZ = 0 Z
85a1 + 28a2 – b – dW = 0 W
127a1 + 26a2 – b – dV = 0 V
112a1 + 26a2 – b – dU= 0 U
64a1 + 51a2 – b + dT = 0 T
102a1 + 54a2 – b – dS = 0 S
97a1 + 39a2 – b – dR = 0 R
69a1 + 32a2 – b + dQ = 0 Q
60a1 + 48a2 – b + dP = 0 P
99a1 + 42a2 – b – dO = 0 O
81a1 + 44a2 – b – dN = 0 N
72a1 + 32a2 – b + dM = 0 M
… + dT + dU + dV + dW+ dZ
a1 + a2 = 1 dA, …, dG, …, dZ > 0
infea
sible
Separation
Problem Find a hyperplane H whose inequalities are violated by the least possible number of points in P’, P” ⊆ IR
nLet y
i∈ {0, 1} be a variable equal to 1 if and only if x
iviolates the inequality
min Σ y
i+ Σ y
ixi∈P’ xi∈P”
a
1x
1i+ a
2x
2i+ … + a
nx
ni– b + u y
i> 0 x
i∈ P’
b – a
1x
1i– a
2x
2i– … – a
nx
ni+ u y
k> 0 x
i∈ P”
y
i∈ {0, 1} x
i∈ P’ ∪ P”
optimal quasi-separator
a
1+ a
2+ … + a
n= 1
large numberSeparation
glycaem ia vs. azotaem ia
0 10 20 30 40 50 60 70 80 90
40 60 80 100 120 140
glycaemia (mg/dl)
azotaemia (mg/dl)