Package edu.msu.cme.rdp.classifier.train.validation

Examples of edu.msu.cme.rdp.classifier.train.validation.ValidClassificationResultFacade

75
76
77
78
79
80
81
82
83
84
85
86

            curTree.hideSeq(wordIterator);
            List result = dm.getBestClasspath( wordIterator, genusNodeMap, false, min_bootstrap_words);

            ValidClassificationResultFacade resultFacade = new ValidClassificationResultFacade(pSeq, result);
            resultFacade.setLabeledNode(curTree);
            compareClassificationResult(resultFacade);

            resultList.add(resultFacade);
            i++;
            // recover the wordOccurrence of the genus node, unhide
View Full Code Here
229
230
231
232
233
234
235
236
237
238
239
240
            throws IOException {
        int i = 0;

        outFile.write("\n missclassified getSequence()s: \n");
        for (i = 0; i < seqs.size(); i++) {
            ValidClassificationResultFacade resultFacade = (ValidClassificationResultFacade) seqs.get(i);
            if (resultFacade.isMissed()) {
                printPath(resultFacade, outFile);
            }
        }

        DecimalFormat df = new DecimalFormat("0.###");
View Full Code Here
108
109
110
111
112
113
114
115
116
117
118
119
            }else {
                nodeMap.remove(curTree.getName());
            }
           
            List<ValidationClassificationResult> result = dm.getBestClasspath( wordIterator, nodeMap, useSeed, min_bootstrap_words);
            ValidClassificationResultFacade resultFacade = new ValidClassificationResultFacade(pSeq, result);
            resultFacade.setLabeledNode(curTree);
            compareClassificationResult(resultFacade);

            // for ROC curve
            labelAssignmentStatus(factory, resultFacade, statusCountList);
         
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
        }

        outFile.write("\n**misclassified sequences: \n");
        for (i = 0; i < seqs.size(); i++) {
            ValidClassificationResultFacade resultFacade = (ValidClassificationResultFacade) seqs.get(i);
            if (resultFacade.isMissed()) {
                outFile.write(resultFacade.getPath() + "\n");

            }
        }
       
        outFile.write("\n**singleton sequences: \n");
        for (i = 0; i < seqs.size(); i++) {
            ValidClassificationResultFacade resultFacade = (ValidClassificationResultFacade) seqs.get(i);
            if (resultFacade.getLabeledNode().isSingleton()) {
                outFile.write(resultFacade.getPath() + "\n");

            }
        }

    }
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
          }
       
          List result = dm.getBestClasspath( wordIterator, genusNodeMap, useSeed, min_bootstrap_words);

          //xxx
          ValidClassificationResultFacade resultFacade = new ValidClassificationResultFacade(pSeq, result);

          compareClassificationResult(factory, resultFacade, rankNodeMap, statusCountList);

          totalTest++;
        }
View Full Code Here
TOP

Related Classes of edu.msu.cme.rdp.classifier.train.validation.ValidClassificationResultFacade

  • edu.msu.cme.rdp.classifier.train.validation.crossvalidate.CrossValidate
  • edu.msu.cme.rdp.classifier.train.validation.leaveoneout.LeaveOneOutTester
  • edu.msu.cme.rdp.classifier.train.validation.movingwindow.WindowTester
  • java.util.Iterator
    • 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.