13411

Автор(ов): 

1

Параметры публикации
Тип публикации: 
Доклад
Название: 
Lower-bound Estimate for Cost-sensitive Decision Trees
Наименование конференции: 
18th IFAC World Congress (Milano, Italy, 2011)
Наименование источника: 
Proceedings of the 18th IFAC World Congress (Milano, 2011)
Город: 
Milan
Издательство: 
International Federation of Automatic Control (IFAC)
Год издания: 
2011
Страницы: 
9005-9010
Аннотация
While an extensive body of literature investigates problems of decision trees growing, just a few study lower-bound estimates for the expected classification cost of decision trees, especially for varying costs of tests. In this paper a new lower-bound estimate is proposed. Computation of the estimate is reduced to solving a series of set-covering problems. Computational complexity and other properties of the lower-bound estimate are investigated. The top-down algorithm of tree construction based on the proposed estimate is tested against several popular greedy cost-sensitive heuristics on a range of standard data sets from UCI Machine Learning Repository.
Библиографическая ссылка: 
Губко М.В. Lower-bound Estimate for Cost-sensitive Decision Trees / Proceedings of the 18th IFAC World Congress (Milano, 2011). Milano: International Federation of Automatic Control (IFAC), 2011. С. 9005-9010.