Extracting common subtrees from decision trees

Lazarescu, M. M., Caelli, T. and Venkatesh, S. 1998, Extracting common subtrees from decision trees, International journal of pattern recognition and artificial intelligence, vol. 12, no. 6, pp. 867-879.

Attached Files
Name Description MIMEType Size Downloads

Title Extracting common subtrees from decision trees
Author(s) Lazarescu, M. M.
Caelli, T.
Venkatesh, S.ORCID iD for Venkatesh, S. orcid.org/0000-0001-8675-6631
Journal name International journal of pattern recognition and artificial intelligence
Volume number 12
Issue number 6
Start page 867
End page 879
Total pages 13
Publisher World Scientific Publishing Co Pte Ltd
Place of publication Toh Tuck Link, Singapore
Publication date 1998
ISSN 0218-0014
Keyword(s) common knowledge
path planning
string matching
Summary This paper explores an efficient technique for the extraction of common subtrees in decision trees. The method is based on a Suffix Tree string matching process and the algorithm is applied to the problem of finding common decision rules in path planning.
Language eng
Field of Research 080109 Pattern Recognition and Data Mining
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©1998, World Scientific Publishing Co.
Persistent URL http://hdl.handle.net/10536/DRO/DU:30044211

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 552 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Thu, 05 Apr 2012, 15:58:04 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.