Package org.apache.mahout.math

Examples of org.apache.mahout.math.QRDecomposition

354
355
356
357
358
359
360
      return null;
    }
  }

  private static Matrix solve(Matrix A, Matrix y) {
    return new QRDecomposition(A).solve(y);
  }
View Full Code Here
50
51
52
53
54
55
56
  public Vector solve(Vector ratings) {
    return solve(YtransposeY.plus(getYtransponseCuMinusIYPlusLambdaI(ratings)), getYtransponseCuPu(ratings));
  }

  private static Vector solve(Matrix A, Matrix y) {
    return new QRDecomposition(A).solve(y).viewColumn(0);
  }
View Full Code Here
54
55
56
57
58
59
60
    /* compute Ai * ui = Vi */
    return solve(Ai, Vi);
  }

  private static Vector solve(Matrix Ai, Matrix Vi) {
    return new QRDecomposition(Ai).solve(Vi).viewColumn(0);
  }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
    Matrix a = m.viewPart(0, rows, 1, 2);
    Matrix b = m.viewPart(0, rows, 0, 1);

    Matrix ata = a.transpose().times(a);
    Matrix atb = a.transpose().times(b);
    QRDecomposition s = new QRDecomposition(ata);
    Matrix r = s.solve(atb).transpose();
    assertEquals(expectedCoefficient, r.get(0, 0), 0.2);
    return r.times(new DenseVector(new double[]{Math.log(currentIndex), 1})).get(0);
  }
View Full Code Here
51
52
53
54
55
56
57
    /* compute ui = inverse(Ai) * Vi */
    return solve(Ai, Vi);
  }

  Vector solve(Matrix Ai, Matrix Vi) {
    return new QRDecomposition(Ai).solve(Vi).getColumn(0);
  }
View Full Code Here
54
55
56
57
58
59
60
    /* compute Ai * ui = Vi */
    return solve(Ai, Vi);
  }

  private static Vector solve(Matrix Ai, Matrix Vi) {
    return new QRDecomposition(Ai).solve(Vi).viewColumn(0);
  }
View Full Code Here
354
355
356
357
358
359
360
      return null;
    }
  }

  private Matrix solve(Matrix A, Matrix y) {
    return new QRDecomposition(A).solve(y);
  }
View Full Code Here
51
52
53
54
55
56
57
  public Vector solve(Vector ratings) {
    return solve(YtransposeY.plus(YtransponseCuMinusIYPlusLambdaI(ratings)), YtransponseCuPu(ratings));
  }

  private static Vector solve(Matrix A, Matrix y) {
    return new QRDecomposition(A).solve(y).viewColumn(0);
  }
View Full Code Here
52
53
54
55
56
57
58
    /* compute Ai * ui = Vi */
    return solve(Ai, Vi);
  }

  Vector solve(Matrix Ai, Matrix Vi) {
    return new QRDecomposition(Ai).solve(Vi).viewColumn(0);
  }
View Full Code Here
61
62
63
64
65
66
67
  public Vector solve(Vector ratings) {
    return solve(YtransposeY.plus(getYtransponseCuMinusIYPlusLambdaI(ratings)), getYtransponseCuPu(ratings));
  }

  private static Vector solve(Matrix A, Matrix y) {
    return new QRDecomposition(A).solve(y).viewColumn(0);
  }
View Full Code Here
TOP

Related Classes of org.apache.mahout.math.QRDecomposition

  • org.apache.mahout.cf.taste.impl.recommender.svd.ImplicitLinearRegressionFactorizer
  • org.apache.mahout.math.als.AlternateLeastSquaresSolver
  • org.apache.mahout.math.als.AlternatingLeastSquaresSolver
  • org.apache.mahout.math.als.ImplicitFeedbackAlternatingLeastSquaresSolver
  • org.apache.mahout.math.random.ChineseRestaurantTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.