------------------------入力ファイル--------------
最大試行回数 100 入力セルの数 2 出力セルの数 2 訓練例の数 4 乱数 123
入力データファイル or.dat
------------------------or.dat--------------------
OR演算の訓練例．各行における最後の２つのデータが目標出力値
-1 -1 -1 1
-1 1 1 -1
1 -1 1 -1
1 1 1 -1
------------------------winner.h------------------
/**********************/
/* Winnerクラスの定義 */
/**********************/
class Winner {
long max; // 最大学習回数
long n; // 訓練例の数
long o; // 出力セルの数
long p; // 入力セルの数
long **W_p; // 重み（ポケット）
long **W; // 重み
long **E; // 訓練例
long **C; // 各訓練例に対する正しい出力
long *Ct; // 作業領域
public:
Winner(long, long, long, long, long);
~Winner();
long Bunrui();
void Input(char *);
void Learn(int, char *name = "");
long Pocket(long *);
};
------------------------constructor---------------
/******************/
/* コンストラクタ */
/******************/
#include <stdlib.h>
#include "winner.h"
#include "MT.h"
Winner::Winner(long max_i, long n_i, long o_i, long p_i, long seed)
{
long i1;
/*
設定
*/
max = max_i;
n = n_i;
o = o_i;
p = p_i;
init_genrand(seed);
/*
領域の確保
*/
E = new long * [n];
C = new long * [n];
for (i1 = 0; i1 < n; i1++) {
E[i1] = new long [p+1];
C[i1] = new long [o];
}
W_p = new long * [o];
W = new long * [o];
for (i1 = 0; i1 < o; i1++) {
W_p[i1] = new long [p+1];
W[i1] = new long [p+1];
}
Ct = new long [o];
}
------------------------destructor----------------
/****************/
/* デストラクタ */
/****************/
#include "winner.h"
Winner::~Winner()
{
int i1;
for (i1 = 0; i1 < n; i1++) {
delete [] E[i1];
delete [] C[i1];
}
delete [] E;
delete [] C;
for (i1 = 0; i1 < o; i1++) {
delete [] W_p[i1];
delete [] W[i1];
}
delete [] W_p;
delete [] W;
delete [] Ct;
}
------------------------Bunrui.cpp----------------
/******************************************/
/* 訓練例の分類 */
/* return : 正しく分類した訓練例の数 */
/******************************************/
#include "winner.h"
long Winner::Bunrui()
{
long cor, i1, i2, i3, mx = 0, mx_v = 0, num = 0, s;
int sw = 0;
for (i1 = 0; i1 < n; i1++) {
cor = 0;
for (i2 = 0; i2 < o; i2++) {
if (C[i1][i2] == 1)
cor = i2;
s = 0;
for (i3 = 0; i3 <= p; i3++)
s += W[i2][i3] * E[i1][i3];
if (i2 == 0) {
mx = 0;
mx_v = s;
}
else {
if (s > mx_v) {
mx = i2;
mx_v = s;
sw = 0;
}
else {
if (s == mx_v)
sw = 1;
}
}
}
if (sw == 0 && cor == mx)
num++;
}
return num;
}
------------------------Input.cpp-----------------
/**************************/
/* 学習データの読み込み */
/* name : ファイル名 */
/**************************/
#include <stdio.h>
#include "winner.h"
void Winner::Input(char *name)
{
long i1, i2;
FILE *st;
st = fopen(name, "r");
fscanf(st, "%*s");
for (i1 = 0; i1 < n; i1++) {
E[i1][0] = 1;
for (i2 = 1; i2 <= p; i2++)
fscanf(st, "%ld", &E[i1][i2]);
for (i2 = 0; i2 < o; i2++)
fscanf(st, "%ld", &C[i1][i2]);
}
fclose(st);
}
------------------------Learn.cpp-----------------
/*********************************/
/* 学習と結果の出力 */
/* seed : 乱数の初期値 */
/* pr : =0 : 画面に出力 */
/* =1 : ファイルに出力 */
/* name : 出力ファイル名 */
/*********************************/
#include <stdio.h>
#include "winner.h"
void Winner::Learn(int pr, char *name)
{
long i1, i2, i3, mx = 0, mx_v = 0, n_tri, num, s;
int sw;
FILE *out;
n_tri = Pocket(&num);
if (pr == 0)
out = stdout;
else
out = fopen(name, "w");
fprintf(out, "重み\n");
for (i1 = 0; i1 < o; i1++) {
for (i2 = 0; i2 <= p; i2++)
fprintf(out, "%5ld", W_p[i1][i2]);
fprintf(out, "\n");
}
fprintf(out, "分類結果\n");
for (i1 = 0; i1 < n; i1++) {
sw = 0;
for (i2 = 0; i2 < o; i2++) {
s = 0;
for (i3 = 0; i3 <= p; i3++)
s += W_p[i2][i3] * E[i1][i3];
if (i2 == 0) {
mx_v = s;
mx = 0;
}
else {
if (s > mx_v) {
sw = 0;
mx_v = s;
mx = i2;
}
else {
if (s == mx_v)
sw = 1;
}
}
}
for (i2 = 1; i2 <= p; i2++)
fprintf(out, "%2ld", E[i1][i2]);
fprintf(out, " Cor ");
for (i2 = 0; i2 < o; i2++)
fprintf(out,"%2ld", C[i1][i2]);
if (sw > 0)
mx = -1;
fprintf(out, " Res %2ld\n", mx+1);
}
if (n == num)
printf(" ！！すべてを分類（試行回数：%ld）\n", n_tri);
else
printf(" ！！%ld 個を分類\n", num);
}
------------------------Pocket.cpp----------------
/********************************************/
/* Pocket Algorith with Ratcet */
/* num_p : 正しく分類した訓練例の数 */
/* return : =0 : 最大学習回数 */
/* >0 : すべてを分類（回数） */
/********************************************/
#include <stdlib.h>
#include "winner.h"
#include <stdio.h>
#include "MT.h"
long Winner::Pocket(long *num_p)
{
long cor, count = 0, i1, i2, k, mx = 0, num, run = 0, run_p = 0, s, sw = -1;
int sw1;
/*
初期設定
*/
*num_p = 0;
for (i1 = 0; i1 < o; i1++) {
for (i2 = 0; i2 <= p; i2++)
W[i1][i2] = 0;
}
/*
実行
*/
while (sw < 0) {
// 終了チェック
count++;;
if (count > max)
sw = 0;
else {
// 訓練例の選択
k = (long)(genrand_real3() * n);
if (k >= n)
k = n - 1;
// 出力の計算
sw1 = 0;
cor = -1;
for (i1 = 0; i1 < o; i1++) {
if (C[k][i1] == 1)
cor = i1;
s = 0;
for (i2 = 0; i2 <= p; i2++)
s += W[i1][i2] * E[k][i2];
Ct[i1] = s;
if (i1 == 0)
mx = 0;
else {
if (s > Ct[mx]) {
mx = i1;
sw1 = 0;
}
else {
if (s == Ct[mx]) {
sw1 = 1;
if (cor >= 0 && mx == cor)
mx = i1;
}
}
}
}
// 正しい分類
if (sw1 == 0 && cor == mx) {
run++;
if (run > run_p) {
num = Bunrui();
if (num > *num_p) {
*num_p = num;
run_p = run;
for (i1 = 0; i1 < o; i1++) {
for (i2 = 0; i2 <= p; i2++)
W_p[i1][i2] = W[i1][i2];
}
if (num == n)
sw = count;
}
}
}
// 誤った分類
else {
run = 0;
for (i1 = 0; i1 <= p; i1++) {
W[cor][i1] += E[k][i1];
W[mx][i1] -= E[k][i1];
}
}
}
}
return sw;
}
------------------------main----------------------
/****************************/
/* Winner-Take-All Groups */
/* coded by Y.Suganuma */
/****************************/
#include <stdio.h>
#include <stdlib.h>
#include "winner.h"
/****************/
/* main program */
/****************/
int main(int argc, char *argv[])
{
long max, n, o, p, seed;
char name[100];
FILE *st;
if (argc > 1) {
// 基本データの入力
st = fopen(argv[1], "r");
fscanf(st, "%*s %ld %*s %ld %*s %ld %*s %ld %*s %ld",
&max, &p, &o, &n, &seed);
fscanf(st, "%*s %s", name);
fclose(st);
// ネットワークの定義と学習データ等の設定
Winner net(max, n, o, p, seed);
net.Input(name);
// 学習と結果の出力
if (argc == 2)
net.Learn(0);
else
net.Learn(1, argv[2]);
}
else {
printf("***error 入力データファイル名を指定して下さい\n");
exit(1);
}
return 0;
}
-----------------------MT.h--------------------
/*
A C-program for MT19937, with initialization improved 2002/1/26.
Coded by Takuji Nishimura and Makoto Matsumoto.
Before using, initialize the state by using init_genrand(seed)
or init_by_array(init_key, key_length).
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of its contributors may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Any feedback is very welcome.
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
/*
The original version of http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/mt19937ar.c was modified by Takahiro Omi as
- delete line 47 "#include<stdio.h>"
- delete line 174 int main(void){...}
- change N -> MT_N
- change N -> MT_N
- change the file name "mt19937ar.c" -> "MT.h"
*/
/* Period parameters */
#define MT_N 624
#define MT_M 397
#define MATRIX_A 0x9908b0dfUL /* constant vector a */
#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
static unsigned long mt[MT_N]; /* the array for the state vector */
static int mti=MT_N+1; /* mti==MT_N+1 means mt[MT_N] is not initialized */
/* initializes mt[MT_N] with a seed */
void init_genrand(unsigned long s)
{
mt[0]= s & 0xffffffffUL;
for (mti=1; mti<MT_N; mti++) {
mt[mti] =
(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
/* In the previous versions, MSBs of the seed affect */
/* only MSBs of the array mt[]. */
/* 2002/01/09 modified by Makoto Matsumoto */
mt[mti] &= 0xffffffffUL;
/* for >32 bit machines */
}
}
/* initialize by an array with array-length */
/* init_key is the array for initializing keys */
/* key_length is its length */
/* slight change for C++, 2004/2/26 */
void init_by_array(unsigned long init_key[], int key_length)
{
int i, j, k;
init_genrand(19650218UL);
i=1; j=0;
k = (MT_N>key_length ? MT_N : key_length);
for (; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+ init_key[j] + j; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++; j++;
if (i>=MT_N) { mt[0] = mt[MT_N-1]; i=1; }
if (j>=key_length) j=0;
}
for (k=MT_N-1; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
- i; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++;
if (i>=MT_N) { mt[0] = mt[MT_N-1]; i=1; }
}
mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
}
/* generates a random number on [0,0xffffffff]-interval */
unsigned long genrand_int32(void)
{
unsigned long y;
static unsigned long mag01[2]={0x0UL, MATRIX_A};
/* mag01[x] = x * MATRIX_A for x=0,1 */
if (mti >= MT_N) { /* generate N words at one time */
int kk;
if (mti == MT_N+1) /* if init_genrand() has not been called, */
init_genrand(5489UL); /* a default initial seed is used */
for (kk=0;kk<MT_N-MT_M;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+MT_M] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
for (;kk<MT_N-1;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+(MT_M-MT_N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
y = (mt[MT_N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
mt[MT_N-1] = mt[MT_M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
mti = 0;
}
y = mt[mti++];
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return y;
}
/* generates a random number on [0,0x7fffffff]-interval */
long genrand_int31(void)
{
return (long)(genrand_int32()>>1);
}
/* generates a random number on [0,1]-real-interval */
double genrand_real1(void)
{
return genrand_int32()*(1.0/4294967295.0);
/* divided by 2^32-1 */
}
/* generates a random number on [0,1)-real-interval */
double genrand_real2(void)
{
return genrand_int32()*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on (0,1)-real-interval */
double genrand_real3(void)
{
return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on [0,1) with 53-bit resolution*/
double genrand_res53(void)
{
unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
return(a*67108864.0+b)*(1.0/9007199254740992.0);
}
/* These real versions are due to Isaku Wada, 2002/01/09 added */