作者: Cecilia Sönströd , Tuve Löfström , Henrik Boström , Ulf Johansson
DOI:
关键词:
摘要: In this paper, several demands placed on concept description algorithms are identified and discussed. The most important criterion is the ability to produce compact rule sets that, in a natural accurate way, describe relationships underlying domain. An algorithm based criteria presented evaluated. algorithm, named Chipper, produces decision lists, where each covers maximum number of remaining instances while meeting requested accuracy requirements. experiments, Chipper evaluated nine UCI data sets. main result that understandable sets, clearly fulfilling overall goal description. Chipper's similar standard tree induction algorithms, have superior comprehensibility.