Quadratic programming for class ordering in rule induction
Yükleniyor...
Tarih
2015-03-01
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier Science BV
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Separate-and-conquer type rule induction algorithms such as Ripper, solve a K>2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing prior probabilities. Although the heuristic works well in practice, there is much room for improvement. In this paper, we propose a novel approach to improve this heuristic. The approach transforms the ordering search problem into a quadratic optimization problem and uses the solution of the optimization problem to extract the optimal ordering. We compared new Ripper (guided by the ordering found with our approach) with original Ripper (guided by the heuristic ordering) on 27 datasets. Simulation results show that our approach produces rulesets that are significantly better than those produced by the original Ripper.
Açıklama
Anahtar Kelimeler
Rule induction, Quadratic programming, Class ordering, Classification Trees, Algorithms, Class ordering, Heuristic ordering, Optimal ordering, Optimization problems, Prior probability, Quadratic optimization problems, Rule induction algorithms, Optimization, Artificial intelligence, Classification (of information), Classification rules
Kaynak
Pattern Recognition Letters
WoS Q Değeri
Q2
Scopus Q Değeri
Q1
Cilt
54
Sayı
Künye
Yıldız, O. T. (2015). Quadratic programming for class ordering in rule induction. Pattern Recognition Letters, 54, 63-68. doi:10.1016/j.patrec.2014.12.002
