logistical regression

最新推荐文章于 2020-08-23 20:56:35 发布

hejiwen2001

最新推荐文章于 2020-08-23 20:56:35 发布

阅读量434

点赞数

分类专栏：原创文章

本文链接：https://blog.csdn.net/hejiwen2001/article/details/8755537

版权

原创文章专栏收录该内容

19 篇文章 0 订阅

订阅专栏

package com.gridnt.offline;

public class offcal4 {

   static final double E = 2.718281828;
   private final int M = 6;
   private final int N = 4;

   double X[][] = new double[][] {
            { 1, 47, 76, 24 }, // include x0=1
            { 1, 46, 77, 23 }, { 1, 48, 74, 22 }, { 1, 34, 76, 21 }, { 1, 35, 75, 24 },
            { 1, 34, 77, 25 }, };

   double Y[] = { 1, 1, 1, 0, 0, 0 };
   double theta[] = { 1, 1, 1, 1 }; // include theta0
   double h[] = new double[M];

   double sigmodFun(double x) {
       double ex = Math.pow(2.718281828, x);
       return ex / (1 + ex);
   }

   public void calclikelihood_error() {
       double likelihood = 0;
       // 需重新根据theta计算，不要根据h算
       for (int i = 0; i < M; i++) {
           likelihood += Y[i] * Math.log(h[i]) + (1 - Y[i]) * Math.log(1 - h[i]);
       }
       System.err.println(likelihood);
   }

   public void calclikelihood() {
       double likelihood = 0;
       for (int i = 0; i < M; i++) {
           double sum = 0;
           for (int j = 0; j < N; j++) {
               sum += X[i][j] * theta[j];
           }
           h[i] = sigmodFun(sum);
           likelihood += Y[i] * Math.log(sigmodFun(sum)) + (1 - Y[i])
                    * Math.log(1 - sigmodFun(sum));
       }
       System.err.println(likelihood);
   }

   public void calc() {
       for (int t = 0; t < 1000; t++) {
           int i = t % 6;
           // for (int i = 0; i < M; i++) {
           double sum = 0; // 不能定义为Int
           for (int j = 0; j < N; j++) {
               sum += X[i][j] * theta[j];
           }
           h[i] = sigmodFun(sum);
           for (int j = 0; j < N; j++) {
               theta[j] += 0.001 * X[i][j] * (Y[i] - h[i]); // 不是（Y[j]-h[i]）
           }
           // }
           calclikelihood();
       }
   }

   public static void main(String[] args) {
       offcal4 of = new offcal4();
       // for (int i = 0; i < 1000; i++) {
       of.calc();
       // }
       System.err.println(of);
   }
}