作者: Johannes Fürnkranz , Peter A. Flach
DOI:
关键词: Area under the roc curve 、 Heuristics 、 Mathematical optimization 、 Computer science 、 Entropy (information theory) 、 Information gain
摘要: In this paper we analyze the most popular search heuristics for separate-andconquer rule learning algorithms. Our results show that all commonly used heuristics, including accuracy, weighted relative entropy, Gini index and information gain, are equivalent to one of two fundamental prototypes: precision, which tries optimize area under ROC curve unknown costs, a cost-eighted difference between covered positive negative examples, find optimal point known or assumed costs. We also straight-forward generalization m-heuristic is means trading off these prototypes.