-
Notifications
You must be signed in to change notification settings - Fork 2
/
LibD3C.java
928 lines (776 loc) · 27.2 KB
/
LibD3C.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
package weka.classifiers.meta;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Enumeration;
import java.util.List;
import java.util.Random;
import java.util.Vector;
import weka.classifiers.Classifier;
import weka.classifiers.Evaluation;
import weka.classifiers.RandomizableMultipleClassifiersCombiner;
import weka.core.Capabilities;
import weka.core.Environment;
import weka.core.EnvironmentHandler;
import weka.core.Instance;
import weka.core.Instances;
import weka.core.Option;
import weka.core.converters.*;
import weka.core.OptionHandler;
import weka.core.RevisionUtils;
import weka.core.SelectedTag;
import weka.core.Tag;
import weka.core.TechnicalInformation;
import weka.core.TechnicalInformationHandler;
import weka.core.Utils;
import cn.edu.xmu.dm.d3c.core.imDC;
import cn.edu.xmu.dm.d3c.core.imDC1;
import cn.edu.xmu.dm.d3c.core.myClassifier;
import cn.edu.xmu.dm.d3c.sample.BaseClassifiersClustering;
import cn.edu.xmu.dm.d3c.sample.BaseClassifiersEnsemble;
import cn.edu.xmu.dm.d3c.sample.ParallelBaseClassifiersTraining;
import cn.edu.xmu.dm.d3c.utils.InitClassifiers;
import cn.edu.xmu.dm.d3c.utils.InstanceUtil;
public class LibD3C extends RandomizableMultipleClassifiersCombiner implements
TechnicalInformationHandler, EnvironmentHandler {
protected static final long serialVersionUID = 1L;
protected int numClusters = 10;
protected double TargetCorrectRate = 1.0D;
protected double Interval = 0.05D;
// protected int numFolds = 5;
List<String> nameOfClassifiers = new ArrayList<String>();
List<String> pathOfClassifiers = new ArrayList<String>();
List<String> parameterOfCV = new ArrayList<String>();
List<Classifier> cfsArrayCopy = new ArrayList<Classifier>();
public static ArrayList<String> Option;
List<Integer> ensemClassifiers;
public static Classifier[] cfsArray;
public static boolean flag_im = false;
protected Random m_Random = new Random(1000L);
protected List<String> m_classifiersToLoad = new ArrayList();
protected List<Classifier> m_preBuiltClassifiers = new ArrayList();
protected transient Environment m_env = Environment.getSystemWide();
protected Tag[] TAGS_CIRCLECOMBINEALGORITHM = { new Tag(0, "HCNRR"),
new Tag(1, "HCRR"), new Tag(2, "EFSS"), new Tag(3, "EBSS") };
protected int m_SelectiveAlgorithm_Type = 2;
protected final Tag[] TAGS_SELECTIVEALGORITHM = { new Tag(0, "CC"),
new Tag(1, "DS"), new Tag(2, "HCNRR"), new Tag(3, "HCRR"),
new Tag(4, "EFSS"), new Tag(5, "EBSS") };
protected int m_CircleCombine_Type = 1;
protected Tag[] TAGS_RULES = { new Tag(1, "Average of Probabilities"),
new Tag(2, "Product of Probabilities"),
new Tag(3, "Majority Voting"), new Tag(4, "Minimum Probability"),
new Tag(5, "Maximum Probability"), new Tag(6, "Median Voting") };
protected int m_CombinationRule = 1;
protected double validatePercent = 0.2;
protected int m_numExecutionSlots = 1;
protected String classifiersxml = "classifiers.xml";
protected int timeOut = 20;
public boolean getflag_im() {
return flag_im;
}
public void setflag_im(boolean flag_im) {
flag_im = flag_im;
}
public int getNumClusters() {
return numClusters;
}
public void setNumClusters(int num) {
numClusters = num;
}
public double getTargetCorrectRate() {
return TargetCorrectRate;
}
public void setTargetCorrectRate(double correctrate) {
TargetCorrectRate = correctrate;
}
public double getInterval() {
return Interval;
}
public void setInterval(double interval) {
Interval = interval;
}
public SelectedTag getSelectiveAlgorithm() {
return new SelectedTag(this.m_SelectiveAlgorithm_Type,
TAGS_SELECTIVEALGORITHM);
}
public void setSelectiveAlgorithm(SelectedTag value) {
if (value.getTags() == TAGS_SELECTIVEALGORITHM)
this.m_SelectiveAlgorithm_Type = value.getSelectedTag().getID();
}
public SelectedTag getCircleCombineAlgorithm() {
return new SelectedTag(this.m_CircleCombine_Type,
TAGS_CIRCLECOMBINEALGORITHM);
}
public void setCircleCombineAlgorithm(SelectedTag value) {
if (value.getTags() == TAGS_CIRCLECOMBINEALGORITHM)
this.m_CircleCombine_Type = value.getSelectedTag().getID();
}
public int getNumExecutionSlots() {
return m_numExecutionSlots;
}
public void setNumExecutionSlots(int m_numExecutionSlots) {
this.m_numExecutionSlots = m_numExecutionSlots;
}
public double getValidationRatio() {
return validatePercent;
}
public void setValidationRatio(double validatePercent) {
this.validatePercent = validatePercent;
}
public SelectedTag getEnsembleVotingRule() {
return new SelectedTag(this.m_CombinationRule, TAGS_RULES);
}
public void setEnsembleVotingRule(SelectedTag value) {
if (value.getTags() == TAGS_RULES)
this.m_CombinationRule = value.getSelectedTag().getID();
}
public int getTimeOut() {
return timeOut;
}
public void setTimeOut(int timeOut) {
this.timeOut = timeOut;
}
public String globalInfo() {
return "Class for combining classifiers. Different combinations of probability estimates for classification are available.\n\nFor more information see:\n\n"
+ getTechnicalInformation().toString();
}
public Enumeration listOptions() {
Vector result = new Vector();
// Enumeration enm = super.listOptions();
// String name = "B";
//
// while (enm.hasMoreElements()) {
// Option opt = (Option)enm.nextElement();
//
// if (opt.name().equals(name))
// continue;
// result.addElement(opt);
// }
result.addElement(new Option("\tRandom number seed.\n"
+ "\t(default 1)", "S", 1, "-S <num>"));
result.add(new Option("\tTarget correct rate", "target-correct-rate",
1, "-target-correct-rate" + " 1.0"));
result.add(new Option("\tClassifiers file's path", "classifiers-xml",
1, "-classifiers-xml"
+ " C:/Program Files/Weka-3-7/classifiers.xml"));
result.add(new Option(
"\tInterval for the decreasing target correct rate", "I", 1,
"-I" + " 0.5"));
result.add(new Option(
"\tValidation set's proportion respect to Training Set",
"validation-ratio", 1, "-validation-ratio" + " 0.2"));
// result.addElement(new
// Option("\tCombination rule to use\n\t(default: AVG)",
// "ensemble-vote-rule", 1, "-ensemble-vote-rule " +
// Tag.toOptionList(TAGS_RULES)));
result.addElement(new Option(
"\tCombination rule to use\n\t(default: AVG)",
"ensemble-vote-rule", 1, "-ensemble-vote-rule " + TAGS_RULES[0]));
result.add(new Option(
"\tCluster number for clustering the base classifiers", "K", 1,
"-K" + " 5"));
result.addElement(new Option(
"\tCircle combination algorithm of the ensemble pharse",
"circle-combination-algorithm", 1,
"-circle-combination-algorithm "
+ TAGS_CIRCLECOMBINEALGORITHM[0]));
result.addElement(new Option(
"\tSelective algorithm type of the ensemble pharse",
"selective-algorithm", 1, "-selective-algorithm "
+ TAGS_SELECTIVEALGORITHM[3]));
result.add(new Option("\tNumber of execution slots.\n"
+ "\t(default 1 - i.e. no parallelism)", "num-slots", 1,
"-num-slots <num>"));
result.add(new Option(
"\tMaximum minutes to train each base classifier", "time-out",
1, "-time-out 2"));
return result.elements();
}
public String[] getOptions() {
String[] superOptions = super.getOptions();
String[] options = new String[superOptions.length + 20];
int current = 0;
options[current++] = "-target-correct-rate";
options[current++] = "" + this.getTargetCorrectRate();
options[current++] = "-I";
options[current++] = "" + this.getInterval();
options[current++] = "-validation-ratio";
options[current++] = "" + this.getValidationRatio();
options[current++] = "-ensemble-vote-rule";
options[current++] = "" + this.getEnsembleVotingRule();
options[current++] = "-K";
options[current++] = "" + this.getNumClusters();
options[current++] = "-circle-combination-algorithm";
options[current++] = "" + this.getCircleCombineAlgorithm();
options[current++] = "-selective-algorithm";
options[current++] = "" + this.getSelectiveAlgorithm();
options[current++] = "-num-slots";
options[current++] = "" + this.getNumExecutionSlots();
options[current++] = "-time-out";
options[current++] = "" + this.getTimeOut();
System.arraycopy(superOptions, 0, options, current, superOptions.length);
current += superOptions.length;
while (current < options.length) {
options[current++] = "";
}
return options;
}
public void setOptions(String[] options) throws Exception {
this.setTargetCorrectRate(Double.parseDouble(Utils.getOption(
"target-correct-rate", options)));
this.setInterval(Double.parseDouble(Utils.getOption("I", options)));
this.setValidationRatio(Double.parseDouble(Utils.getOption(
"validation-ratio", options)));
this.setEnsembleVotingRule(new SelectedTag(Utils.getOption(
"ensemble-vote-rule", options), TAGS_RULES));
this.setNumClusters(Integer.parseInt(Utils.getOption("K", options)));
this.setCircleCombineAlgorithm(new SelectedTag(Utils.getOption(
"circle-combination-algorithm", options),
TAGS_CIRCLECOMBINEALGORITHM));
this.setSelectiveAlgorithm(new SelectedTag(Utils.getOption(
"selective-algorithm", options), TAGS_SELECTIVEALGORITHM));
this.setNumExecutionSlots(Integer.parseInt(Utils.getOption("num-slots",
options)));
this.setTimeOut(Integer.parseInt(Utils.getOption("time-out", options)));
String seed = Utils.getOption('S', options);
if (seed.length() != 0) {
setSeed(Integer.parseInt(seed));
} else {
setSeed(1);
}
}
public TechnicalInformation getTechnicalInformation() {
TechnicalInformation result = new TechnicalInformation(
TechnicalInformation.Type.ARTICLE);
result.setValue(TechnicalInformation.Field.AUTHOR,
"Chen Lin, Wenqiang Chen, Cheng Qiu, Yunfeng Wu, Sridhar Krishnan, Quan Zou");
result.setValue(TechnicalInformation.Field.TITLE,
"LibD3C: Ensemble classifiers with a clustering and dynamic selection strategy");
result.setValue(TechnicalInformation.Field.YEAR, "2013");
result.setValue(TechnicalInformation.Field.JOURNAL, "Neurocomputing");
result.setValue(TechnicalInformation.Field.VOLUME, "123");
result.setValue(TechnicalInformation.Field.PAGES, " 424–435");
return result;
}
public Capabilities getCapabilities() {
Capabilities result = super.getCapabilities();
if (this.m_preBuiltClassifiers.size() > 0) {
if (this.m_Classifiers.length == 0) {
result = (Capabilities) ((Classifier) this.m_preBuiltClassifiers
.get(0)).getCapabilities().clone();
}
for (int i = 1; i < this.m_preBuiltClassifiers.size(); i++) {
result.and(((Classifier) this.m_preBuiltClassifiers.get(i))
.getCapabilities());
}
for (Capabilities.Capability cap : Capabilities.Capability.values()) {
result.enableDependency(cap);
}
}
if ((this.m_CombinationRule == 2) || (this.m_CombinationRule == 3)) {
result.disableAllClasses();
result.disableAllClassDependencies();
result.enable(Capabilities.Capability.NOMINAL_CLASS);
result.enableDependency(Capabilities.Capability.NOMINAL_CLASS);
} else if (this.m_CombinationRule == 6) {
result.disableAllClasses();
result.disableAllClassDependencies();
result.enable(Capabilities.Capability.NUMERIC_CLASS);
result.enableDependency(Capabilities.Capability.NUMERIC_CLASS);
}
return result;
}
public void buildClassifier(Instances data) throws Exception {
Instances newData = new Instances(data);
newData.deleteWithMissingClass();
this.m_Random = new Random(1000L);
cfsArray = cfsArrayCopy.toArray(new Classifier[cfsArrayCopy.size()]);
ParallelBaseClassifiersTraining bct = new ParallelBaseClassifiersTraining();
data.setClassIndex(data.numAttributes() - 1);
if (!this.flag_im) {
List<Classifier> bcfs = bct.trainingBaseClassifiers(data, cfsArray,
validatePercent, m_numExecutionSlots, timeOut,
pathOfClassifiers, parameterOfCV);
BaseClassifiersClustering bcc = new BaseClassifiersClustering();
String pathPrefix = "";
String fchooseClassifiers = pathPrefix + "chooseClassifiers.txt";
List<Integer> chooseClassifiers = bcc.clusterBaseClassifiers(
fchooseClassifiers, this.numClusters);
BaseClassifiersEnsemble bce = new BaseClassifiersEnsemble();
ensemClassifiers = bce.EnsembleClassifiers(data,
m_SelectiveAlgorithm_Type, m_CircleCombine_Type);
this.m_Classifiers = null;
this.m_Classifiers = new Classifier[ensemClassifiers.size()];
int mIndex = 0;
for (int i : ensemClassifiers) {
this.m_Classifiers[mIndex++] = bcfs.get(i);
}
} else {
imDC1 imdc = new imDC1();
imdc.getBestClassifier(newData);
myClassifier myclassifier = new myClassifier(newData,
imdc.bestClassifiers, imdc.lessLabelNum, imdc.lessLabel,
cfsArray.length);
myclassifier.initmyclassifier();
Classifier[] bc = myclassifier.build(newData);
this.m_Classifiers = null;
this.m_Classifiers = new Classifier[bc.length];
int mIndex = 0;
this.m_Classifiers = bc;
}
/*
* List<Classifier> bcfs = bct.trainingBaseClassifiers(data, cfsArray,
* validatePercent, m_numExecutionSlots, timeOut, pathOfClassifiers,
* parameterOfCV);
*
* BaseClassifiersClustering bcc = new BaseClassifiersClustering();
* String pathPrefix = ""; String fchooseClassifiers = pathPrefix +
* "chooseClassifiers.txt"; List<Integer> chooseClassifiers =
* bcc.clusterBaseClassifiers( fchooseClassifiers, this.numClusters);
*
* data.setClassIndex(data.numAttributes() - 1);
*/
// BaseClassifiersEnsemble bce = new BaseClassifiersEnsemble();
// ensemClassifiers = bce.EnsembleClassifiers(data,
// m_SelectiveAlgorithm_Type, m_CircleCombine_Type);
/*
* for (int i : ensemClassifiers) { this.m_Classifiers[mIndex++] =
* bcfs.get(i); }
*/
// save memory
data = null;
}
public double classifyInstance(Instance instance) throws Exception {
double result;
switch (this.m_CombinationRule) {
case 1:
case 2:
case 3:
case 4:
case 5:
double[] dist = distributionForInstance(instance);
if (instance.classAttribute().isNominal()) {
int index = Utils.maxIndex(dist);
if (dist[index] == 0.0D)
result = Utils.missingValue();
else
result = index;
} else {
if (instance.classAttribute().isNumeric())
result = dist[0];
else
result = Utils.missingValue();
}
break;
case 6:
result = classifyInstanceMedian(instance);
break;
default:
throw new IllegalStateException("Unknown combination rule '"
+ this.m_CombinationRule + "'!");
}
return result;
}
protected double classifyInstanceMedian(Instance instance) throws Exception {
double[] results = new double[this.m_Classifiers.length
+ this.m_preBuiltClassifiers.size()];
for (int i = 0; i < this.m_Classifiers.length; i++) {
results[i] = this.m_Classifiers[i].classifyInstance(instance);
}
for (int i = 0; i < this.m_preBuiltClassifiers.size(); i++)
results[(i + this.m_Classifiers.length)] = ((Classifier) this.m_preBuiltClassifiers
.get(i)).classifyInstance(instance);
double result;
if (results.length == 0) {
result = 0.0D;
} else {
if (results.length == 1)
result = results[0];
else
result = Utils.kthSmallestValue(results, results.length / 2);
}
return result;
}
public double[] distributionForInstance(Instance instance) throws Exception {
double[] result = new double[instance.numClasses()];
switch (this.m_CombinationRule) {
case 1:
result = distributionForInstanceAverage(instance);
break;
case 2:
result = distributionForInstanceProduct(instance);
break;
case 3:
result = distributionForInstanceMajorityVoting(instance);
break;
case 4:
result = distributionForInstanceMin(instance);
break;
case 5:
result = distributionForInstanceMax(instance);
break;
case 6:
result[0] = classifyInstance(instance);
break;
default:
throw new IllegalStateException("Unknown combination rule '"
+ this.m_CombinationRule + "'!");
}
if ((!instance.classAttribute().isNumeric())
&& (Utils.sum(result) > 0.0D)) {
Utils.normalize(result);
}
return result;
}
protected double[] distributionForInstanceAverage(Instance instance)
throws Exception {
double[] probs = this.m_Classifiers.length > 0 ? getClassifier(0)
.distributionForInstance(instance)
: ((Classifier) this.m_preBuiltClassifiers.get(0))
.distributionForInstance(instance);
for (int i = 1; i < this.m_Classifiers.length; i++) {
double[] dist = getClassifier(i).distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
probs[j] += dist[j];
}
}
int index = this.m_Classifiers.length > 0 ? 0 : 1;
for (int i = index; i < this.m_preBuiltClassifiers.size(); i++) {
double[] dist = ((Classifier) this.m_preBuiltClassifiers.get(i))
.distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
probs[j] += dist[j];
}
}
for (int j = 0; j < probs.length; j++) {
probs[j] /= (this.m_Classifiers.length + this.m_preBuiltClassifiers
.size());
}
return probs;
}
protected double[] distributionForInstanceProduct(Instance instance)
throws Exception {
double[] probs = this.m_Classifiers.length > 0 ? getClassifier(0)
.distributionForInstance(instance)
: ((Classifier) this.m_preBuiltClassifiers.get(0))
.distributionForInstance(instance);
for (int i = 1; i < this.m_Classifiers.length; i++) {
double[] dist = getClassifier(i).distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
probs[j] *= dist[j];
}
}
int index = this.m_Classifiers.length > 0 ? 0 : 1;
for (int i = index; i < this.m_preBuiltClassifiers.size(); i++) {
double[] dist = ((Classifier) this.m_preBuiltClassifiers.get(i))
.distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
probs[j] *= dist[j];
}
}
return probs;
}
protected double[] distributionForInstanceMajorityVoting(Instance instance)
throws Exception {
double[] probs = new double[instance.classAttribute().numValues()];
double[] votes = new double[probs.length];
for (int i = 0; i < this.m_Classifiers.length; i++) {
probs = getClassifier(i).distributionForInstance(instance);
int maxIndex = 0;
for (int j = 0; j < probs.length; j++) {
if (probs[j] > probs[maxIndex]) {
maxIndex = j;
}
}
for (int j = 0; j < probs.length; j++) {
if (probs[j] == probs[maxIndex]) {
votes[j] += 1.0D;
}
}
}
for (int i = 0; i < this.m_preBuiltClassifiers.size(); i++) {
probs = ((Classifier) this.m_preBuiltClassifiers.get(i))
.distributionForInstance(instance);
int maxIndex = 0;
for (int j = 0; j < probs.length; j++) {
if (probs[j] > probs[maxIndex]) {
maxIndex = j;
}
}
for (int j = 0; j < probs.length; j++) {
if (probs[j] == probs[maxIndex]) {
votes[j] += 1.0D;
}
}
}
int tmpMajorityIndex = 0;
for (int k = 1; k < votes.length; k++) {
if (votes[k] > votes[tmpMajorityIndex]) {
tmpMajorityIndex = k;
}
}
Vector majorityIndexes = new Vector();
for (int k = 0; k < votes.length; k++) {
if (votes[k] == votes[tmpMajorityIndex]) {
majorityIndexes.add(Integer.valueOf(k));
}
}
int majorityIndex = ((Integer) majorityIndexes.get(this.m_Random
.nextInt(majorityIndexes.size()))).intValue();
for (int k = 0; k < probs.length; k++)
probs[k] = 0.0D;
probs[majorityIndex] = 1.0D;
return probs;
}
protected double[] distributionForInstanceMax(Instance instance)
throws Exception {
double[] max = this.m_Classifiers.length > 0 ? getClassifier(0)
.distributionForInstance(instance)
: ((Classifier) this.m_preBuiltClassifiers.get(0))
.distributionForInstance(instance);
for (int i = 1; i < this.m_Classifiers.length; i++) {
double[] dist = getClassifier(i).distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
if (max[j] < dist[j]) {
max[j] = dist[j];
}
}
}
int index = this.m_Classifiers.length > 0 ? 0 : 1;
for (int i = index; i < this.m_preBuiltClassifiers.size(); i++) {
double[] dist = ((Classifier) this.m_preBuiltClassifiers.get(i))
.distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
if (max[j] < dist[j]) {
max[j] = dist[j];
}
}
}
return max;
}
protected double[] distributionForInstanceMin(Instance instance)
throws Exception {
double[] min = this.m_Classifiers.length > 0 ? getClassifier(0)
.distributionForInstance(instance)
: ((Classifier) this.m_preBuiltClassifiers.get(0))
.distributionForInstance(instance);
for (int i = 1; i < this.m_Classifiers.length; i++) {
double[] dist = getClassifier(i).distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
if (dist[j] < min[j]) {
min[j] = dist[j];
}
}
}
int index = this.m_Classifiers.length > 0 ? 0 : 1;
for (int i = index; i < this.m_preBuiltClassifiers.size(); i++) {
double[] dist = ((Classifier) this.m_preBuiltClassifiers.get(i))
.distributionForInstance(instance);
for (int j = 0; j < dist.length; j++) {
if (dist[j] < min[j]) {
min[j] = dist[j];
}
}
}
return min;
}
public String toString() {
if (this.m_Classifiers == null) {
return "Vote: No model built yet.";
}
String result = "Vote combines";
result = result
+ " the probability distributions of these base learners:\n";
for (int i = 0; i < this.m_Classifiers.length; i++) {
result = result + '\t' + getClassifierSpec(i) + '\n';
}
for (Classifier c : this.m_preBuiltClassifiers) {
result = result + "\t" + c.getClass().getName()
+ Utils.joinOptions(((OptionHandler) c).getOptions())
+ "\n";
}
result = result + "using the '";
switch (this.m_CombinationRule) {
case 1:
result = result + "Average of Probabilities";
break;
case 2:
result = result + "Product of Probabilities";
break;
case 3:
result = result + "Majority Voting";
break;
case 4:
result = result + "Minimum Probability";
break;
case 5:
result = result + "Maximum Probability";
break;
case 6:
result = result + "Median Probability";
break;
default:
throw new IllegalStateException("Unknown combination rule '"
+ this.m_CombinationRule + "'!");
}
result = result + "' combination rule \n";
return result;
}
public String getRevision() {
return RevisionUtils.extract("$Revision: 7220 $");
}
public void setEnvironment(Environment env) {
this.m_env = env;
}
public void ListChange() {
this.cfsArray = InitClassifiers.init(this.classifiersxml,
this.nameOfClassifiers, this.pathOfClassifiers,
this.parameterOfCV);
this.Option = InitClassifiers.classifiersOption;
this.m_Classifiers[0] = new weka.classifiers.functions.LibSVM();
for (int i = 0; i < this.cfsArray.length; i++)
this.cfsArrayCopy.add(this.cfsArray[i]);
for (int i = 0; i < this.m_Classifiers.length; i++)
this.cfsArrayCopy.add(this.m_Classifiers[i]);
}
public void printInfo(Evaluation eval) throws Exception {
System.out.println(eval.toSummaryString());
System.out.println(eval.toClassDetailsString());
System.out.println(eval.toMatrixString());
}
public static void main(String[] argv) throws Exception {
//String x="-c 2 D://MEKA.libsvm";
// argv=x.split(" ");
String TrainFilePath = null, cvNum = null, TestFilePath = null, modelPath = null, resultFilePath = null;
//int SelectiveAlgorithm_Type=2;
BufferedWriter writeRate = new BufferedWriter(new FileWriter(".correctly"));
boolean cross = false;
boolean train = false;
boolean predict = false;
try {
TrainFilePath = argv[0];
if (argv[0].equals("-m")) {
flag_im = true;
if (argv[1].equals("-c")) {
cvNum = argv[2];
cross = true;
cvNum = argv[2];
TrainFilePath = argv[3];
} else if (argv[1].equals("-t")) {
TrainFilePath = argv[2];
train = true;
} else if (argv[1].equals("-p")) {
modelPath = argv[2];
TestFilePath = argv[3];
resultFilePath = argv[4];
predict = true;
}
} else {
if (argv[0].equals("-c")) {
cvNum = argv[1];
TrainFilePath = argv[2];
///SelectiveAlgorithm_Type = Integer.parseInt(argv[3]);
cross = true;
} else if (argv[0].equals("-t")) {
TrainFilePath = argv[1];
//SelectiveAlgorithm_Type = Integer.parseInt(argv[3]);
train = true;
} else if (argv[0].equals("-p")) {
modelPath = argv[1];
TestFilePath = argv[2];
resultFilePath = ".predict";
//SelectiveAlgorithm_Type = Integer.parseInt(argv[4]);
predict = true;
}
}
InstanceUtil iu = new InstanceUtil();
BaseClassifiersEnsemble tt = new BaseClassifiersEnsemble();
LibD3C d3c = new LibD3C();
try{
boolean fileChange = iu.convertToArff(TrainFilePath);
if (fileChange){
TrainFilePath = "temp.arff";
}
}
catch (Exception e) {
System.out.println("文件格式转换失败");
}
// d3c.m_SelectiveAlgorithm_Type =SelectiveAlgorithm_Type;
Instances input = null;
if (flag_im == true) {
if (train) {
d3c.ListChange();
try{
input = iu.getInstances(TrainFilePath);
}
catch (Exception e) {
System.out.println("找不到文件路径");
}
input.setClassIndex(input.numAttributes() - 1);
iu.SaveModel(d3c, input);
} else if (cross) {
d3c.ListChange();
try{
input = iu.getInstances(TrainFilePath);
}
catch (Exception e) {
System.out.println("找不到文件路径");
}
input.setClassIndex(input.numAttributes() - 1);
Evaluation eval = new Evaluation(input);
eval.crossValidateModel(d3c, input,
Integer.parseInt(cvNum), new Random(d3c.getSeed()));
d3c.printInfo(eval);
} else if (predict) {
iu.LoadModel(modelPath, TestFilePath, resultFilePath);
}
} else {
if (train) {
d3c.ListChange();
try{
input = iu.getInstances(TrainFilePath);
}
catch (Exception e) {
System.out.println("找不到文件路径");
}
input.setClassIndex(input.numAttributes() - 1);
iu.SaveModel(d3c, input);
} else if (cross){
d3c.ListChange();
try{
input = iu.getInstances(TrainFilePath);
}
catch (Exception e) {
System.out.println("找不到文件路径");
}
input.setClassIndex(input.numAttributes() - 1);
Evaluation eval = new Evaluation(input);
eval.crossValidateModel(d3c, input,
Integer.parseInt(cvNum), new Random(d3c.getSeed()));
writeRate.write(String.valueOf(1-eval.errorRate()));
writeRate.flush();
writeRate.close();
d3c.printInfo(eval);
}
else if (predict) {
iu.LoadModel(modelPath, TestFilePath, resultFilePath);
}
}
} catch (Exception e) {
// TODO Auto-generated catch block
System.out.println("命令格式");
System.out.println("Usage: JAVA -jar [option] [option]....");
System.out.println("-c fold --------crossValidation");
System.out.println("-t -------trainModel");
System.out.println("-p modelPath -----predict");
System.out.println("Usage:");
System.out.println("-crossValidation: JAVA -jar libD3c.jar -c 5 filePath");
System.out.println("-trainModel: JAVA -jar libD3c.jar -t filePath(train)");
System.out.println("-predictTest: JAVA -jar libD3c.jar -p train.model filePath(test)");
e.printStackTrace();
}
// runClassifier(new LibD3C(), argv);
}
}