A Rules-to-Trees Conversion in the Inductive Database System VINLEN

dc.contributor.authorŚnieżyński, Bartłomiej
dc.contributor.authorMichalski, Ryszard S.
dc.date.accessioned2006-11-03T18:17:32Z
dc.date.available2006-11-03T18:17:32Z
dc.date.issued2005-06
dc.description.abstractDecision trees and rules are completing methods of knowledge representation. Both have advantages in some applications. Algorithms that convert trees to rules are common. In the paper an algorithm that converts rules to decision tree and its implementation in inductive database VINLEN is presented.
dc.format.extent1555 bytes
dc.format.extent116187 bytes
dc.format.mimetypetext/xml
dc.format.mimetypeapplication/pdf
dc.identifier.citationSzydlo, T., Śnieżyński, B. and Michalski, R. S., "A Rules-to-Trees Conversion in the Inductive Database System VINLEN," Proceedings of the Intelligent Information Processing and Web Mining Conference, IIPWM 05, Gdansk, Poland, June 13-16, 2005.
dc.identifier.urihttps://hdl.handle.net/1920/1493
dc.language.isoen_US
dc.relation.ispartofseriesP 05-4
dc.subjectMachine learning
dc.subjectDecision tree learning
dc.subjectDecision making
dc.subjectInductive databases
dc.titleA Rules-to-Trees Conversion in the Inductive Database System VINLEN
dc.typePresentation

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
05-04.pdf
Size:
113.46 KB
Format:
Adobe Portable Document Format