Package org.apache.mahout.math.decomposer

Examples of org.apache.mahout.math.decomposer.AsyncEigenVerifier

121
122
123
124
125
126
127
128
129
   * @param maxPassesPerEigen a cutoff which tells the solver after how many times of checking for convergence (done
   *  by the verifier) should the solver stop trying, even if it has not reached the convergenceTarget.
   */
  public HebbianSolver(double convergenceTarget, int maxPassesPerEigen) {
    this(new HebbianUpdater(),
        new AsyncEigenVerifier(),
        convergenceTarget,
        maxPassesPerEigen);
  }
View Full Code Here
321
322
323
324
325
326
327
328
329
330
331
    double convergence = Double.parseDouble(props.getProperty("solver.convergence"));
    int maxPasses = Integer.parseInt(props.getProperty("solver.maxPasses"));
    int numThreads = Integer.parseInt(props.getProperty("solver.verifier.numThreads"));

    HebbianUpdater updater = new HebbianUpdater();
    SingularVectorVerifier verifier = new AsyncEigenVerifier();
    HebbianSolver solver = new HebbianSolver(updater, verifier, convergence, maxPasses);
    Matrix corpus = null;
    /*
    if (numThreads <= 1) {
      //  corpus = new DiskBufferedDoubleMatrix(new File(corpusDir), inBufferSize);
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
                                double convergence,
                                int maxNumPasses,
                                int desiredRank,
                                TrainingState state) {
    HebbianUpdater updater = new HebbianUpdater();
    AsyncEigenVerifier verifier = new AsyncEigenVerifier();
    HebbianSolver solver = new HebbianSolver(updater,
                                             verifier,
                                             convergence,
                                             maxNumPasses);
    long start = System.nanoTime();
    TrainingState finalState = solver.solve(corpus, desiredRank);
    assertNotNull(finalState);
    state.setCurrentEigens(finalState.getCurrentEigens());
    state.setCurrentEigenValues(finalState.getCurrentEigenValues());
    long time = 0L;
    time += System.nanoTime() - start;
    verifier.close();
    assertEquals(state.getCurrentEigens().numRows(), desiredRank);
    return time / 1000000L;
  }
View Full Code Here
119
120
121
122
123
124
125
126
127
   * @param maxPassesPerEigen a cutoff which tells the solver after how many times of checking for convergence (done
   *  by the verifier) should the solver stop trying, even if it has not reached the convergenceTarget.
   */
  public HebbianSolver(double convergenceTarget, int maxPassesPerEigen) {
    this(new HebbianUpdater(),
        new AsyncEigenVerifier(),
        convergenceTarget,
        maxPassesPerEigen);
  }
View Full Code Here
319
320
321
322
323
324
325
326
327
328
329
    double convergence = Double.parseDouble(props.getProperty("solver.convergence"));
    int maxPasses = Integer.parseInt(props.getProperty("solver.maxPasses"));
    //int numThreads = Integer.parseInt(props.getProperty("solver.verifier.numThreads"));

    HebbianUpdater updater = new HebbianUpdater();
    SingularVectorVerifier verifier = new AsyncEigenVerifier();
    HebbianSolver solver = new HebbianSolver(updater, verifier, convergence, maxPasses);
    Matrix corpus = null;
    /*
    if (numThreads <= 1) {
      //  corpus = new DiskBufferedDoubleMatrix(new File(corpusDir), inBufferSize);
View Full Code Here
TOP

Related Classes of org.apache.mahout.math.decomposer.AsyncEigenVerifier

  • org.apache.mahout.math.decomposer.hebbian.HebbianSolver
  • org.apache.mahout.math.decomposer.hebbian.TestHebbianSolver
  • org.apache.mahout.math.Vector
    • 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.