Package org.apache.mahout.math

Examples of org.apache.mahout.math.SequentialAccessSparseVector$AbstractElement

263
264
265
266
267
268
269
270
    @Override
    protected void reduce(WritableComparable<?> key, Iterable<VectorWritable> values, Context ctx)
      throws IOException, InterruptedException {
      Vector sum = ALS.sum(values.iterator());
      result.set(new SequentialAccessSparseVector(sum));
      ctx.write(key, result);
    }
View Full Code Here
277
278
279
280
281
282
283
284
285
    @Override
    public void reduce(WritableComparable<?> key, Iterable<VectorWritable> vectors, Context ctx)
      throws IOException, InterruptedException {
      Vector merged = VectorWritable.merge(vectors.iterator()).get();
      result.set(new SequentialAccessSparseVector(merged));
      ctx.write(key, result);
      ctx.getCounter(Stats.NUM_USERS).increment(1);
    }
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
    Vector xi = new DenseVector(n);

    double muAmplitude = 50.0;
    for (int i = 0; i < m; i++) {
      Vector dv = new SequentialAccessSparseVector(n);
      for (int j = 0; j < n * percent / 100; j++) {
        dv.setQuick(rnd.nextInt(n), muAmplitude * (rnd.nextDouble() - 0.25));
      }
      roww.set(i);
      vw.set(dv);
      w.append(roww, vw);
      xi.assign(dv, Functions.PLUS);
View Full Code Here
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
public final class VectorHelperTest extends MahoutTestCase {

  @Test
  public void testJsonFormatting() throws Exception {
    Vector v = new SequentialAccessSparseVector(10);
    v.set(2, 3.1);
    v.set(4, 1.0);
    v.set(6, 8.1);
    v.set(7, -100);
    v.set(9, 12.2);
    String UNUSED = "UNUSED";
    String[] dictionary = {
        UNUSED, UNUSED, "two", UNUSED, "four", UNUSED, "six", "seven", UNUSED, "nine"
    };
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
        VectorHelper.vectorToJson(v, dictionary, 2, false));
  }

  @Test
  public void testTopEntries() throws Exception {
    Vector v = new SequentialAccessSparseVector(10);
    v.set(2, 3.1);
    v.set(4, 1.0);
    v.set(6, 8.1);
    v.set(7, -100);
    v.set(9, 12.2);
    v.set(1, 0.0);
    v.set(3, 0.0);
    v.set(8, 2.7);
    // check if sizeOFNonZeroElementsInVector = maxEntries
    assertEquals(6, VectorHelper.topEntries(v, 6).size());
    // check if sizeOfNonZeroElementsInVector < maxEntries
    assertTrue(VectorHelper.topEntries(v, 9).size() < 9);
    // check if sizeOfNonZeroElementsInVector > maxEntries
    assertTrue(VectorHelper.topEntries(v, 5).size() < Iterables.size(v.nonZeroes()));
  }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
    assertTrue(VectorHelper.topEntries(v, 5).size() < Iterables.size(v.nonZeroes()));
  }

  @Test
  public void testTopEntriesWhenAllZeros() throws Exception {
    Vector v = new SequentialAccessSparseVector(10);
    v.set(2, 0.0);
    v.set(4, 0.0);
    v.set(6, 0.0);
    v.set(7, 0);
    v.set(9, 0.0);
    v.set(1, 0.0);
    v.set(3, 0.0);
    v.set(8, 0.0);
    assertEquals(0, VectorHelper.topEntries(v, 6).size());
  }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
    }

    Preconditions.checkArgument((vA != null || vB != null) || (vOut != null));

    if (vOut == null) {
      vOut = new SequentialAccessSparseVector(dimsA + dimsB);
      if (isNamed) {
        vOut = new NamedVector(vOut, name);
      }
    }
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
117
    VectorWritable vw = new VectorWritable();
    IntWritable roww = new IntWritable();

    double muAmplitude = 50.0;
    for (int i = 0; i < m; i++) {
      Vector dv = new SequentialAccessSparseVector(n);
      for (int j = 0; j < n * percent / 100; j++) {
        dv.setQuick(rnd.nextInt(n), muAmplitude * (rnd.nextDouble() - 0.5));
      }
      roww.set(i);
      vw.set(dv);
      w.append(roww, vw);
    }
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
  static double distributedSimilarity(double[] one,
                                      double[] two,
                                      Class<? extends VectorSimilarityMeasure> similarityMeasureClass) {
    double rand = computeSimilarity(one, two, similarityMeasureClass, new RandomAccessSparseVector(one.length));
    double seq = computeSimilarity(one, two, similarityMeasureClass, new SequentialAccessSparseVector(one.length));
    double dense = computeSimilarity(one, two, similarityMeasureClass, new DenseVector(one.length));
    assertEquals(seq, rand, 1.0e-10);
    assertEquals(seq, dense, 1.0e-10);
    assertEquals(dense, rand, 1.0e-10);
    return seq;
View Full Code Here
38
39
40
41
42
43
44
45
46
  public abstract void readFields(DataInput in) throws IOException;
 
  @Override
  public Vector select(Vector probabilities) {
    int maxValueIndex = probabilities.maxValueIndex();
    Vector weights = new SequentialAccessSparseVector(probabilities.size());
    weights.set(maxValueIndex, 1.0);
    return weights;
  }
View Full Code Here
TOP

Related Classes of org.apache.mahout.math.SequentialAccessSparseVector$AbstractElement

  • com.fujitsu.ca.fic.dataloaders.bns.corpus.BnsCorpusLineParser
  • com.fujitsu.ca.fic.dataloaders.bns.corpus.sequence.mapreduce.BnsPigOutputToVectorMapperTest
  • com.fujitsu.ca.fic.dataloaders.bns.corpus.sequence.mapreduce.VectorToSequenceReducerTest
  • com.mozilla.grouperfish.transforms.coclustering.pig.storage.MahoutVectorStorage
  • com.tamingtext.mahout.VectorExamplesTest
  • com.twitter.elephantbird.pig.mahout.VectorWritableConverter
  • mia.classifier.ch14.TokenizingAndVectorizingText
  • mia.clustering.ch12.lastfm.VectorMapper
  • org.apache.mahout.benchmark.VectorBenchmarks
  • org.apache.mahout.cf.taste.hadoop.als.ParallelALSFactorizationJob$MergeUserVectorsReducer
    • 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.