Package org.apache.hadoop.io

Examples of org.apache.hadoop.io.DoubleWritable

131
132
133
134
135
136
137
138
139
140
141
          TupleWritable cachedTuple = new TupleWritable(3);
          int simItem = curTuple.getInt(1);
          double score = curTuple.getDouble(2);
          cachedTuple.set(0, new VIntWritable(seenItem));
          cachedTuple.set(1, new VIntWritable(simItem));
          cachedTuple.set(2, new DoubleWritable(score));
          cachedSimilarItems.add(cachedTuple);
        } else {
          // Encountered tuple from the 'user' relation (ID=1), Do the JOIN
          int userId = curTuple.getInt(1);
          user.set(userId);
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
   
    double[] logTotals = new double[state.numTopics];
    Arrays.fill(logTotals, Double.NEGATIVE_INFINITY);
   
    // Output sufficient statistics for each word. == pseudo-log counts.
    DoubleWritable v = new DoubleWritable();
    for (Iterator<Vector.Element> iter = wordCounts.iterateNonZero(); iter.hasNext();) {
      Vector.Element e = iter.next();
      int w = e.index();
     
      for (int k = 0; k < state.numTopics; ++k) {
        v.set(doc.phi(k, w) + Math.log(e.get()));
       
        IntPairWritable kw = new IntPairWritable(k, w);
       
        // ouput (topic, word)'s logProb contribution
        context.write(kw, v);
        logTotals[k] = LDAUtil.logSum(logTotals[k], v.get());
      }
    }
   
    // Output the totals for the statistics. This is to make
    // normalizing a lot easier.
    for (int k = 0; k < state.numTopics; ++k) {
      IntPairWritable kw = new IntPairWritable(k, LDADriver.TOPIC_SUM_KEY);
      v.set(logTotals[k]);
      assert !Double.isNaN(v.get());
      context.write(kw, v);
    }
    IntPairWritable llk = new IntPairWritable(LDADriver.LOG_LIKELIHOOD_KEY, LDADriver.LOG_LIKELIHOOD_KEY);
    // Output log-likelihoods.
    v.set(doc.logLikelihood);
    context.write(llk, v);
  }
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
        if (Double.isNaN(v)) {
          throw new IllegalArgumentException(topicWord.getFirst() + " " + topicWord.getSecond());
        }
        accum += v;
      }
      context.write(topicWord, new DoubleWritable(accum));
    } else { // log sum sufficient statistics.
      double accum = Double.NEGATIVE_INFINITY;
      for (DoubleWritable vw : values) {
        double v = vw.get();
        if (Double.isNaN(v)) {
          throw new IllegalArgumentException(topicWord.getFirst() + " " + topicWord.getSecond());
        }
        accum = LDAUtil.logSum(accum, v);
        if (Double.isNaN(accum)) {
          throw new IllegalArgumentException(topicWord.getFirst() + " " + topicWord.getSecond());
        }
      }
      context.write(topicWord, new DoubleWritable(accum));
    }
   
  }
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
  private static void writeInitialState(String statePath, int numTopics, int numWords) throws IOException {
    Path dir = new Path(statePath);
    Configuration job = new Configuration();
    FileSystem fs = dir.getFileSystem(job);
   
    DoubleWritable v = new DoubleWritable();
   
    Random random = RandomUtils.getRandom();
   
    for (int k = 0; k < numTopics; ++k) {
      Path path = new Path(dir, "part-" + k);
      SequenceFile.Writer writer = new SequenceFile.Writer(fs, job, path, IntPairWritable.class,
          DoubleWritable.class);
     
      double total = 0.0; // total number of pseudo counts we made
      for (int w = 0; w < numWords; ++w) {
        IntPairWritable kw = new IntPairWritable(k, w);
        // A small amount of random noise, minimized by having a floor.
        double pseudocount = random.nextDouble() + 1.0E-8;
        total += pseudocount;
        v.set(Math.log(pseudocount));
        writer.append(kw, v);
      }
      IntPairWritable kTsk = new IntPairWritable(k, TOPIC_SUM_KEY);
      v.set(Math.log(total));
      writer.append(kTsk, v);
     
      writer.close();
    }
  }
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
    FileSystem fs = dir.getFileSystem(job);
   
    double ll = 0.0;
   
    IntPairWritable key = new IntPairWritable();
    DoubleWritable value = new DoubleWritable();
    for (FileStatus status : fs.globStatus(new Path(dir, "part-*"))) {
      Path path = status.getPath();
      SequenceFile.Reader reader = new SequenceFile.Reader(fs, path, job);
      while (reader.next(key, value)) {
        if (key.getFirst() == LOG_LIKELIHOOD_KEY) {
          ll = value.get();
          break;
        }
      }
      reader.close();
    }
View Full Code Here
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
    DenseMatrix pWgT = new DenseMatrix(numTopics, numWords);
    double[] logTotals = new double[numTopics];
    double ll = 0.0;
   
    IntPairWritable key = new IntPairWritable();
    DoubleWritable value = new DoubleWritable();
    for (FileStatus status : fs.globStatus(new Path(dir, "part-*"))) {
      Path path = status.getPath();
      SequenceFile.Reader reader = new SequenceFile.Reader(fs, path, job);
      while (reader.next(key, value)) {
        int topic = key.getFirst();
        int word = key.getSecond();
        if (word == TOPIC_SUM_KEY) {
          logTotals[topic] = value.get();
          if (Double.isInfinite(value.get())) {
            throw new IllegalArgumentException();
          }
        } else if (topic == LOG_LIKELIHOOD_KEY) {
          ll = value.get();
        } else {
          if (!((topic >= 0) && (word >= 0))) {
            throw new IllegalArgumentException(topic + " " + word);
          }
          if (pWgT.getQuick(topic, word) != 0.0) {
            throw new IllegalArgumentException();
          }
          pWgT.setQuick(topic, word, value.get());
          if (Double.isInfinite(pWgT.getQuick(topic, word))) {
            throw new IllegalArgumentException();
          }
        }
      }
View Full Code Here
86
87
88
89
90
91
92
93
  }

  @Test
  public void testDoubles() throws Exception {
    double j = 55.5d;
    DoubleWritable w = new DoubleWritable(j);
    testInputOutputFn(Writables.doubles(), j, w);
  }
View Full Code Here
203
204
205
206
207
208
209
      intnum5 = new IntWritable();
      intnum100 = new IntWritable();
      intnum = new IntWritable();
      longnum = new LongWritable();
      floatnum = new FloatWritable();
      doublenum = new DoubleWritable();
    }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
      intnum5 = new IntWritable(((Byte) value.get(2)));
      intnum100 = new IntWritable(((Integer) value.get(3)));
      intnum = new IntWritable((Integer) value.get(4));
      longnum = new LongWritable((Long) value.get(5));
      floatnum = new FloatWritable((Float) value.get(6));
      doublenum = new DoubleWritable((Double) value.get(7));
      SumNumbers.ArrayWritable outputValue = new SumNumbers.ArrayWritable(id,
        intnum5, intnum100, intnum, longnum, floatnum, doublenum);
      context.write(intnum1000, outputValue);

    }
View Full Code Here
195
196
197
198
199
200
201
202
203
204
205
206
207
        final Path file = new Path(new File("target/test/test-camel-double").getAbsolutePath());
        Configuration conf = new Configuration();
        FileSystem fs1 = FileSystem.get(file.toUri(), conf);
        SequenceFile.Writer writer = createWriter(fs1, conf, file, NullWritable.class, DoubleWritable.class);
        NullWritable keyWritable = NullWritable.get();
        DoubleWritable valueWritable = new DoubleWritable();
        double value = 3.1415926535;
        valueWritable.set(value);
        writer.append(keyWritable, valueWritable);
        writer.sync();
        writer.close();

        context.addRoutes(new RouteBuilder() {
View Full Code Here
TOP

Related Classes of org.apache.hadoop.io.DoubleWritable

  • bbejeck.mapred.coocurrance.PairsRelativeOccurrenceReducerTest
  • cc.mrlda.VariationalInference
  • com.datasalt.pangool.examples.secondarysort.SecondarySort$Handler
  • com.datasalt.pangool.utils.test.AbstractHadoopTestLibrary
  • com.mongodb.hadoop.examples.treasury.TreasuryYieldMapper
  • com.mozilla.grouperfish.mahout.clustering.display.lda.DisplayLDABase
  • com.mozilla.grouperfish.mahout.clustering.display.lda.DisplayLDATopics
  • eu.stratosphere.hadoopcompatibility.datatypes.DefaultStratosphereTypeConverter
  • mil.nga.giat.geowave.analytics.mapreduce.kde.CellSummationReducer
  • mil.nga.giat.geowave.analytics.mapreduce.kde.compare.ComparisonCombiningStatsMapper
    • 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.