Searching for the optimal ordering of classes in rule induction

Basit Öğe Kaydı
dc.authorid0000-0002-3004-1204
dc.authorid0000-0001-5838-4615
dc.contributor.authorAta, Sezinen_US
dc.contributor.authorYıldız, Olcay Taneren_US
dc.date.accessioned2015-07-14T23:46:49Z
dc.date.available2015-07-14T23:46:49Z
dc.date.issued2012-11-15
dc.departmentIşık Üniversitesi, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.departmentIşık University, Faculty of Engineering, Department of Computer Engineeringen_US
dc.description.abstractRule 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.en_US
dc.description.versionPublisher's Versionen_US
dc.identifier.citationAta, 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.en_US
dc.identifier.endpage1280
dc.identifier.isbn9784990644109
dc.identifier.isbn9781467322164
dc.identifier.issn1051-4651
dc.identifier.scopus2-s2.0-84874561887
dc.identifier.scopusqualityN/A
dc.identifier.startpage1277
dc.identifier.urihttps://hdl.handle.net/11729/615
dc.identifier.wosWOS:000343660601092
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakConference Proceedings Citation Index – Science (CPCI-S)en_US
dc.institutionauthorAta, Sezinen_US
dc.institutionauthorYıldız, Olcay Taneren_US
dc.institutionauthorid0000-0002-3004-1204
dc.institutionauthorid0000-0001-5838-4615
dc.language.isoenen_US
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.publisherIEEEen_US
dc.relation.ispartofProceedings of the 21st International Conference on Pattern Recognition (ICPR2012)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectAnt colony optimizationen_US
dc.subjectClassificationen_US
dc.subjectApproximation algorithmsen_US
dc.subjectApproximation methodsen_US
dc.subjectDecision treesen_US
dc.subjectError analysisen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectOptical character recognition softwareen_US
dc.subjectOptimizationen_US
dc.subjectRipperen_US
dc.subjectUCI repositoryen_US
dc.subjectClass swappingen_US
dc.subjectOptimal class orderingen_US
dc.subjectOptimal ordering extractionen_US
dc.subjectOptimization problemen_US
dc.subjectOrdering search problemen_US
dc.subjectRule induction algorithmsen_US
dc.subjectTwo-class problemsen_US
dc.subjectData handlingen_US
dc.subjectKnowledge based systemsen_US
dc.subjectOptimisationen_US
dc.subjectSearch problemsen_US
dc.subjectSequencesen_US
dc.titleSearching for the optimal ordering of classes in rule inductionen_US
dc.typeConference Objecten_US
dspace.entity.typePublication

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
615.pdf
Boyut:
293.66 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Publisher's Version
İndir

Koleksiyon

Bildiri Koleksiyonu | Bilgisayar Mühendisliği Bölümü
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu