Classification via Two-Way Comparisons
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913665481965568 |
|---|---|
| author | Chrobak, Marek Young, Neal E. |
| author_facet | Chrobak, Marek Young, Neal E. |
| contents | Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the class to which $q$ belongs. Such a tree can be much smaller than a lookup table, and much faster and smaller than a conventional search tree. We give the first polynomial-time algorithm for the problem. The algorithm extends naturally to the setting where each query has multiple allowed classes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_09692 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Classification via Two-Way Comparisons Chrobak, Marek Young, Neal E. Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45 E.4; G.1.6; G.2.2; H.3.1; I.4.2 Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the class to which $q$ belongs. Such a tree can be much smaller than a lookup table, and much faster and smaller than a conventional search tree. We give the first polynomial-time algorithm for the problem. The algorithm extends naturally to the setting where each query has multiple allowed classes. |
| title | Classification via Two-Way Comparisons |
| topic | Data Structures and Algorithms 68P10, 68P30, 68W25, 94A45 E.4; G.1.6; G.2.2; H.3.1; I.4.2 |
| url | https://arxiv.org/abs/2302.09692 |