Package org.apache.mahout.math

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

148
149
150
151
152
153
154
    public void reduce(WritableComparable<?> key,
                       Iterator<VectorWritable> vectors,
                       OutputCollector<WritableComparable<?>, VectorWritable> out,
                       Reporter reporter) throws IOException {
      Vector merged = VectorWritable.merge(vectors).get();
      out.collect(key, new VectorWritable(new SequentialAccessSparseVector(merged)));
    }
View Full Code Here
52
53
54
55
56
57
58
59
      if (log.isDebugEnabled()) {
        log.debug("(DEBUG - REDUCE) Row[{}], Column[{}], Value[{}]",
                  row.get(), element.getCol(), element.getVal());
      }
    }
    SequentialAccessSparseVector output = new SequentialAccessSparseVector(out);
    context.write(row, new VectorWritable(output));
  }
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
    return sampler.sample(topicTermCounts.viewRow(topic));
  }

  public void reset() {
    for (int x = 0; x < numTopics; x++) {
      topicTermCounts.assignRow(x, new SequentialAccessSparseVector(numTerms));
    }
    topicSums.assign(1.0);
    if (threadPool.isTerminated()) {
      initializeThreadPool();
    }
View Full Code Here
320
321
322
323
324
325
326
327
328
329
330
    boolean hasBindings = bindings != null;
    boolean isSparse = !v.isDense() && v.getNumNondefaultElements() != v.size();

    // we assume sequential access in the output
    Vector provider = v.isSequentialAccess() ? v : new SequentialAccessSparseVector(v);

    buffer.append('[');
    for (Element elem : provider.nonZeroes()) {

      if (hasBindings && bindings.length >= elem.index() + 1 && bindings[elem.index()] != null) {
View Full Code Here
32
33
34
35
36
37
38
39
  @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);
  }
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
          vector.setQuick(termId, vector.getQuick(termId) + 1);
        }
      }
    }
    if (sequentialAccess) {
      vector = new SequentialAccessSparseVector(vector);
    }

    if (namedVector) {
      vector = new NamedVector(vector, key.toString());
    }
View Full Code Here
34
35
36
37
38
39
40
41
42
  private double t2;

  @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
77
78
79
80
81
82
83
84
85
86
87
  @Override
  protected void map(Text key, Text value, Context context) throws IOException, InterruptedException {
    Vector vector;
    if (sequentialVectors) {
      vector = new SequentialAccessSparseVector(cardinality);
    } else {
      vector = new RandomAccessSparseVector(cardinality);
    }
    if (namedVectors) {
      vector = new NamedVector(vector, key.toString());
View Full Code Here
166
167
168
169
170
171
172
173
174
175
176
177
178
179
      int prevPercentDone = 1;

      for (Map.Entry<String, List<Integer>> itemFeature : itemFeaturesMap.entrySet()) {
        int numfeatures = itemFeature.getValue().size();
        itemWritable.set(itemFeature.getKey());
        Vector featureVector = new SequentialAccessSparseVector(numfeatures);
        int i = 0;
        for (Integer feature : itemFeature.getValue()) {
          featureVector.setQuick(i++, feature);
        }
        featuresWritable.set(featureVector);
        writer.append(itemWritable, featuresWritable);
        // Update the progress
        double percentDone = ++doneRecords * 100.0 / totalRecords;
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
        df = minDf;
      }
      vector.setQuick(e.index(), tfidf.calculate((int) e.get(), (int) df, (int) featureCount, (int) vectorCount));
    }
    if (sequentialAccess) {
      vector = new SequentialAccessSparseVector(vector);
    }
   
    if (namedVector) {
      vector = new NamedVector(vector, key.toString());
    }
View Full Code Here
TOP

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

  • 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.