Abstract
DRSs (Decision Rule Systems) and DTs (Decision Trees) are well known as classification tools, knowledge representation methods, and algorithms. Their clarity and ease of interpretation in data analysis are widely recognized. The study of the relationship between DTs and DRSs is an important problem in computer science. There are established methods for converting DTs to DRSs. In this work, we explore the inverse transformation problem, which is challenging. Rather than constructing a full DT that answers the tasks on DRSs, our research provides a greedy algorithm that simulates the functioning of a DT for an input array of feature values.
| Original language | English (US) |
|---|---|
| Title of host publication | Rough Sets - International Joint Conference, IJCRS 2024, Proceedings |
| Editors | Mengjun Hu, Pawan Lingras, Chris Cornelis, Yan Zhang, Dominik Ślęzak, JingTao Yao |
| Publisher | Springer Science and Business Media Deutschland GmbH |
| Pages | 188-200 |
| Number of pages | 13 |
| ISBN (Print) | 9783031656644 |
| DOIs | |
| State | Published - 2024 |
| Event | International Joint Conference on Rough Sets, IJCRS 2024 - Halifax, Canada Duration: May 17 2024 → May 20 2024 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 14839 LNAI |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | International Joint Conference on Rough Sets, IJCRS 2024 |
|---|---|
| Country/Territory | Canada |
| City | Halifax |
| Period | 05/17/24 → 05/20/24 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
Keywords
- Decision rule systems
- Decision trees
- Greedy algorithm
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science