Non-incremental classification learning algorithms based on voting feature intervals

Simple item page
buir.supervisorGüvenir, Halil Altay
dc.contributor.authorDemiröz, Gülşen
dc.date.accessioned2016-01-08T20:14:24Z
dc.date.available2016-01-08T20:14:24Z
dc.date.copyright1997-08
dc.date.issued1997-08
dc.descriptionCataloged from PDF version of article. en_US
dc.description Thesis (Master's): Department of Computer Engineering and Information Science and the Institute of Engineering and Science of Bilkent University, 1997.en_US
dc.descriptionIncludes bibliographical references (leaves 147-154).en_US
dc.description.abstractLearning is one of the necessary abilities of an intelligent agent. This thesis proposes several learning algorithms for multi-concept descriptions in the form of feature intervals, called Voting Feature Intervals (VFI) algorithms. These algorithms are non-incremental classification learning algorithms, and use feature projection based knowledge representation for the classification knowledge induced from a set of preclassified examples. The concept description learned is a set of intervals constructed separately for each feature. Each interval carries classification information for all classes. The classification of an unseen instance is based on a voting scheme, where each feature distributes its vote among all classes. Empirical evaluation of the VFI algorithms has shown that they are the best performing algorithms among other previously developed feature projection based methods in term of classification accuracy. In order to further improve the accuracy, genetic algorithms are developed to learn the optimum feature weights for any given classifier. Also a new crossover operator, called continuous uniform crossover, to be used in this weight learning genetic algorithm is proposed and developed during this thesis. Since the explanation ability of a learning system is as important as its accuracy, VFI classifiers are supplemented with a facility to convey what they have learned in a comprehensible way to humans.
dc.description.provenanceMade available in DSpace on 2016-01-08T20:14:24Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5)en
dc.description.statementofresponsibility Gülşen Demiröz en_US
dc.format.extentxix, 161 leaves ; 30 cmen_US
dc.identifier.itemidBILKUTUPB038254
dc.identifier.urihttp://hdl.handle.net/11693/17895
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMachine learning
dc.subjectSupervised learning
dc.subjectClassification
dc.subjectInductive learning
dc.subjectNon-incremental learning
dc.subjectFeature intervals
dc.subjectVoting
dc.subjectGenetic algorithms
dc.titleNon-incremental classification learning algorithms based on voting feature intervalsen_US
dc.title.alternativeOylayan öznitelik bölüntülerine dayalı toplu sınıflandırma öğrenme algoritmaları
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
B038254.pdf
Size:
8.39 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science