Examples of org.apache.mahout.math.Vector.Element

org.apache.mahout.math.Vector.Element

  
  private void writeAllAboveThreshold(VectorWritable vw, Context context,
      Vector pdfPerCluster) throws IOException, InterruptedException {
    Iterator<Element> iterateNonZero = pdfPerCluster.iterateNonZero();
    while (iterateNonZero.hasNext()) {
      Element pdf = iterateNonZero.next();
      if (pdf.get() >= threshold) {
        int clusterIndex = pdf.index();
        write(vw, context, clusterIndex);
      }
    }
  }

View Full Code Here


  protected double getScoreForLabelInstance(int label, Vector instance) {
    double result = 0.0;
    Iterator<Element> elements = instance.iterateNonZero();
    while (elements.hasNext()) {
      Element e = elements.next();
      result += e.get() * getScoreForLabelFeature(label, e.index());
    }
    return result;
  }

View Full Code Here

   * corresponds to the Stdev of a Gaussian and the Center to its Mean.
   */
  private void computeProd2piR() {
    zProd2piR = 1.0;
    for (Iterator<Element> it = getRadius().iterateNonZero(); it.hasNext();) {
      Element radius = it.next();
      zProd2piR *= radius.get() * UncommonDistributions.SQRT2PI;
    }
  }

View Full Code Here

   * @return the zSum(((x[i]-c[i])/r[i])^2) over all i
   */
  private double sumXminusCdivRsquared(Vector x) {
    double result = 0;
    for (Iterator<Element> it = getRadius().iterateNonZero(); it.hasNext();) {
      Element radiusElem = it.next();
      int index = radiusElem.index();
      double quotient = (x.get(index) - getCenter().get(index))
          / radiusElem.get();
      result += quotient * quotient;
    }
    return result;
  }

View Full Code Here

  private static void doTestIterators(Vector vector, Collection<Integer> expectedIndices) {
    expectedIndices = Sets.newHashSet(expectedIndices);
    Iterator<Element> allIterator = vector.all().iterator();
    int index = 0;
    while (allIterator.hasNext()) {
      Element element = allIterator.next();
      assertEquals(index, element.index());
      if (expectedIndices.contains(index)) {
        assertEquals((double) index * 2, element.get(), EPSILON);
      } else {
        assertEquals(0.0, element.get(), EPSILON);
      }
      index++;
    }


    for (Element element : vector.nonZeroes()) {
      index = element.index();
      assertTrue(expectedIndices.contains(index));
      assertEquals((double) index * 2, element.get(), EPSILON);
      expectedIndices.remove(index);
    }
    assertTrue(expectedIndices.isEmpty());
  }

View Full Code Here

    vector.set(4, 3);
    vector.set(6, 4);


    // Test non zero iterator.
    Iterator<Element> it = vector.nonZeroes().iterator();
    Element element = null;
    int i = 0;
    while (it.hasNext()) {  // hasNext is called more often than next
      if (i % 2 == 0) {
        element = it.next();
      }
      //noinspection ConstantConditions
      assertEquals(element.index(), 2* (i/2));
      assertEquals(element.get(), vector.get(2* (i/2)), 0);
      ++i;
    }
    assertEquals(7, i);  // Last element is print only once.


    // Test all iterator.
    it = vector.all().iterator();
    element = null;
    i = 0;
    while (it.hasNext()) { // hasNext is called more often than next
      if (i % 2 == 0) {
        element = it.next();
      }
      //noinspection ConstantConditions
      assertEquals(element.index(), i/2);
      assertEquals(element.get(), vector.get(i/2), 0);
      ++i;
    }
    assertEquals(197, i);  // Last element is print only once.
  }

View Full Code Here


    // Test all iterator.
    it = vector.all().iterator();
    i = 0;
    while (it.hasNext()) { // hasNext is called more often than next
      Element element = it.next();
      assertEquals(i, element.index());
      ++i;
    }
    assertFalse(it.hasNext());
    assertEquals(99, i);  // Last element is print only once.
  }

View Full Code Here

    Set<Double> expectedValue = Sets.newHashSet(2.0, 8.0, 3.0, 6.0, 1.0);
    // Test non zero iterator.
    Iterator<Element> it = vector.nonZeroes().iterator();
    int i = 0;
    while (it.hasNext()) {
      Element e = it.next();
      assertTrue(expected.contains(e.index()));
      assertTrue(expectedValue.contains(e.get()));
      ++i;
    }
    assertEquals(8, i);


    // Check if the non zero elements are correct.
    assertEquals(8, vector.getNumNonZeroElements());


    // Set one element to 0.
    it = vector.nonZeroes().iterator();
    i = 0;
    while (it.hasNext()) {
      Element e = it.next();
      if (e.index() == 5) {
        e.set(0.0);
      }
      ++i;
    }
    assertEquals(8, i);
    assertEquals(7, vector.getNumNonZeroElements());


    // Remove one element
    it = vector.nonZeroes().iterator();
    i = 0;
    while (it.hasNext()) {
      Element e = it.next();
      if (e.index() == 5) {
        vector.set(5, 0.0);
      }
      ++i;
    }
    assertEquals(7, i); // This just got messed up.

View Full Code Here

            int userid = users.get(i);
            Vector tmp = datamodel.getVectorOfItems(userid);
            Iterator<Element> iter = tmp.iterateNonZero();
            double rate = 0.0;
            while (iter.hasNext()) {
                Element e = iter.next();
                rate += (e.get() - mean - bitems.get(e.index()));
            }
            busers.put(userid, rate / (tmp.getNumNondefaultElements() + lamda3));
            // busers.put(userid, 0);
        }
    }

View Full Code Here


                // iterate to items
                Iterator<Element> itor = tmpitems.iterateNonZero();
                while (itor.hasNext()) {


                    Element e = itor.next();
                    int itemid = e.index();


                    // actual rating and estimated rating
                    double rui = datamodel.getPreferenceValue(userid, itemid);
                    double pui = predictPreference(userid, itemid);
                    double eui = rui - pui;

View Full Code Here

0 1 2 3 4

TOP

Related Classes of org.apache.mahout.math.Vector.Element

com.digitalpebble.behemoth.mahout.util.Mahout2LibSVM

com.mozilla.grouperfish.mahout.clustering.display.kmeans.WordCloud

com.mozilla.grouperfish.mahout.clustering.display.lda.DisplayLDABase

com.mozilla.grouperfish.mahout.clustering.display.lda.OriginalText

com.twitter.elephantbird.pig.mahout.VectorWritableConverter

org.apache.mahout.classifier.discriminative.WinnowTrainer

org.apache.mahout.classifier.naivebayes.AbstractNaiveBayesClassifier

org.apache.mahout.classifier.naivebayes.NaiveBayesTestBase

org.apache.mahout.classifier.naivebayes.trainer.NaiveBayesThetaComplementaryMapper

org.apache.mahout.clustering.CIMapper

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.