Show simple item record  

dc.contributor.authorPfahringer, Bernhard
dc.contributor.authorHolmes, Geoffrey
dc.coverage.spatialConference held at University of Szeged, Hungaryen_NZ
dc.date.accessioned2008-11-28T01:56:00Z
dc.date.available2008-11-28T01:56:00Z
dc.date.issued2003
dc.identifier.citationPfahringer, B. & Holmes, G. (2003). Propositionalization through stochastic discrimination. Paper presented at the 13th International Conference on Inductive Logic Programming(ILP 2003), Szeged, Hungary, September 29 - October 1, 2003.en_US
dc.identifier.urihttps://hdl.handle.net/10289/1492
dc.description.abstractA Simple algorithm base on the theory of stochastic discrimination is developed for the fast extraction of sub-graphs with potential discriminative power from a given set of pre-classified graphs. A preliminary experimental evaluation indicates the potential of the approach. Limitations are discussed as well as directions for future research.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherDepartment of Informatics, University of Szegeden_NZ
dc.subjectcomputer scienceen_US
dc.subjectpropositionalizationen_US
dc.titlePropositionalization through stochastic discriminationen_US
dc.typeConference Contributionen_US
dc.relation.isPartOf13th International Conference on Inductive Logic Programmingen_NZ
pubs.begin-page60en_NZ
pubs.elements-id15974
pubs.end-page68en_NZ
pubs.finish-date2003-10-01en_NZ
pubs.place-of-publicationHungaryen_NZ
pubs.start-date2003-09-29en_NZ
pubs.volumeProceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programmingen_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record