Package weka.classifiers.trees.j48

Examples of weka.classifiers.trees.j48.Distribution

229
230
231
232
233
234
235
236
237
238
239
      modSelection = new C45ModelSelection(m_minNumObj, instances);
    if (!m_reducedErrorPruning)
      m_root = new C45PruneableClassifierTree(modSelection, !m_unpruned, m_CF,
              m_subtreeRaising, !m_noCleanup);
    else
      m_root = new PruneableClassifierTree(modSelection, !m_unpruned, m_numFolds,
             !m_noCleanup, m_Seed);
    m_root.buildClassifier(instances);
    if (m_binarySplits) {
      ((BinC45ModelSelection)modSelection).cleanup();
    } else {
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
    try {
      if( !m_reducedErrorPruning ) {
        result = new C45PruneableClassifierTree( null, !m_unpruned, m_CF, m_subtreeRaising, !m_noCleanup ).getCapabilities();
      } else {
        result = new PruneableClassifierTree( null, !m_unpruned, m_numFolds, !m_noCleanup, m_Seed ).getCapabilities();
      }
    } catch( Exception e ) {
      result = new Capabilities( this );
    }
View Full Code Here
174
175
176
177
178
179
180
181
182
    ModelSelection modSelection = new HTreeModelSelection( m_minNumObj, instances );

    if( !m_reducedErrorPruning ) {
      m_root = new C45PruneableClassifierTree( modSelection, !m_unpruned, m_CF, m_subtreeRaising, !m_noCleanup );
    } else {
      m_root = new PruneableClassifierTree( modSelection, !m_unpruned, m_numFolds, !m_noCleanup, m_Seed );
    }
    m_root.buildClassifier( instances );
  }
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
    try {
      if( !m_reducedErrorPruning ) {
        result = new C45PruneableClassifierTree( null, !m_unpruned, m_CF, m_subtreeRaising, !m_noCleanup ).getCapabilities();
      } else {
        result = new PruneableClassifierTree( null, !m_unpruned, m_numFolds, !m_noCleanup, m_Seed ).getCapabilities();
      }
    } catch( Exception e ) {
      result = new Capabilities( this );
    }
View Full Code Here
174
175
176
177
178
179
180
181
182
    ModelSelection modSelection = new HDIGModelSelection( m_minNumObj, instances );

    if( !m_reducedErrorPruning ) {
      m_root = new C45PruneableClassifierTree( modSelection, !m_unpruned, m_CF, m_subtreeRaising, !m_noCleanup );
    } else {
      m_root = new PruneableClassifierTree( modSelection, !m_unpruned, m_numFolds, !m_noCleanup, m_Seed );
    }
    m_root.buildClassifier( instances );
  }
View Full Code Here
185
186
187
188
189
190
191
192
193
194
195
    try {
      if( !m_reducedErrorPruning ) {
        result = new C45PruneableClassifierTree( null, !m_unpruned, m_CF, m_subtreeRaising, !m_noCleanup ).getCapabilities();
      } else {
        result = new PruneableClassifierTree( null, !m_unpruned, m_numFolds, !m_noCleanup, m_Seed ).getCapabilities();
      }
    } catch( Exception e ) {
      result = new Capabilities( this );
    }
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
    }
    if( !m_reducedErrorPruning ) {
      m_root = new C45PruneableClassifierTree( modSelection, !m_unpruned, m_CF,
          m_subtreeRaising, !m_noCleanup );
    } else {
      m_root = new PruneableClassifierTree( modSelection, !m_unpruned, m_numFolds,
          !m_noCleanup, m_Seed );
    }
    m_root.buildClassifier( instances );
    if( m_binarySplits ) {
      ( (BinC45ModelSelection) modSelection ).cleanup();
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
   
    try {
      if (!m_reducedErrorPruning)
        result = new C45PruneableClassifierTree(null, !m_unpruned, m_CF, m_subtreeRaising, !m_noCleanup, m_collapseTree).getCapabilities();
      else
        result = new PruneableClassifierTree(null, !m_unpruned, m_numFolds, !m_noCleanup, m_Seed).getCapabilities();
    }
    catch (Exception e) {
      result = new Capabilities(this);
      result.disableAll();
    }
View Full Code Here
243
244
245
246
247
248
249
250
251
252
253
      modSelection = new C45ModelSelection(m_minNumObj, instances, m_useMDLcorrection);
    if (!m_reducedErrorPruning)
      m_root = new C45PruneableClassifierTree(modSelection, !m_unpruned, m_CF,
                                              m_subtreeRaising, !m_noCleanup, m_collapseTree);
    else
      m_root = new PruneableClassifierTree(modSelection, !m_unpruned, m_numFolds,
             !m_noCleanup, m_Seed);
    m_root.buildClassifier(instances);
    if (m_binarySplits) {
      ((BinC45ModelSelection)modSelection).cleanup();
    } else {
View Full Code Here
TOP

Related Classes of weka.classifiers.trees.j48.Distribution

  • de.tudarmstadt.ukp.similarity.experiments.coling2012.util.Evaluator
  • dkpro.similarity.algorithms.ml.ClassifierSimilarityMeasure
  • edu.brown.markov.FeatureClusterer
  • edu.uga.cs.fluxbuster.classification.Classifier
  • etc.aloe.cscw2013.WekaModelTest
  • eu.admire.ogsadai.activity.weka.WekaUtilitiesTest
  • trust.weka4jason.WekaBinClassifier
  • trust.weka4jason.WekaClusterClassifier
  • weka.classifiers.bayes.NaiveBayesUpdateable
  • weka.classifiers.Evaluation
    • 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.