Searching for the optimal ordering of classes in rule induction
Yükleniyor...
Dosyalar
Tarih
2012-11-15
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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. In this paper, we propose two algorithms to improve this heuristic. The first algorithm starts with the ordering the heuristic provides and searches for better orderings by swapping consecutive classes. The second algorithm transforms the ordering search problem into an optimization problem and uses the solution of the optimization problem to extract the optimal ordering. We compared our algorithms with the original Ripper on 8 datasets from UCI repository [2]. Simulation results show that our algorithms produce rulesets that are significantly better than those produced by Ripper proper.
Açıklama
Anahtar Kelimeler
Ant colony optimization, Classification, Approximation algorithms, Approximation methods, Decision trees, Error analysis, Heuristic algorithms, Optical character recognition software, Optimization, Ripper, UCI repository, Class swapping, Optimal class ordering, Optimal ordering extraction, Optimization problem, Ordering search problem, Rule induction algorithms, Two-class problems, Data handling, Knowledge based systems, Optimisation, Search problems, Sequences
Kaynak
Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012)
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
Sayı
Künye
Ata, S. & Yıldız, O. T. (2012). Searching for the optimal ordering of classes in rule induction. Paper presented at the Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012), 1277-1280.
