A Directed Acyclic Graph (DAG) Ensemble Classification Model
| Autor: | Keith Dures, Esra’a Alshdaifat, Frans Coenen |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
Computer science business.industry 020206 networking & telecommunications 02 engineering and technology Directed acyclic graph Machine learning computer.software_genre Hardware and Architecture 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Artificial intelligence Architecture business computer Software MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | INTERNATIONAL JOURNAL OF DATA WAREHOUSING AND MINING |
| ISSN: | 1548-3932 1548-3924 |
| DOI: | 10.4018/ijdwm.2017070104 |
| Popis: | In this paper, a hierarchical ensemble classification approach that utilizes a Directed Acyclic Graph (DAG) structure is proposed as a solution to the multi-class classification problem. Two main DAG structures are considered: (i) rooted DAG, and (ii) non-rooted DAG. The main challenges that are considered in this paper are: (i) the successive misclassification issue associated with hierarchical classification, and (i) identification of the starting node within the non-rooted DAG approach. To address these issues the idea is to utilize Bayesian probability values to: select the best starting DAG node, and to dictate whether single or multiple paths should be followed within the DAG structure. The reported experimental results indicated that the proposed DAG structure is more effective than when using a simple binary tree structure for generating a hierarchical classification model. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|