感知器算法 C++
We can estimate the weight values for our training data using stochastic gradient descent.
Stochastic gradient descent requires two parameters:
- Learning Rate: Used to limit the amount each weight is corrected each time it is updated.
- Epochs: The number of times to run through the training data while updating the weight.
These, along with the training data will be the arguments to the function.
There are 3 loops we need to perform in the function:
- Loop over each epoch.
- Loop over each row in the training data for an epoch.
- Loop over each weight and update it for a row in an epoch.
As you can see, we update each weight for each row in the training data, each epoch.
The loop is over until:
the iteration error is less than a user-specified error threshold or
a predetermined number of iterations have been completed.
Weights are updated based on the error the model made. The error is calculated as the difference between the expected output value and the prediction made with the candidate weights.
Notice that learning only occurs when an error is made, otherwise the weights are left unchanged.
#include <iostream>
#include <string>
#include <fstream>
#include <sstream>
#include <vector>
#include <cmath>
//the sign function
template <typename DataType, typename WeightType>
double sign(typename::std::vector<DataType> &data, typename::std::vector<WeightType> &weights) {
double result=0.0;
for(size_t i=0; i<weights.size(); ++i) {
result += data.at(i)*weights.at(i);
}
if(result >= 0.0)
return 1.0;
else
return 0.0;
}
template <typename DataType, typename WeightType>
void trainW(typename::std::vector<std::vector<DataType> > &vv, typename::std::vector<WeightType> &weights, const double& l_rate, const int& n_epoch) {
std::vector<DataType> v_data;
for(size_t i=0; i<weights.size(); ++i) {
weights.at(i)=0.0;
}
for(size_t i=0; i<n_epoch; ++i) {
double sum_error=0.0;
for(size_t j=0; j<vv.size(); ++j) {
v_data.clear();
for(size_t k=0; k<weights.size(); ++k) {
v_data.push_back(vv[j][k]);
}
for(typename::std::vector<DataType>::iterator it=v_data.begin();it!=v_data.end();++it) {
std::cout<<*it<<" ";
}
std::cout<<std::endl;
double prediction=sign(v_data, weights);
double error=vv[j].back()-prediction;
std::cout<<"expected: "<<vv[j].back()<<" prediction: "<<prediction<<" error: "<<error<<std::endl;
sum_error+=pow(error, 2.0);
for(size_t k=0; k<weights.size(); ++k) {
weights.at(k)=weights.at(k)+l_rate*error*vv[j][k];
}
}
std::cout<<"epoch = "<<i<<" error = "<<sum_error<<std::endl;
}
for(size_t i=0; i<weights.size(); ++i) {
std::cout<<weights.at(i)<<" ";
}
std::cout<<std::endl;
}
//make a prediction with weights, appended to the last column
template <typename DataType, typename WeightType>
void predictTestData(typename::std::vector<std::vector<DataType> > &vv, typename::std::vector<WeightType> &weights) {
std::vector<DataType> v_data;
for(size_t i=0;i<vv.size();++i) {
v_data.clear();
for(size_t j=0;j<weights.size();++j) {
v_data.push_back(vv[i][j]);
}
double signResult=sign(v_data,weights);
vv[i].push_back(signResult);
}
}
//display the data
template <typename DataType>
void DisplayData(typename::std::vector<std::vector<DataType> > &vv) {
std::cout<<"the number of data: "<<vv.size()<<std::endl;
for(size_t i=0; i<vv.size(); ++i) {
for(typename::std::vector<DataType>::iterator it=vv[i].begin(); it!=vv[i].end(); ++it) {
std::cout<<*it<<" ";
}
std::cout<<std::endl;
}
}
int main() {
std::ifstream infile_feat("PLA.txt");
std::string feature;
float feat_onePoint;
std::vector<float> lines;
std::vector<std::vector<float> > lines_feat;
lines_feat.clear();
std::vector<float> v_weights;
v_weights.clear();
v_weights.push_back(-0.1);
v_weights.push_back(0.206);
v_weights.push_back(-0.234);
while(!infile_feat.eof()) {
getline(infile_feat, feature);
if(feature.empty())
break;
std::stringstream stringin(feature);
lines.clear();
lines.push_back(1);
while(stringin >> feat_onePoint) {
lines.push_back(feat_onePoint);
}
lines_feat.push_back(lines);
}
infile_feat.close();
std::cout<<"display train data: "<<std::endl;
DisplayData(lines_feat);
double l_rate=0.1;
int n_epoch=5;
trainW(lines_feat, v_weights, l_rate, n_epoch);
//predictTestData(lines_feat, v_weights);
//std::cout<<"the predicted: "<<std::endl;
//DisplayData(lines_feat);
return 0;
}
感知器算法 C++的更多相关文章
- Stanford大学机器学习公开课(三):局部加权回归、最小二乘的概率解释、逻辑回归、感知器算法
(一)局部加权回归 通常情况下的线性拟合不能很好地预测所有的值,因为它容易导致欠拟合(under fitting).如下图的左图.而多项式拟合能拟合所有数据,但是在预测新样本的时候又会变得很糟糕,因为 ...
- 第三集 欠拟合与过拟合的概念、局部加权回归、logistic回归、感知器算法
课程大纲 欠拟合的概念(非正式):数据中某些非常明显的模式没有成功的被拟合出来.如图所示,更适合这组数据的应该是而不是一条直线. 过拟合的概念(非正式):算法拟合出的结果仅仅反映了所给的特定数据的特质 ...
- [置顶] 局部加权回归、最小二乘的概率解释、逻辑斯蒂回归、感知器算法——斯坦福ML公开课笔记3
转载请注明:http://blog.csdn.net/xinzhangyanxiang/article/details/9113681 最近在看Ng的机器学习公开课,Ng的讲法循循善诱,感觉提高了不少 ...
- 感知器算法--python实现
写在前面: 参考: 1 <统计学习方法>第二章感知机[感知机的概念.误分类的判断] http://pan.baidu.com/s/1hrTscza 2 点到面的距离 3 梯度 ...
- Perceptron Algorithm 感知器算法及其实现
Rosenblatt于1958年发布的感知器算法,算是机器学习鼻祖级别的算法.其算法着眼于最简单的情况,即使用单个神经元.单层网络进行监督学习(目标结果已知),并且输入数据线性可分.我们可以用该算法来 ...
- 机器学习之感知器算法原理和Python实现
(1)感知器模型 感知器模型包含多个输入节点:X0-Xn,权重矩阵W0-Wn(其中X0和W0代表的偏置因子,一般X0=1,图中X0处应该是Xn)一个输出节点O,激活函数是sign函数. (2)感知器学 ...
- 【2008nmj】Logistic回归二元分类感知器算法.docx
给你一堆样本数据(xi,yi),并标上标签[0,1],让你建立模型(分类感知器二元),对于新给的测试数据进行分类. 要将两种数据分开,这是一个分类问题,建立数学模型,(x,y,z),z指示[0,1], ...
- 感知器算法PLA
for batch&supervised binary classfication,g≈f <=> Eout(g)≥0 achieved through Eout(g)≈Ein(g ...
- 机器学习 —— 基础整理(六)线性判别函数:感知器、松弛算法、Ho-Kashyap算法
这篇总结继续复习分类问题.本文简单整理了以下内容: (一)线性判别函数与广义线性判别函数 (二)感知器 (三)松弛算法 (四)Ho-Kashyap算法 闲话:本篇是本系列[机器学习基础整理]在time ...
随机推荐
- SQL基本操作——事务
事务是并发和恢复控制的基本单元. 事务四个属性:原子性.一致性.隔离性.持久性. 原子性:一个事务是一个不可分割的单位,事务中包括的诸多操作要么成功要么都失败. 一致性:事务必须使数据库从一个一致性状 ...
- VC使用CryptoAPI计算MD5
// md5.h #include <tchar.h> #include <wincrypt.h> // 计算Hash,成功返回0,失败返回GetLastError() // ...
- iOS crash log 解析 symbol address = stack address - slide 运行时获取slide的api 利用dwarfdump从dsym文件中得到symbol
概述: 为什么 crash log 内 Exception Backtrace 部分的地址(stack address)不能从 dsym 文件中查出对应的代码? 因为 ASLR(Address spa ...
- cstringlist
CStringList类成员 构造 CStringList 构造一个空的CString对象列表 首/尾访问 GetHead 返回此列表(不能是空的)中头部的元素 GetTail 返回此列表(不能是 ...
- .net 内嵌 GeckoWebBrowser (firefox) 核心浏览器
引用nuget包: 注意:Geckofx45 nuget包必须是最后引用,否则初始化会出错 简单示例: using Gecko; using System; using System.Collecti ...
- 怎么选择最适合自己的Linux培训机构?
Linux培训已经成为入门Linux的一个重要途径,它的优势在于学习知识的系统性.快速性和实用性.Linux培训毕业的学员大多数拥有较强的实战动手能力,能够较快上手,更符合企业需求. 不过,大部分同学 ...
- mitmproxy安装与使用
mitmproxy安装与使用 (抓包,中间人代理工具.支持SSL) 在开发微信公端的时候开发调试只能用浏览器自带开发工具,本来移动端可以用用fiddler.wireshark等工具来抓包,但是自从改用 ...
- Luogu P1550 打井Watering Hole
P1550 [USACO08OCT]打井Watering Hole 题目背景 John的农场缺水了!!! 题目描述 Farmer John has decided to bring water to ...
- 【POJ 1860】Currency Exchange
[题目链接]:http://poj.org/problem?id=1860 [题意] 给你n种货币,m种货币之间的交换信息; 交换信息以 A,B,RA,CA,RB,CB的形式给出; 即A换B的话假设A ...
- node.js 如何完美的从命令行接收参数所传递进来的值
https://segmentfault.com/q/1010000000367285