num4anova 0.0.8-java → 0.0.9-java

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c95aa4643ccb4e0c51bcead18e37bf5561ecadd7ea0fe67a1ed0ee332aab3229
-  data.tar.gz: 47045f21d6b1774ebf1435c6397852b6f567bf69fe1d001091cd4aa164a0756e
+  metadata.gz: f5d31afc9315035a148a1b2a755ecc64422c64d82c548378c8f4ea3bb940d91d
+  data.tar.gz: 249a18fb9ec372037d32b1bafc4ba37d35916e8d3fe25a96fc576f627e8ab89b
 SHA512:
-  metadata.gz: 5367576d7d8d9130c182eed316807b2b7393f3df7cabc9f95c441aced071b39f229e3f5e76a5307e619d399cafd27d4492e4d29049a0cd45475936df386ef647
-  data.tar.gz: 3f23540f51ca938baa190c4b85a9e9aa6178d386ac0a66b7047cff877fb32b422d3f21ad7d42daa7a14ef4514901a8287f54b11b5b7fddef37e80d65f0c8fbe5
+  metadata.gz: de66c54f9facc61769f2a40c4b936bcc8a6e93cfe8eb1d2d185504b9d9e59cfd6dc45654a2ec7f26a6a72c7debfef00396058a1c0db405b47e4deed7963382be
+  data.tar.gz: 908b725baa8aa4b68102b66f65fb789cc496124283e210dfd0b7c05dac4c6e22701e3c2e5bcb16c6ec01631aa3b20a8e50908b994f3dfd78e8f5804dfb245391

data/CHANGELOG.md

@@ -2,6 +2,11 @@
 
 ## Unreleased
 
+## [0.0.9] - 2024-03-02
+
+### add
+- add fuction of parallel_test.
+
 ## [0.0.6] - 2024-02-04
 
 ### add

data/ext/num4anova/Ancova.java

@@ -0,0 +1,195 @@
+import org.apache.commons.math3.distribution.FDistribution;
+
+public class Ancova {
+    private static Ancova ancova = new Ancova();
+    public static Ancova getInstance() {
+        return ancova;
+    }
+    public boolean parallelTest(double[][][] xi, double a) {
+        HypothesisTest hypoth = new Parallettest();
+
+        double statistic = hypoth.calcTestStatistic(xi);
+        return hypoth.executeTest(statistic, a);
+    }
+    /*********************************/
+    /* interface define              */
+    /*********************************/
+    private interface HypothesisTest {
+        double calcTestStatistic(double[][][] xi);
+        boolean executeTest(double statistic, double a);
+    }
+    /*********************************/
+    /* class define                  */
+    /*********************************/
+    // 回帰直線モデルの平行性の検定
+    private class Parallettest implements HypothesisTest {
+        private int n = 0;
+        private int m = 0;
+        public double calcTestStatistic(double[][][] xi) {
+            int sumn = calcSumn(xi);
+            double sumx = calcSumx(xi);
+            double sumy = calcSumy(xi);
+            n = xi.length - 1;
+            m = sumn - 2 * xi.length;
+
+        // 全変動
+            double sumx2 = calcSumx2(xi);
+            double sumy2 = calcSumy2(xi);
+            double sumyx = calcSumyx(xi);
+
+            double sumtx = sumx2 - sumx*sumx / sumn;
+            double sumty = sumy2 - sumy*sumy / sumn;
+            double sumtyx = sumyx - sumy*sumx / sumn;
+
+        // 水準間変動
+            double sumax = calcSumax(xi) - sumx*sumx / sumn;
+            double sumay = calcSumay(xi) - sumy*sumy / sumn;
+            double sumayx = calcSumayx(xi) - sumy*sumx / sumn;
+
+        // 水準内変動
+            double sumex = sumtx - sumax;
+            double sumey = sumty - sumay;
+            double sumeyx = sumtyx - sumayx;
+
+            double sumbx = calcbx(xi);
+            double sumnp = sumbx - sumeyx * sumeyx / sumex;
+            double sume2 = sumey - sumbx;
+
+       // 
+            double vnp = sumnp / n;
+            double ve2 = sume2 / m;
+            return vnp / ve2;
+        }
+        public boolean executeTest(double statistic, double a) {
+            FDistribution fDist = new FDistribution(n, m);
+            double f = fDist.inverseCumulativeProbability(1.0 - a);
+
+            return (statistic >= f) ? true : false;
+        }
+        private int calcSumn(double[][][] xi) {
+            int sum = 0;
+
+            for(int i = 0; i < xi.length; i++) {
+                sum += xi[i].length;
+            }
+            return sum;
+        }
+        // 全変動
+        private double calcSumx(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                for (int j = 0; j < xi[i].length; j++) {
+                    sum += xi[i][j][1];
+                }
+            }
+            return sum;
+        }
+        private double calcSumy(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                for (int j = 0; j < xi[i].length; j++) {
+                    sum += xi[i][j][0];
+                }
+            }
+            return sum;
+        }
+        private double calcSumx2(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                for (int j = 0; j < xi[i].length; j++) {
+                    sum += xi[i][j][1] * xi[i][j][1];
+                }
+            }
+            return sum;
+        }
+        private double calcSumy2(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                for (int j = 0; j < xi[i].length; j++) {
+                    sum += xi[i][j][0] * xi[i][j][0];
+                }
+            }
+            return sum;
+        }
+        private double calcSumyx(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                for (int j = 0; j < xi[i].length; j++) {
+                    sum += xi[i][j][0] * xi[i][j][1];
+                }
+            }
+            return sum;
+        }
+        // 水準間変動
+        private double calcSumax(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                double sumxi = 0.0;
+                for (int j = 0; j < xi[i].length; j++) {
+                    sumxi += xi[i][j][1];
+                }
+                sum += sumxi * sumxi / xi[i].length;
+            }
+            return sum;
+
+        }
+        private double calcSumay(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                double sumyi = 0.0;
+                for (int j = 0; j < xi[i].length; j++) {
+                    sumyi += xi[i][j][0];
+                }
+                sum += sumyi * sumyi / xi[i].length;
+            }
+            return sum;
+        }
+        private double calcSumayx(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                double sumxi = 0.0;
+                double sumyi = 0.0;
+                for (int j = 0; j < xi[i].length; j++) {
+                    sumxi += xi[i][j][1];
+                    sumyi += xi[i][j][0];
+                }
+                sum += sumxi * sumyi / xi[i].length;
+            }
+            return sum;
+        }
+        // 平行性の検定
+        private double calcbx(double[][][] xi) {
+            double sum = 0.0;
+
+            for (int i = 0; i < xi.length; i++) {
+                int n = xi[i].length;
+                double sumx = 0.0;
+                double sumy = 0.0;
+                double sumyx = 0.0;
+                double sumx2 = 0.0;
+                for (int j = 0; j < n; j++) {
+                    sumx +=  xi[i][j][1];
+                    sumy +=  xi[i][j][0];
+                    sumyx += xi[i][j][1] * xi[i][j][0];
+
+                    sumx2 += xi[i][j][1] * xi[i][j][1];
+
+                }
+                double wki = n * sumyx - sumy * sumx;
+                double wk = wki * wki / (n * (n * sumx2 - sumx * sumx));
+
+                sum += wk;
+            }
+            return sum;
+        }
+    }
+}
+

data/lib/num4anova.rb

@@ -5,6 +5,7 @@ require 'commons-math3-3.6.1.jar'
 
 java_import 'OneWayLayout'
 java_import 'TwoWayLayout'
+java_import 'Ancova'
 java_import 'java.util.HashMap'
 # 分散分析を行う
 #  (Apache commoms math3使用)
@@ -218,5 +219,41 @@ module Num4AnovaLib
             return ret.to_a
         end        
     end
+    # 共分散分析
+    class Num4AncovaLib
+        def initialize
+            @ancova = Ancova.getInstance()
+        end
+        # 回帰直線の平行性検定
+        #
+        # @overload parallel_test(xi, a)
+        #   @param [array]  xi データ(double[][][])
+        #   @param [double] a         有意水準
+        #   @return [boolean] 検定結果(boolean true:棄却域内 false:棄却域外)
+        # @example
+        #   xi = [
+        #      [
+        #          [3,35], [5,38], [3,39],
+        #      ],
+        #      [
+        #          [3,36], [3,39], [8,54],
+        #      ],
+        #      [
+        #          [2,40], [2,45], [2,39],
+        #      ],
+        #      [
+        #          [3,47], [4,52], [2,48],
+        #      ],
+        #      [
+        #          [1,64], [2,80], [0,70],
+        #      ],
+        #    ]
+        #    ancova = Num4AnovaLib::Num4AncovaLib.new
+        #    ancova.parallel_test(xi, 0.05)
+        #    => false
+        def parallel_test(xi, a)
+            @ancova.parallelTest(xi.to_java(Java::double[][]), a)
+        end
+    end
 end
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: num4anova
 version: !ruby/object:Gem::Version
-  version: 0.0.8
+  version: 0.0.9
 platform: java
 authors:
 - siranovel
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2024-02-04 00:00:00.000000000 Z
+date: 2024-03-02 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
@@ -61,6 +61,7 @@ files:
 - Gemfile
 - LICENSE
 - Rakefile
+- ext/num4anova/Ancova.java
 - ext/num4anova/MultiComp.java
 - ext/num4anova/OneWayLayout.java
 - ext/num4anova/TwoWayLayout.java