W11-1720 have been passed to the Weka PART rule-induction classifier . The best results
W03-2710 task , a memory-based one and a rule-induction one . For the former we used
W01-0719 important role . One advantage of the rule-induction algorithms is that their output
W08-0406 the hand-aligned data used for rule-induction is that it is out of domain compared
P05-2020 trees ( C4 .5 ) , bagging and rule-induction ( Ripper ) machine learning techniques
N06-2032 question-answering processes . Using a rule-induction algorithm with automatically
W02-0221 report the results of applying a rule-induction method to train and test DATE
P01-1012 in human-machine interactions : Rule-induction versus memory-based learning
P01-1012 For the experiments we used the rule-induction algorithm RIPPER ( Cohen 1996
W99-0608 decision trees , neural networks , rule-induction sys - tems , etc. ) . Several
C96-2130 distribution . We performed a rule-induction experiment using the lexicon
S01-1020 ingtechniques,viz.memory-basedlearningand rule-induction . Throughoptimizationbycross
W03-2710 For this purpose we train both a rule-induction and a memory-based learning algorithm
J97-3003 interesting by-product of the proposed rule-induction technique is the automatic discovery
J06-4007 eager learning approach : It is a rule-induction algo - rithm , which displays
W98-1224 e.g. , decision-tree algorithms , rule-induction , or connectionist-learning algorithms
hide detail