2011
DOI: 10.3233/ida-2011-0489
|View full text |Cite
|
Sign up to set email alerts
|

Component-based decision trees for classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(23 citation statements)
references
References 22 publications
0
23
0
Order By: Relevance
“…For example, component DT design, introduced by Delibasic, Jovanovic, Vukicevic, Suknovic, and Obradovic (2011), enables user to intelligently select in advance implemented components, best suited for specific data set. Such defined algorithms can provide much higher accuracy of classification, as well as the lower complexity of generated tree from the original DT algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…For example, component DT design, introduced by Delibasic, Jovanovic, Vukicevic, Suknovic, and Obradovic (2011), enables user to intelligently select in advance implemented components, best suited for specific data set. Such defined algorithms can provide much higher accuracy of classification, as well as the lower complexity of generated tree from the original DT algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…That framework was further evaluated in [13]. Because of the large space of algorithms in component-based algorithm design, the need for AAD emerged.…”
Section: Related Workmentioning
confidence: 99%
“…The question of whether the combination of components could improve algorithm performance asked by [42] is positively answered in [13]. This approach is strongly supported by the series of No Free lunch theories [50] where authors proved that there is no optimal algorithm for every problem, but one can always design an optimal algorithm for the data at hand.…”
Section: Component-based Designmentioning
confidence: 99%
See 2 more Smart Citations