Package org.apache.mahout.math

Examples of org.apache.mahout.math.CardinalityException

73
74
75
76
77
78
79
80
81
82
83
   *          of data- and labelset do not match, a CardinalityException is
   *          thrown
   */
  public void train(Vector labelset, Matrix dataset) throws TrainingException {
    if (labelset.size() != dataset.columnSize()) {
      throw new CardinalityException(labelset.size(), dataset.columnSize());
    }
   
    boolean converged = false;
    int iteration = 0;
    while (!converged) {
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
    if (a.numRows() != a.numCols()) {
      throw new IllegalArgumentException("Matrix must be square, symmetric and positive definite.");
    }
   
    if (a.numCols() != b.size()) {
      throw new CardinalityException(a.numCols(), b.size());
    }

    if (maxIterations <= 0) {
      throw new IllegalArgumentException("Max iterations must be positive.");     
    }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
  }
 
  @Override
  public double distance(Vector v1, Vector v2) {
    if (v1.size() != v2.size()) {
      throw new CardinalityException(v1.size(), v2.size());
    }
    double result = 0.0;
    Vector vector = v1.minus(v2);
    Iterator<Vector.Element> iter = vector.iterateNonZero();
    while (iter.hasNext()) {
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
  }
 
  @Override
  public double distance(Vector v1, Vector v2) {
    if (v1.size() != v2.size()) {
      throw new CardinalityException(v1.size(), v2.size());
    }
    Preconditions.checkArgument(meanVector != null, "meanVector not initialized");
    Preconditions.checkArgument(inverseCovarianceMatrix != null, "inverseCovarianceMatrix not initialized");
   
    return Math.sqrt(v1.minus(v2).dot(Algebra.mult(inverseCovarianceMatrix, v1.minus(v2))));
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
   * @throws IllegalArgumentException
   *             if <tt>eigen values equal to 0 found</tt>.
   */
  public void setCovarianceMatrix(Matrix m) {   
    if (m.numRows() != m.numCols()) {
      throw new CardinalityException(m.numRows(), m.numCols());
    }
    // See http://www.mlahanas.de/Math/svd.htm for details,
    // which specifically details the case of covariance matrix inversion
    // Complexity: O(min(nm2,mn2))
    SingularValueDecomposition svd = new SingularValueDecomposition(m);
View Full Code Here
165
166
167
168
169
170
171
172
173
174
175
   * @param other   a DistributedRowMatrix
   * @return    a DistributedRowMatrix containing the product
   */
  public DistributedRowMatrix times(DistributedRowMatrix other) throws IOException {
    if (numRows != other.numRows()) {
      throw new CardinalityException(numRows, other.numRows());
    }
    Path outPath = new Path(outputTmpBasePath.getParent(), "productWith-" + (System.nanoTime() & 0xFF));
   
    Configuration initialConf = getConf() == null ? new Configuration() : getConf();
    Configuration conf =
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
    if (a.numRows() != a.numCols()) {
      throw new IllegalArgumentException("Matrix must be square, symmetric and positive definite.");
    }
   
    if (a.numCols() != b.size()) {
      throw new CardinalityException(a.numCols(), b.size());
    }

    if (maxIterations <= 0) {
      throw new IllegalArgumentException("Max iterations must be positive.");     
    }
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
    if (a.numRows() != a.numCols()) {
      throw new IllegalArgumentException("Matrix must be square, symmetric and positive definite.");
    }
   
    if (a.numCols() != b.size()) {
      throw new CardinalityException(a.numCols(), b.size());
    }

    if (maxIterations <= 0) {
      throw new IllegalArgumentException("Max iterations must be positive.");     
    }
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
   * @param other   a DistributedRowMatrix
   * @return    a DistributedRowMatrix containing the product
   */
  public DistributedRowMatrix times(DistributedRowMatrix other) throws IOException {
    if (numRows != other.numRows()) {
      throw new CardinalityException(numRows, other.numRows());
    }
    Path outPath = new Path(outputTmpBasePath.getParent(), "productWith-" + (System.nanoTime() & 0xFF));

    Configuration initialConf = getConf() == null ? new Configuration() : getConf();
    Configuration conf =
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
   *          of data- and labelset do not match, a CardinalityException is
   *          thrown
   */
  public void train(Vector labelset, Matrix dataset) throws TrainingException {
    if (labelset.size() != dataset.columnSize()) {
      throw new CardinalityException(labelset.size(), dataset.columnSize());
    }
   
    boolean converged = false;
    int iteration = 0;
    while (!converged) {
View Full Code Here
TOP

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

  • mia.clustering.ch10.MyDistanceMeasure
  • org.apache.mahout.classifier.discriminative.LinearTrainer
  • org.apache.mahout.common.distance.ChebyshevDistanceMeasure
  • org.apache.mahout.common.distance.CosineDistanceMeasure
  • org.apache.mahout.common.distance.MahalanobisDistanceMeasure
  • org.apache.mahout.common.distance.ManhattanDistanceMeasure
  • org.apache.mahout.math.hadoop.DistributedRowMatrix
  • org.apache.mahout.math.solver.ConjugateGradientSolver
    • 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.