On Generating and Simplifying Decision Trees Using Tree Automata Models
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/25 |
Resumo: | Tree automata are widely used in applications such as XML document manipulation, natural language processing, and formal verification. We propose in this paper to generate decision trees classifiers using tree automata models. Mainly, two objectives are : 1) fitting these methods in a formal frame and, 2) using tree automata in modeling decision trees and classifying heterogeneous information sources. Specifically, the size of a decision tree is reduced by a post-pruning procedure: a given decision tree is converted into a tree automaton and then the latter is simplified by eliminating useless states and non-determinism. We report some empirical experiments on real-world datasets. |
id |
UFLA-5_ca4aacf181e2e8a5a7a127e21a6fba60 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/25 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
On Generating and Simplifying Decision Trees Using Tree Automata ModelsKnowledge DiscoveryMachine LearningClassificationDecision TreesTree AutomataDeterminizationTree automata are widely used in applications such as XML document manipulation, natural language processing, and formal verification. We propose in this paper to generate decision trees classifiers using tree automata models. Mainly, two objectives are : 1) fitting these methods in a formal frame and, 2) using tree automata in modeling decision trees and classifying heterogeneous information sources. Specifically, the size of a decision tree is reduced by a post-pruning procedure: a given decision tree is converted into a tree automaton and then the latter is simplified by eliminating useless states and non-determinism. We report some empirical experiments on real-world datasets.Editora da UFLA2013-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/25INFOCOMP Journal of Computer Science; Vol. 12 No. 2 (2013): December 2013; 32-431982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/25/12Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessSouad, Taleb ZouggarBaghdad, AtmaniAbdelkader, Adla2017-07-20T15:41:16Zoai:infocomp.dcc.ufla.br:article/25Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:12.116042INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
On Generating and Simplifying Decision Trees Using Tree Automata Models |
title |
On Generating and Simplifying Decision Trees Using Tree Automata Models |
spellingShingle |
On Generating and Simplifying Decision Trees Using Tree Automata Models Souad, Taleb Zouggar Knowledge Discovery Machine Learning Classification Decision Trees Tree Automata Determinization |
title_short |
On Generating and Simplifying Decision Trees Using Tree Automata Models |
title_full |
On Generating and Simplifying Decision Trees Using Tree Automata Models |
title_fullStr |
On Generating and Simplifying Decision Trees Using Tree Automata Models |
title_full_unstemmed |
On Generating and Simplifying Decision Trees Using Tree Automata Models |
title_sort |
On Generating and Simplifying Decision Trees Using Tree Automata Models |
author |
Souad, Taleb Zouggar |
author_facet |
Souad, Taleb Zouggar Baghdad, Atmani Abdelkader, Adla |
author_role |
author |
author2 |
Baghdad, Atmani Abdelkader, Adla |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Souad, Taleb Zouggar Baghdad, Atmani Abdelkader, Adla |
dc.subject.por.fl_str_mv |
Knowledge Discovery Machine Learning Classification Decision Trees Tree Automata Determinization |
topic |
Knowledge Discovery Machine Learning Classification Decision Trees Tree Automata Determinization |
description |
Tree automata are widely used in applications such as XML document manipulation, natural language processing, and formal verification. We propose in this paper to generate decision trees classifiers using tree automata models. Mainly, two objectives are : 1) fitting these methods in a formal frame and, 2) using tree automata in modeling decision trees and classifying heterogeneous information sources. Specifically, the size of a decision tree is reduced by a post-pruning procedure: a given decision tree is converted into a tree automaton and then the latter is simplified by eliminating useless states and non-determinism. We report some empirical experiments on real-world datasets. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-12-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/25 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/25 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/25/12 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 12 No. 2 (2013): December 2013; 32-43 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874739973390336 |