c++ 实现感知机算法/对偶算法

#include
using namespace std;
struct type_
{
int x[2];
int y;
};

int main()
{
bool check_(int w[2], int b, type_ x);
int update(int w[2], int &b, int &learning_ratio, const type_ x);
type_ xx[3] = {{{3, 3}, 1}, {{4, 3}, 1}, {{1, 1}, -1}};
int w[2] = {0, 0};
int b = 0;
bool flag=true;
int learning_ratio = 1;
while (flag)
{
for (int i = 0; i < 3; i++)
{
flag = false;
if (check_(w, b, xx[i]))
{
flag = true;
update(w, b, learning_ratio, xx[i]);
break;
}
}
}
cout << "w= " << w[0] << “,” << w[1] << ",b= " << b << endl;
return 0;
}
bool check_(int w[2], int b, type_ x)
{
int W;
W = w[0] * x.x[0] + w[1] * x.x[1] + b;
if (x.y * W <= 0)
return true;
else
return false;
}
int update(int w[2], int &b, int &learning_ratio, type_ x)
{
w[0] = w[0] + learning_ratio * x.y * x.x[0];
w[1] = w[1] + learning_ratio * x.y * x.x[1];
b = b + learning_ratio * x.y;
}
对偶：
#include
#include
using namespace std;
struct Date
{
int x1;
int x2;
int y;
};
int main()
{
vector<vector> Gram(3);
Date date[3] = {{3, 3, 1}, {4, 3, 1}, {1, 1, -1}};
int b = 0;
bool flag = true;
int a[3] = {0,0,0};
int learning_ratio = 1;
for (int i = 0; i < 3; i++)
for (int j = 0; j < 3; j++)
{
Gram[i].push_back(date[i].x1 * date[j].x1 + date[i].x2 * date[j].x2);
}
while(flag)
{
for (int i = 0; i < 3; i++)
{
flag = false;
int test = 0;
for (int j = 0; j < 3; j++)
{
test = test + a[j] * date[j].y * Gram[j][i]+b;
}
if (date[i].y * test <= 0)
{
flag = true;
a[i] = a[i] + 1;
b = b + date[i].y;
break;
}
}
}
int w[2] = {0};
for (int k = 0; k < 3; k++)
{
w[0] = w[0] + a[k] * date[k].y * date[k].x1;
w[1] = w[1] + a[k] * date[k].y * date[k].x2;
b = b + a[k] * date[k].y;
}
cout << “w[0]=” << w[0] << “,w[1]=” << w[1] << “,b=” << b << endl;
return 0;
}