感知机学习算法的原始形式的java简单实现

最近开始看《统计学习方法》，下面的代码实现了书中讲的感知机学习算法的一个例子：

public class Main {

/**
 * @param args
 * 感知机学习算法原始形式的实现
 */

/*
 * 矩阵相乘的函数
 */
public static int multiple(int[] matrix1,int [] matrix2){
int sum = 0;
for(int i = 0; i < matrix1.length; i++){
sum += matrix1[i] * matrix2[i];
}
return sum;
}

/*
 * 矩阵相加的函数
 */
public static int[] sum(int[] matrix1, int[] matrix2){
int[] result = new int[matrix1.length];
for (int i = 0; i < matrix1.length; i++){
result[i] = matrix1[i] + matrix2[i];
}
return result;
}

/*
 * 数乘矩阵的函数
 */
public static int[] num_Multiple(int number,int[] matrix){
int[] result = new int[matrix.length];
for(int i = 0; i < matrix.length; i++){
result[i] = matrix[i];
}
for(int i = 0; i < matrix.length; i++){
result[i]*=number;
}
return result;
}

public static void main(String[] args) {
System.out.println("111111");
int [][] x = {{3,3},{4,3},{1,1}};
int [] y = {1,1,-1};
int [] w = {0,0};
int b = 0;
boolean isCorrect = false;//
while(!isCorrect){
isCorrect = true;
for(int i = 0; i < 3; i++){
if(  ( y[i]*(multiple(x[i],w) + b) ) <= 0  ){
int[] matrix1 = new int[2];
matrix1 = num_Multiple(y[i],x[i]);
w = sum(w,matrix1);
b = b + y[i];
isCorrect = false;
break;
}
}
}
System.out.printf("w: %d %d\n",w[0],w[1]);
System.out.println("b:  "+b);
}
}