Codota Logo
EM.getMinStdDev
Code IndexAdd Codota to your IDE (free)

How to use
getMinStdDev
method
in
weka.clusterers.EM

Best Java code snippets using weka.clusterers.EM.getMinStdDev (Showing top 2 results out of 315)

  • Common ways to obtain EM
private void myMethod () {
EM e =
  • Codota Iconnew EM()
  • Smart code suggestions by Codota
}
origin: Waikato/weka-trunk

result.add("" + getMinLogLikelihoodImprovementIterating());
result.add("-M");
result.add("" + getMinStdDev());
result.add("-K");
result.add("" + getNumKMeansRuns());
origin: nz.ac.waikato.cms.weka/weka-stable

result.add("" + getMinLogLikelihoodImprovementIterating());
result.add("-M");
result.add("" + getMinStdDev());
result.add("-K");
result.add("" + getNumKMeansRuns());
weka.clusterersEMgetMinStdDev

Javadoc

Get the minimum allowable standard deviation.

Popular methods of EM

  • <init>
    Constructor.
  • setNumClusters
    Set the number of clusters (-1 to select by CV).
  • CVClusters
    estimate the number of clusters by cross validation on the training data.
  • E
    The E step of the EM algorithm. Estimate cluster membership probabilities.
  • EM_Init
    Initialize the global aggregated estimators and storage.
  • EM_Report
    verbose output for debugging
  • M
    The M step of the EM algorithm.
  • M_reEstimate
  • buildClusterer
    Generates a clusterer. Has to initialize all fields of the clusterer that are not being set via opti
  • distributionForInstance
  • doEM
    Perform the EM algorithm
  • estimate_priors
    calculate prior probabilites for the clusters
  • doEM,
  • estimate_priors,
  • getCapabilities,
  • getMaximumNumberOfClusters,
  • getMinLogLikelihoodImprovementCV,
  • getMinLogLikelihoodImprovementIterating,
  • getNumClusters,
  • getNumExecutionSlots,
  • getNumFolds

Popular in Java

  • Making http post requests using okhttp
  • getContentResolver (Context)
  • startActivity (Activity)
  • onCreateOptionsMenu (Activity)
  • ByteBuffer (java.nio)
    A buffer for bytes. A byte buffer can be created in either one of the following ways: * #allocate(i
  • Deque (java.util)
    A linear collection that supports element insertion and removal at both ends. The name deque is shor
  • Queue (java.util)
    A collection designed for holding elements prior to processing. Besides basic java.util.Collection o
  • Semaphore (java.util.concurrent)
    A counting semaphore. Conceptually, a semaphore maintains a set of permits. Each #acquire blocks if
  • IsNull (org.hamcrest.core)
    Is the value null?
  • SAXParseException (org.xml.sax)
    Encapsulate an XML parse error or warning.This exception may include information for locating the er
Codota Logo
  • Products

    Search for Java codeSearch for JavaScript codeEnterprise
  • IDE Plugins

    IntelliJ IDEAWebStormAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogCodota Academy Plugin user guide Terms of usePrivacy policyJava Code IndexJavascript Code Index
Get Codota for your IDE now