Chipper --A Novel Algorithm for Concept Description

作者: 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.

参考文章(15)
Thomas G. Dietterich, Machine-Learning Research Ai Magazine. ,vol. 18, pp. 97- 136 ,(1997) , 10.1609/AIMAG.V18I4.1324
Steven L. Salzberg, Alberto Segre, Programs for Machine Learning ,(1994)
Cecilia Sönströd, Lars Niklasson, Ulf Johansson, Why Rule Extraction Matters international conference on software engineering. pp. 47- 52 ,(2004)
Mark A. Hall, Ian H. Witten, Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques ,(1999)
Cecilia Sönströd, Ulf Johansson, None, Towards a Unified View on Concept Description international conference on data mining. pp. 59- 65 ,(2007)
William W. Cohen, Fast Effective Rule Induction Machine Learning Proceedings 1995. pp. 115- 123 ,(1995) , 10.1016/B978-1-55860-377-6.50023-2
C. L. Blake, UCI Repository of machine learning databases www.ics.uci.edu/〜mlearn/MLRepository.html. ,(1998)
Cecilia Sonstrod, Ulf Johansson, Concept Description - A Fresh Look international joint conference on neural network. pp. 2415- 2420 ,(2007) , 10.1109/IJCNN.2007.4371336
Johannes Fürnkranz, Gerhard Widmer, Incremental Reduced Error Pruning Machine Learning Proceedings 1994. pp. 70- 77 ,(1994) , 10.1016/B978-1-55860-335-6.50017-9