Examples of org.apache.mahout.math.Vector.divide()

org.apache.mahout.math.Vector.divide()
Return a new matrix containing the values of the recipient divided by the argument @param x a double value @return a new Vector

      delta = x.minus(mean);
    } else {
      mean = x.like();
      delta = x.clone();
    }
    mean = mean.plus(delta.divide(n));
    if (m2 != null) {
      m2 = m2.plus(delta.times(x.minus(mean)));
    } else {
      m2 = delta.times(x.minus(mean));
    }

View Full Code Here

    throws IOException, InterruptedException {
    Vector pi = new DenseVector(clusters.size());
    for (int i = 0; i < clusters.size(); i++) {
      pi.set(i, clusters.get(i).getModel().pdf(vector));
    }
    pi = pi.divide(pi.zSum());
    if (emitMostLikely) {
      emitMostLikelyCluster(vector, clusters, pi, context);
    } else {
      emitAllClusters(vector, clusters, pi, context);
    }

View Full Code Here

    Vector pi = new DenseVector(clusters.size());
    for (int i = 0; i < clusters.size(); i++) {
      double pdf = clusters.get(i).getModel().pdf(vector);
      pi.set(i, pdf);
    }
    pi = pi.divide(pi.zSum());
    if (emitMostLikely) {
      emitMostLikelyCluster(vector, clusters, pi, writer);
    } else {
      emitAllClusters(vector, clusters, pi, writer);
    }

View Full Code Here

    throws IOException, InterruptedException {
    Vector pi = new DenseVector(clusters.size());
    for (int i = 0; i < clusters.size(); i++) {
      pi.set(i, clusters.get(i).getModel().pdf(vector));
    }
    pi = pi.divide(pi.zSum());
    if (emitMostLikely) {
      emitMostLikelyCluster(vector, clusters, pi, context);
    } else {
      emitAllClusters(vector, clusters, pi, context);
    }

View Full Code Here

    Vector pi = new DenseVector(clusters.size());
    for (int i = 0; i < clusters.size(); i++) {
      double pdf = clusters.get(i).getModel().pdf(vector);
      pi.set(i, pdf);
    }
    pi = pi.divide(pi.zSum());
    if (emitMostLikely) {
      emitMostLikelyCluster(vector, clusters, pi, writer);
    } else {
      emitAllClusters(vector, clusters, pi, writer);
    }

View Full Code Here

    Matrix transposedA = A.transpose();
    Vector u = b;


    double beta = u.norm(2);
    if (beta > 0) {
      u = u.divide(beta);
    }


    Vector v = transposedA.times(u);
    int m = A.numRows();
    int n = A.numCols();

View Full Code Here

  public Vector classify(Vector instance) {
    Vector result = classifyNoLink(instance);
    // Convert to probabilities by exponentiation.
    double max = result.maxValue();
    result.assign(Functions.minus(max)).assign(Functions.EXP);
    result = result.divide(result.norm(1));


    return result.viewPart(1, result.size() - 1);
  }


  @Override

View Full Code Here

    Vector sum = new DenseVector(2);
    for (VectorWritable v : sampleData) {
      sum.assign(v.get(), Functions.PLUS);
      sampleN++;
    }
    sampleMean = sum.divide(sampleN);


    Vector sampleVar = new DenseVector(2);
    for (VectorWritable v : sampleData) {
      Vector delta = v.get().minus(sampleMean);
      sampleVar.assign(delta.times(delta), Functions.PLUS);

View Full Code Here

    throws IOException, InterruptedException {
    Vector pi = new DenseVector(clusters.size());
    for (int i = 0; i < clusters.size(); i++) {
      pi.set(i, clusters.get(i).getModel().pdf(vector));
    }
    pi = pi.divide(pi.zSum());
    if (emitMostLikely) {
      emitMostLikelyCluster(vector, clusters, pi, context);
    } else {
      emitAllClusters(vector, clusters, pi, context);
    }

View Full Code Here

    Vector pi = new DenseVector(clusters.size());
    for (int i = 0; i < clusters.size(); i++) {
      double pdf = clusters.get(i).getModel().pdf(vector);
      pi.set(i, pdf);
    }
    pi = pi.divide(pi.zSum());
    if (emitMostLikely) {
      emitMostLikelyCluster(vector, clusters, pi, writer);
    } else {
      emitAllClusters(vector, clusters, pi, writer);
    }

View Full Code Here

0 1

TOP

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.