Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Aline Medeiros Saettler"'
Autor:
ALINE MEDEIROS SAETTLER
[pt] A construção de árvores de decisão é um problema central em diversas áreas da ciência da computação, por exemplo, teoria de banco de dados e aprendizado computacional. Este problema pode ser visto como o problema de avaliar uma função
Publikováno v:
Algorithmica. 80:3431-3436
This erratum fixes a technical problem in the paper published in Algorithmica, Volume 79, Number 3, November 2017, pp. 886–908. Theorem 1 of this paper gives upper bounds on both worst testing cost and expected testing cost of the decision tree bui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b9fc9f251b2b65a57ce4658b8fb1ecf
https://doi.org/10.1007/s00453-018-0423-8
https://doi.org/10.1007/s00453-018-0423-8
Publikováno v:
Information Processing Letters. 127:27-31
Oblivious decision trees are decision trees where every node in the same level is associated with the same attribute. These trees have been studied in the context of feature selection. In this paper, we study the problem of constructing an oblivious
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49f1777ad0835567094418085f81ee8b
https://doi.org/10.1016/j.ipl.2017.06.011
https://doi.org/10.1016/j.ipl.2017.06.011
Publikováno v:
Anais do Concurso de Teses e Dissertações da SBC (CTD-SBC).
Decision trees are a central structure in computer science, having applications in many areas. This thesis contributes to the understanding of this important structure by proving by proving theoretical bounds on its behavior and also providing algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fc24eb8161f424e7f7d91c99e90d307
https://doi.org/10.5753/ctd.2018.3649
https://doi.org/10.5753/ctd.2018.3649
Publikováno v:
Information Processing Letters. 115:594-599
The cost of a test in a decision tree can depend on its result (value).We provide an O ( log ? ( n ) ) approximation for binary tests and value dependent costs.We provide an n approximation for multiway tests and value dependent costs. We study the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17597de17bbe6bad25793f645388e44e
https://doi.org/10.1016/j.ipl.2015.02.006
https://doi.org/10.1016/j.ipl.2015.02.006
Autor:
ALINE MEDEIROS SAETTLER
Publikováno v:
Repositório Institucional da PUC-RIO (Projeto Maxwell)
Pontifícia Universidade Católica do Rio de Janeiro (PUC-RIO)
instacron:PUC_RIO
Pontifícia Universidade Católica do Rio de Janeiro (PUC-RIO)
instacron:PUC_RIO
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO A construção de árvores de decisão é um problema central em diversas áreas da ciência da computação, por exemplo, teoria de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::4659098aa19083bf6cd7a805d68fb04a
https://www.maxwell.vrac.puc-rio.br/colecao.php?strSecao=resultado&nrSeq=56533@1
https://www.maxwell.vrac.puc-rio.br/colecao.php?strSecao=resultado&nrSeq=56533@1
Autor:
ALINE MEDEIROS SAETTLER
[pt] O problema de minimizar o custo de avaliar uma função discreta lendo sequencialmente as suas variáveis é um problema que surge em diversas aplicações, entre elas sistemas de diagnóstico automático e aprendizado ativo. Neste problema, cad
Publikováno v:
Algorithms and Computation ISBN: 9783662489703
ISAAC
ISAAC
We characterize the best possible trade-off achievable when optimizing the construction of a decision tree with respect to both the worst and the expected cost. It is known that a decision tree achieving the minimum possible worst case cost can behav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c749a0412b879df6dcedc2a3bfb20f44
http://hdl.handle.net/11562/933101
http://hdl.handle.net/11562/933101
In several applications of automatic diagnosis and active learning a central problem is the evaluation of a discrete function by adaptively querying the values of its variables until the values read uniquely determine the value of the function. In ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16e90fd5553c59c5e7f4671ed2e34478
http://arxiv.org/abs/1309.2796
http://arxiv.org/abs/1309.2796