List of estimate() Examples

Examples of estimate()

cc.mallet.topics.HDP.estimate()
cc.mallet.topics.HDPInferencer.estimate()
cc.mallet.topics.HierarchicalLDA.estimate()
cc.mallet.topics.LDAStream.estimate()
cc.mallet.topics.ParallelTopicModel.estimate()
com.ipeirotis.gal.scripts.DawidSkene.estimate()
edu.brown.designer.MemoryEstimator.estimate()
gr.ntua.irmos.stubs.MapService_instance.MapPortType.estimate()
org.apache.commons.math.estimation.GaussNewtonEstimator.estimate()
Solve an estimation problem using a least squares criterion.
This method set the unbound parameters of the given problem starting from their current values through several iterations. At each step, the unbound parameters are changed in order to minimize a weighted least square criterion based on the measurements of the problem.

The iterations are stopped either when the criterion goes below a physical threshold under which improvement are considered useless or when the algorithm is unable to improve it (even if it is still high). The first condition that is met stops the iterations. If the convergence it not reached before the maximum number of iterations, an {@link EstimationException} isthrown.
@param problem estimation problem to solve @exception EstimationException if the problem cannot be solved @see EstimationProblem
org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()
etlib.org/minpack/lmder.f">lmder routine. The algorithm settings must have been set up before this method is called with the {@link #setInitialStepBoundFactor}, {@link #setMaxCostEval}, {@link #setCostRelativeTolerance}, {@link #setParRelativeTolerance} and {@link #setOrthoTolerance} methods.If these methods have not been called, the default values set up by the {@link #LevenbergMarquardtEstimator() constructor} will be used.
The authors of the original fortran function are:
- Argonne National Laboratory. MINPACK project. March 1980
- Burton S. Garbow
- Kenneth E. Hillstrom
- Jorge J. More
Luc Maisonobe did the Java translation.
@param problem estimation problem to solve @exception EstimationException if convergence cannot bereached with the specified algorithm settings or if there are more variables than equations @see #setInitialStepBoundFactor @see #setCostRelativeTolerance @see #setParRelativeTolerance @see #setOrthoTolerance
org.apache.commons.math.optimization.general.LevenbergMarquardtEstimator.estimate()
org.apache.commons.math3.stat.descriptive.rank.PSquarePercentile.PSquareMarkers.estimate()
Helper method to create a multivariate normal mixture model which can be used to initialize {@link #fit(MixtureMultivariateNormalDistribution)}. This method uses the data supplied to the constructor to try to determine a good mixture model at which to start the fit, but it is not guaranteed to supply a model which will find the optimal solution or even converge. @param data Data to estimate distribution @param numComponents Number of components for estimated mixture @return Multivariate normal mixture model estimated from the data @throws NumberIsTooLargeException if {@code numComponents} is greaterthan the number of data rows. @throws NumberIsTooSmallException if {@code numComponents < 2}. @throws NotStrictlyPositiveException if data has less than 2 rows @throws DimensionMismatchException if rows of data have different numbersof columns
org.apache.hadoop.hive.ql.metadata.InputEstimator.estimate()
Estimate input size based on filter and projection on table scan operator @param remaining Early exit condition. If it has positive value, further estimationcan be canceled on the point of exceeding it. In this case, return any bigger length value then this (Long.MAX_VALUE, for eaxmple).
org.rhq.server.metrics.migrator.workers.RawDataMigrator.estimate()
stallone.api.stat.IParameterEstimator.estimate()

Examples of org.apache.commons.math.estimation.GaussNewtonEstimator.estimate()

      circle.addPoint(110.0, -20.0);
      circle.addPoint( 35.0,  15.0);
      circle.addPoint( 45.0,  97.0);
      try {
        GaussNewtonEstimator estimator = new GaussNewtonEstimator(4, 1.0e-14, 1.0e-14);
        estimator.estimate(circle);
        fail("an exception should have been caught");
      } catch (EstimationException ee) {
        // expected behavior
      } catch (Exception e) {
        fail("wrong exception type caught");

View Full Code Here

Examples of org.apache.commons.math.estimation.GaussNewtonEstimator.estimate()

      circle.addPoint( 50.0,  -6.0);
      circle.addPoint(110.0, -20.0);
      circle.addPoint( 35.0,  15.0);
      circle.addPoint( 45.0,  97.0);
      GaussNewtonEstimator estimator = new GaussNewtonEstimator(100, 1.0e-10, 1.0e-10);
      estimator.estimate(circle);
      double rms = estimator.getRMS(circle);
      assertEquals(1.768262623567235,  Math.sqrt(circle.getM()) * rms,  1.0e-10);
      assertEquals(69.96016176931406, circle.getRadius(), 1.0e-10);
      assertEquals(96.07590211815305, circle.getX(),      1.0e-10);
      assertEquals(48.13516790438953, circle.getY(),      1.0e-10);

View Full Code Here

Examples of org.apache.commons.math.estimation.GaussNewtonEstimator.estimate()

    for (int i = 0; i < points.length; ++i) {
      circle.addPoint(points[i][0], points[i][1]);
    }
    GaussNewtonEstimator estimator = new GaussNewtonEstimator(100, 1.0e-6, 1.0e-6);
    try {
        estimator.estimate(circle);
        fail("an exception should have been caught");
    } catch (EstimationException ee) {
        // expected behavior
    } catch (Exception e) {
        fail("wrong exception type caught");

View Full Code Here

Examples of org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()

    estimator.setCostRelativeTolerance(Math.sqrt(2.22044604926e-16));
    estimator.setParRelativeTolerance(Math.sqrt(2.22044604926e-16));
    estimator.setOrthoTolerance(2.22044604926e-16);
    assertTrue(function.checkTheoreticalStartCost(estimator.getRMS(function)));
    try {
      estimator.estimate(function);
      assertFalse(exceptionExpected);
    } catch (EstimationException lsse) {
      assertTrue(exceptionExpected);
    }
    assertTrue(function.checkTheoreticalMinCost(estimator.getRMS(function)));

View Full Code Here

Examples of org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()

            for (int i = 0; i < angles.length; ++i) {
                problem.addAngularMeasurement(3.0e7, angles[i][0], angles[i][1]);
            };


            LevenbergMarquardtEstimator estimator = new LevenbergMarquardtEstimator();
            estimator.estimate(problem);
            System.out.println("initial position: " + problem.getX0() + " " + problem.getY0());
            System.out.println("velocity: " + problem.getVx0() + " " + problem.getVy0());


        } catch (EstimationException ee) {
          System.err.println(ee.getMessage());

View Full Code Here

Examples of org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()

    estimator.setCostRelativeTolerance(FastMath.sqrt(2.22044604926e-16));
    estimator.setParRelativeTolerance(FastMath.sqrt(2.22044604926e-16));
    estimator.setOrthoTolerance(2.22044604926e-16);
    assertTrue(function.checkTheoreticalStartCost(estimator.getRMS(function)));
    try {
      estimator.estimate(function);
      assertFalse(exceptionExpected);
    } catch (EstimationException lsse) {
      assertTrue(exceptionExpected);
    }
    assertTrue(function.checkTheoreticalMinCost(estimator.getRMS(function)));

View Full Code Here

Examples of org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()

    estimator.setCostRelativeTolerance(Math.sqrt(2.22044604926e-16));
    estimator.setParRelativeTolerance(Math.sqrt(2.22044604926e-16));
    estimator.setOrthoTolerance(2.22044604926e-16);
    assertTrue(function.checkTheoreticalStartCost(estimator.getRMS(function)));
    try {
      estimator.estimate(function);
      assertFalse(exceptionExpected);
    } catch (EstimationException lsse) {
      assertTrue(exceptionExpected);
    }
    assertTrue(function.checkTheoreticalMinCost(estimator.getRMS(function)));

View Full Code Here

Examples of org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()

    estimator.setCostRelativeTolerance(Math.sqrt(2.22044604926e-16));
    estimator.setParRelativeTolerance(Math.sqrt(2.22044604926e-16));
    estimator.setOrthoTolerance(2.22044604926e-16);
    assertTrue(function.checkTheoreticalStartCost(estimator.getRMS(function)));
    try {
      estimator.estimate(function);
      assertFalse(exceptionExpected);
    } catch (EstimationException lsse) {
      assertTrue(exceptionExpected);
    }
    assertTrue(function.checkTheoreticalMinCost(estimator.getRMS(function)));

View Full Code Here

Examples of org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()

      circle.addPoint( 50.0,  -6.0);
      circle.addPoint(110.0, -20.0);
      circle.addPoint( 35.0,  15.0);
      circle.addPoint( 45.0,  97.0);
      LevenbergMarquardtEstimator estimator = new LevenbergMarquardtEstimator();
      estimator.estimate(circle);
      assertTrue(estimator.getCostEvaluations() < 10);
      assertTrue(estimator.getJacobianEvaluations() < 10);
      double rms = estimator.getRMS(circle);
      assertEquals(1.768262623567235,  Math.sqrt(circle.getM()) * rms,  1.0e-10);
      assertEquals(69.96016176931406, circle.getRadius(), 1.0e-10);

View Full Code Here

Examples of org.apache.commons.math.estimation.LevenbergMarquardtEstimator.estimate()

      double  r = circle.getRadius();
      for (double d= 0; d < 2 * Math.PI; d += 0.01) {
          circle.addPoint(cx + r * Math.cos(d), cy + r * Math.sin(d));
      }
      estimator = new LevenbergMarquardtEstimator();
      estimator.estimate(circle);
      cov = estimator.getCovariances(circle);
      assertEquals(0.004, cov[0][0], 0.001);
      assertEquals(6.40e-7, cov[0][1], 1.0e-9);
      assertEquals(cov[0][1], cov[1][0], 1.0e-14);
      assertEquals(0.003, cov[1][1], 0.001);

View Full Code Here

0 1 2 3 4 5

TOP

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.