Knowledge analyisis with tree patterns

Tree-structured knowledge representations are increasingly being used since the relationships between data objects can be represented in a more meaningful way. A number of tree mining algorithms were developed for mining different subtree types using different parameters. At this point in research i...

Full description

Bibliographic Details
Main Authors: Hadzic, Fedja, Dillon, Tharam S., Chang, Elizabeth
Format: Conference Paper
Published: IEEE Xplore 2008
Online Access:http://hdl.handle.net/20.500.11937/16420
_version_ 1848749171219103744
author Hadzic, Fedja
Dillon, Tharam S.
Chang, Elizabeth
author_facet Hadzic, Fedja
Dillon, Tharam S.
Chang, Elizabeth
author_sort Hadzic, Fedja
building Curtin Institutional Repository
collection Online Access
description Tree-structured knowledge representations are increasingly being used since the relationships between data objects can be represented in a more meaningful way. A number of tree mining algorithms were developed for mining different subtree types using different parameters. At this point in research it would be useful to discuss what kind of sub-problems can be solved within the current tree mining framework. In this paper we provide a general overview of the development in the area of tree mining and discuss motivations and useful application areas for each development. Implications of using different tree mining parameters and constraints are discussed. Such an overview will be particularly useful for those not so familiar with the area of tree mining as it can reveal useful applications within their domain of interest. It gives guidance as to which type of tree mining will be most useful for their particular application.
first_indexed 2025-11-14T07:16:42Z
format Conference Paper
id curtin-20.500.11937-16420
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T07:16:42Z
publishDate 2008
publisher IEEE Xplore
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-164202022-02-28T05:16:48Z Knowledge analyisis with tree patterns Hadzic, Fedja Dillon, Tharam S. Chang, Elizabeth Tree-structured knowledge representations are increasingly being used since the relationships between data objects can be represented in a more meaningful way. A number of tree mining algorithms were developed for mining different subtree types using different parameters. At this point in research it would be useful to discuss what kind of sub-problems can be solved within the current tree mining framework. In this paper we provide a general overview of the development in the area of tree mining and discuss motivations and useful application areas for each development. Implications of using different tree mining parameters and constraints are discussed. Such an overview will be particularly useful for those not so familiar with the area of tree mining as it can reveal useful applications within their domain of interest. It gives guidance as to which type of tree mining will be most useful for their particular application. 2008 Conference Paper http://hdl.handle.net/20.500.11937/16420 10.1109/HICSS.2008.226 IEEE Xplore fulltext
spellingShingle Hadzic, Fedja
Dillon, Tharam S.
Chang, Elizabeth
Knowledge analyisis with tree patterns
title Knowledge analyisis with tree patterns
title_full Knowledge analyisis with tree patterns
title_fullStr Knowledge analyisis with tree patterns
title_full_unstemmed Knowledge analyisis with tree patterns
title_short Knowledge analyisis with tree patterns
title_sort knowledge analyisis with tree patterns
url http://hdl.handle.net/20.500.11937/16420