摘要: In this paper we analyze the most popular evaluation metrics for separate-and-conquer 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-weighted difference between covered positive negative examples, find optimal point known or assumed costs. We also straightforward generalization m-estimate trades off these prototypes.