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

How to use
getMaximumNumberOfClusters
method
in
weka.clusterers.EM

Best Java code snippets using weka.clusterers.EM.getMaximumNumberOfClusters (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("" + getNumFolds());
result.add("-max");
result.add("" + getMaximumNumberOfClusters());
result.add("-ll-cv");
result.add("" + getMinLogLikelihoodImprovementCV());
origin: nz.ac.waikato.cms.weka/weka-stable

result.add("" + getNumFolds());
result.add("-max");
result.add("" + getMaximumNumberOfClusters());
result.add("-ll-cv");
result.add("" + getMinLogLikelihoodImprovementCV());
weka.clusterersEMgetMaximumNumberOfClusters

Javadoc

Get the maximum number of clusters to consider when cross-validating

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,
  • getMinLogLikelihoodImprovementCV,
  • getMinLogLikelihoodImprovementIterating,
  • getMinStdDev,
  • getNumClusters,
  • getNumExecutionSlots,
  • getNumFolds

Popular in Java

  • Reading from database using SQL prepared statement
  • putExtra (Intent)
  • setRequestProperty (URLConnection)
  • getApplicationContext (Context)
  • Deque (java.util)
    A linear collection that supports element insertion and removal at both ends. The name deque is shor
  • Hashtable (java.util)
    Hashtable is a synchronized implementation of Map. All optional operations are supported.Neither key
  • LinkedHashMap (java.util)
    Hash table and linked list implementation of the Map interface, with predictable iteration order. Th
  • Scanner (java.util)
    A parser that parses a text string of primitive types and strings with the help of regular expressio
  • ConcurrentHashMap (java.util.concurrent)
    A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updat
  • LoggerFactory (org.slf4j)
    The LoggerFactory is a utility class producing Loggers for various logging APIs, most notably for lo
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