2017
DOI: 10.1016/j.procs.2017.05.218
|View full text |Cite
|
Sign up to set email alerts
|

Improving Performance of Multiclass Classification by Inducing Class Hierarchies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
34
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(35 citation statements)
references
References 12 publications
1
34
0
Order By: Relevance
“…This higher RAM, however, is reserved for a shorter period of time (CPU usage), consequently mitigating the memory overhead caused by the parallel execution of the distributed models. These results are in general aligned with the fact that multiclass classification problems are harder to solve than their binary decompositions, and hence a larger MLP topology may be needed for the multiclass classifiers, at the expense of higher CPU and RAM requirements [33][34][35].…”
Section: Comparing the Centralized And Distributed Modelssupporting
confidence: 55%
See 2 more Smart Citations
“…This higher RAM, however, is reserved for a shorter period of time (CPU usage), consequently mitigating the memory overhead caused by the parallel execution of the distributed models. These results are in general aligned with the fact that multiclass classification problems are harder to solve than their binary decompositions, and hence a larger MLP topology may be needed for the multiclass classifiers, at the expense of higher CPU and RAM requirements [33][34][35].…”
Section: Comparing the Centralized And Distributed Modelssupporting
confidence: 55%
“…Such a study, however, constitutes an interesting future direction for providing comparative results of the possible ML methods that can be applied. Note that in general, despite the ML method applied, multiclass classification problems (centralized framework) are harder to solve than their binary decompositions [33][34][35] (distributed framework). Hence, even though different ML methods are expected to perform differently regarding their achievable accuracy and RAM and CPU requirements, the centralized approach will still be harder to solve (with higher CPU and RAM requirements) than its distributed decompositions.…”
Section: Ml-based Qot Estimationmentioning
confidence: 99%
See 1 more Smart Citation
“…Decision Tree is used for classifying the data while Regression Tree is used for predicting continuous variables. The Decision Tree algorithm has the potential of obtaining better result than other machine learning methods on multi-class prediction due to its tree-like model (Silva-Palacios et al, 2017). A decision tree is a tree where each node represents an independent variable, each link (branch) represents a condition/decision (rule) and each leaf represents an outcome(i.e.…”
Section: Decision Treementioning
confidence: 99%
“…Based on these observations, we examined frequently altered genes in large tumor cohorts by systematically interrogating mutation subgroupings associated with improved classification performance. Instead of focusing on a single gene or pathway of interest, we sought to create a framework inspired by class-grouping approaches [28][29][30] which would generalize well to the population of somatic alterations recurrent in cancer. Specifically, we test each gene for the existence of at least one good multinomial classifier by searching over a hierarchy of one-vs-rest binary classifiers.…”
Section: Introductionmentioning
confidence: 99%