Show simple item record

dc.contributor.authorAn, Jiyuanen_US
dc.contributor.authorChen, Yi-Ping Phoebeen_US
dc.date.accessioned2017-05-03T16:58:52Z
dc.date.available2017-05-03T16:58:52Z
dc.date.issued2005en_US
dc.date.modified2010-08-30T07:04:27Z
dc.identifier.issn0302-9743en_US
dc.identifier.doi10.1007/11552451_6en_AU
dc.identifier.urihttp://hdl.handle.net/10072/25647
dc.description.abstractInducing general functions from specific training examples is a central problem in the machine learning. Using sets of If-then rules is the most expressive and readable manner. To find If-then rules, many induction algorithms such as ID3, AQ, CN2 and their variants, were proposed. Sequential covering is the kernel technique of them. To avoid testing all possible selectors, Entropy gain is used to select the best attribute in ID3. Constraint of the size of star was introduced in AQ and beam search was adopted in CN2. These methods speed up their induction algorithms but many good selectors are filtered out. In this work, we introduce a new induction algorithm that is based on enumeration of all possible selectors. Contrary to the previous works, we use pruning power to reduce irrelative selectors. But we can guarantee that no good selectors are filtered out. Comparing with other techniques, the experiment results demonstrate that the rules produced by our induction algorithm have high consistency and simplicity.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherSpringeren_US
dc.publisher.placeBerlinen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom37en_US
dc.relation.ispartofpageto44en_US
dc.relation.ispartofjournalLecture Notes in Computer Scienceen_US
dc.relation.ispartofvolume3682en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode280213en_US
dc.titleYet Another Induction Algorithmen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.date.issued2005
gro.hasfulltextNo Full Text


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record