Package org.apache.mahout.matrix

Examples of org.apache.mahout.matrix.DenseVector$AllIterator

168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
   * @param x an Observation
   * @return the Vector of probabilities
   */
  private Vector normalizedProbabilities(DirichletState<Observation> state,
      Observation x) {
    Vector pi = new DenseVector(numClusters);
    double max = 0;
    for (int k = 0; k < numClusters; k++) {
      double p = state.adjustedProbability(x, k);
      pi.set(k, p);
      if (max < p)
        max = p;
    }
    // normalize the probabilities by largest observed value
    pi.assign(new TimesFunction(), 1.0 / max);
    return pi;
  }
View Full Code Here
295
296
297
298
299
300
301
302
303
304
   * Compute the bound centroid by averaging the bound points
   *
   * @return a Vector which is the new bound centroid
   */
  public Vector computeBoundCentroid() {
    Vector result = new DenseVector(center.cardinality());
    for (Vector v : boundPoints)
      result.assign(v, new PlusFunction());
    return result.divide(boundPoints.size());
  }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
    List<Double> doubles = new ArrayList<Double>();
    for (String value : numbers) {
      if (value.length() > 0)
        doubles.add(Double.valueOf(value));
    }
    Vector result = new DenseVector(doubles.size());
    int index = 0;
    for (Double d : doubles)
      result.set(index++, d);
    output.collect(null, new Text(result.asFormatString()));
  }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
53
    List<Double> doubles = new ArrayList<Double>();
    for (String value : numbers) {
      if (value.length() > 0)
        doubles.add(Double.valueOf(value));
    }
    Vector point = new DenseVector(doubles.size());
    int index = 0;
    for (Double d : doubles)
      point.set(index++, d);
    MeanShiftCanopy canopy = new MeanShiftCanopy(point);
    output.collect(null, new Text(canopy.toString()));
  }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
  @Override
  public Model<Vector>[] sampleFromPrior(int howMany) {
    Model<Vector>[] result = new NormalScModel[howMany];
    for (int i = 0; i < howMany; i++) {
      DenseVector mean = new DenseVector(60);
      for (int j = 0; j < 60; j++)
        mean.set(j, UncommonDistributions.rNorm(30, 0.5));
      result[i] = new NormalScModel(mean, 1);
    }
    return result;
  }
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
   * @param state the DirichletState<Vector> of this iteration
   * @param v an Vector
   * @return the Vector of probabilities
   */
  private static Vector normalizedProbabilities(DirichletState<Vector> state, Vector v) {
    Vector pi = new DenseVector(state.numClusters);
    double max = 0;
    for (int k = 0; k < state.numClusters; k++) {
      double p = state.adjustedProbability(v, k);
      pi.set(k, p);
      if (max < p)
        max = p;
    }
    // normalize the probabilities by largest observed value
    pi.assign(new TimesFunction(), 1.0 / max);
    return pi;
  }
View Full Code Here
113
114
115
116
117
118
119
120
121
122
   */
  public static Vector rBeta(int K, double shape1, double shape2) {
    //List<Double> params = new ArrayList<Double>(2);
    //params.add(shape1);
    //params.add(Math.max(0, shape2));
    Vector result = new DenseVector(K);
    for (int i = 0; i < K; i++)
      result.set(i, rBeta(shape1, shape2));
    return result;
  }
View Full Code Here
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
   */
  public static Vector rMultinom(int size, Vector probabilities) {
    // our probability argument may not be normalized.
    double total = probabilities.zSum();
    int cardinality = probabilities.cardinality();
    Vector result = new DenseVector(cardinality);
    for (int i = 0; total > 0 && i < cardinality; i++) {
      double p = probabilities.get(i);
      int ki = rBinomial(size, p / total);
      total -= p;
      size -= ki;
      result.set(i, ki);
    }
    return result;
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
  public DirichletState() {
  }

  public Vector totalCounts() {
    Vector result = new DenseVector(numClusters);
    for (int i = 0; i < numClusters; i++)
      result.set(i, clusters.get(i).totalCount);
    return result;
  }
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
  public void paint(Graphics g) {
    super.plotSampleData(g);
    Graphics2D g2 = (Graphics2D) g;

    Vector dv = new DenseVector(2);
    int i = result.size() - 1;
    for (Model<Vector>[] models : result) {
      g2.setStroke(new BasicStroke(i == 0 ? 3 : 1));
      g2.setColor(colors[Math.min(colors.length - 1, i--)]);
      for (Model<Vector> m : models) {
        NormalModel mm = (NormalModel) m;
        dv.assign(mm.sd * 3);
        if (isSignificant(mm))
          plotEllipse(g2, mm.mean, dv);
      }
    }
  }
View Full Code Here
TOP

Related Classes of org.apache.mahout.matrix.DenseVector$AllIterator

  • org.apache.hadoop.io.Text
  • org.apache.mahout.clustering.canopy.DisplayCanopy
  • org.apache.mahout.clustering.dirichlet.DirichletClusterer
  • org.apache.mahout.clustering.dirichlet.DirichletMapper
  • org.apache.mahout.clustering.dirichlet.DirichletState
  • org.apache.mahout.clustering.dirichlet.Display2dASNDirichlet
  • org.apache.mahout.clustering.dirichlet.DisplayASNDirichlet
  • org.apache.mahout.clustering.dirichlet.DisplayASNOutputState
  • org.apache.mahout.clustering.dirichlet.DisplayDirichlet
  • org.apache.mahout.clustering.dirichlet.DisplayNDirichlet
    • 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.