C92-1044 In Appendix A we show the basic classifier algorithm . Definition 1 A g-c-hierarchy
P86-1036 > ( C2 X ) ( C1 X ) ) ) If the classifier algorithm is complete , the reverse is
H86-1008 > ( C2 X ) ( C1 X ) ) ) If the classifier algorithm is complete , the reverse is
P97-1056 k-nearest neighbor ( k - NN ) classifier algorithm . The instances of a task are
E97-1056 k-nearest neighbor ( k - NN ) classifier algorithm . The instances of a task are
W13-2220 determined by the choice of the classifier algorithm and input features . 1 Introduction
W11-1720 clustering and rule induction classifier algorithms . In particular , we want to
W06-2926 pair ; this is used to train a classifier Algorithm 1 Pseudo Code of the dependency
C04-1088 any number of features to the classifier algorithm and expect it to select relevant
W01-1615 for each subset , the automatic classifier algorithm produces a decision tree that
W12-0707 investigate this method by exploring classifier algorithms other than transductive SVM and
W13-2220 on the specific choice of the classifier algorithm , its hyper-parameters and input
W03-0201 forming the basis for feedback . 4 Classifier Algorithm The present approach ignores
S15-2130 Manning et al. , 2014 ) tool . The classifier algorithm was Maximum Entropy3 , and the
J13-3009 representations . Currently , three classifier algorithms are avail - able : Naive Bayes
W13-3614 classifiers that all run the IGTree classifier algorithm ( Daelemans et al. , 1997 ) ,
S07-1055 negex ) to predict best system ( classifier algorithm / applicable feature set ) for
C96-1030 in the corpus ; and using of a classifier algorithm to remove redundancy from the
I05-5002 subsequent application of the classifier algorithm and human evaluation , and 2
hide detail