Package org.apache.mahout.math

Examples of org.apache.mahout.math.NamedVector

249
250
251
252
253
254
255
256
257
258
259
260
261
262
  }
 
  @Test
  public void testDirichlet2() throws Exception {
    Path output = getTestTempDirPath("output");
    NamedVector prototype = (NamedVector) sampleData.get(0).get();
    DistributionDescription description = new DistributionDescription(
        GaussianClusterDistribution.class.getName(),
        RandomAccessSparseVector.class.getName(), null, prototype.getDelegate()
            .size());
    Configuration conf = new Configuration();
    DirichletDriver.run(conf, getTestTempDirPath("testdata"), output,
        description, 15, 10, 1.0, true, true, 0, true);
    // run ClusterDumper
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
  }
 
  @Test
  public void testDirichlet3() throws Exception {
    Path output = getTestTempDirPath("output");
    NamedVector prototype = (NamedVector) sampleData.get(0).get();
    DistributionDescription description = new DistributionDescription(
        DistanceMeasureClusterDistribution.class.getName(),
        RandomAccessSparseVector.class.getName(),
        ManhattanDistanceMeasure.class.getName(), prototype.getDelegate()
            .size());
    Configuration conf = new Configuration();
    DirichletDriver.run(conf, getTestTempDirPath("testdata"), output,
        description, 15, 10, 1.0, true, true, 0, true);
    // run ClusterDumper
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
        new SequenceFile.Writer(fs, conf, outputPath, IntWritable.class, VectorWritable.class);
    try {
      IntWritable iw = new IntWritable();
      for (int i = 0; i < numEigenVectors; i++) {
        // Persist eigenvectors sorted by eigenvalues in descending order\
        NamedVector v = new NamedVector(state.getRightSingularVector(numEigenVectors - 1 - i),
            "eigenVector" + i + ", eigenvalue = " + state.getSingularValue(numEigenVectors - 1 - i));
        Writable vw = new VectorWritable(v);
        iw.set(i);
        seqWriter.append(iw, vw);
      }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
        Kluster cluster = (Kluster) value;
        Vector vector = cluster.getCenter();
        if (vector instanceof NamedVector) {
          seedVectors.add((NamedVector) vector);
        } else {
          seedVectors.add(new NamedVector(vector, cluster.getIdentifier()));
        }
      } else if (valueClass.equals(Canopy.class)) {
        // get the cluster info
        Canopy canopy = (Canopy) value;
        Vector vector = canopy.getCenter();
        if (vector instanceof NamedVector) {
          seedVectors.add((NamedVector) vector);
        } else {
          seedVectors.add(new NamedVector(vector, canopy.getIdentifier()));
        }
      } else if (valueClass.equals(Vector.class)) {
        Vector vector = (Vector) value;
        if (vector instanceof NamedVector) {
          seedVectors.add((NamedVector) vector);
        } else {
          seedVectors.add(new NamedVector(vector, seedPathStr + '.' + item++));
        }
      } else if (valueClass.equals(VectorWritable.class) || valueClass.isInstance(VectorWritable.class)) {
        VectorWritable vw = (VectorWritable) value;
        Vector vector = vw.get();
        if (vector instanceof NamedVector) {
          seedVectors.add((NamedVector) vector);
        } else {
          seedVectors.add(new NamedVector(vector, seedPathStr + '.' + item++));
        }
      } else {
        throw new IllegalStateException("Bad value class: " + valueClass);
      }
    }
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
    seed1.set(1, 1);
    Vector seed2 = new RandomAccessSparseVector(2);
    seed2.set(0, 2);
    seed2.set(1, 1);

    seedVectors.add(new NamedVector(seed1, "foo"));
    seedVectors.add(new NamedVector(seed2, "foo2"));
    setField(mapper, "seedVectors", seedVectors);

    mapper.map(new IntWritable(123), new VectorWritable(vector), context);

    EasyMock.verify(context);
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
     Mapper<WritableComparable<?>, VectorWritable, Text, VectorWritable>.Context context =
            EasyMock.createMock(Mapper.Context.class);
    Vector expectVec = new DenseVector(new double[]{Math.sqrt(2.0), 1.0});
    context.write(new Text("other"), new VectorWritable(expectVec));
    EasyMock.replay(context);
    Vector vector = new NamedVector(new RandomAccessSparseVector(2), "other");
    vector.set(0, 2);
    vector.set(1, 2);

    VectorDistanceInvertedMapper mapper = new VectorDistanceInvertedMapper();
    setField(mapper, "measure", new EuclideanDistanceMeasure());
    Collection<NamedVector> seedVectors = new ArrayList<NamedVector>();
    Vector seed1 = new RandomAccessSparseVector(2);
    seed1.set(0, 1);
    seed1.set(1, 1);
    Vector seed2 = new RandomAccessSparseVector(2);
    seed2.set(0, 2);
    seed2.set(1, 1);

    seedVectors.add(new NamedVector(seed1, "foo"));
    seedVectors.add(new NamedVector(seed2, "foo2"));
    setField(mapper, "seedVectors", seedVectors);

    mapper.map(new IntWritable(123), new VectorWritable(vector), context);

    EasyMock.verify(context);
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
    if (sequentialAccess) {
      vector = new SequentialAccessSparseVector(vector);
    }
   
    if (namedVector) {
      vector = new NamedVector(vector, key.toString());
    }
   
    VectorWritable vectorWritable = new VectorWritable(vector);
    context.write(key, vectorWritable);
  }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
      vector = new SequentialAccessSparseVector(cardinality);
    } else {
      vector = new RandomAccessSparseVector(cardinality);
    }
    if (namedVectors) {
      vector = new NamedVector(vector, key.toString());
    }
    encoder.addToVector(value.toString(), vector);
    context.write(new Text(key.toString()), new VectorWritable(vector));
  }
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
    if (sequentialAccess) {
      vector = new SequentialAccessSparseVector(vector);
    }

    if (namedVector) {
      vector = new NamedVector(vector, key.toString());
    }

    // if the vector has no nonZero entries (nothing in the dictionary), let's not waste space sending it to disk.
    if (vector.getNumNondefaultElements() > 0) {
      VectorWritable vectorWritable = new VectorWritable(vector);
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
    if (sequentialAccess) {
      vector = new SequentialAccessSparseVector(vector);
    }
   
    if (namedVector) {
      vector = new NamedVector(vector, key.toString());
    }
   
    VectorWritable vectorWritable = new VectorWritable(vector);
    context.write(key, vectorWritable);
  }
View Full Code Here
TOP

Related Classes of org.apache.mahout.math.NamedVector

  • com.fujitsu.ca.fic.dataloaders.bns.corpus.BnsCorpusLineParser
  • com.fujitsu.ca.fic.dataloaders.bns.corpus.BnsCorpusVectorizer
  • com.fujitsu.ca.fic.dataloaders.bns.corpus.sequence.mapreduce.BnsPigOutputToVectorMapperTest
  • com.fujitsu.ca.fic.dataloaders.bns.corpus.sequence.mapreduce.VectorToSequenceReducer
  • com.fujitsu.ca.fic.dataloaders.bns.corpus.sequence.mapreduce.VectorToSequenceReducerTest
  • com.mozilla.grouperfish.mahout.clustering.display.kmeans.OriginalText
  • com.mozilla.grouperfish.pig.storage.MahoutVectorStorage
  • com.mozilla.grouperfish.transforms.coclustering.display.WriteCoClusteringOutput
  • com.mozilla.grouperfish.transforms.coclustering.pig.storage.KMeansOutputLoader
  • com.mozilla.grouperfish.transforms.coclustering.pig.storage.MahoutVectorStorage
    • 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.