Work

Classification via Two-Way Comparisons

Year: 2024

Type: article

Abstract: 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 tests to determine \(q\) 's class. Such a tree can be faster and smaller than a conventional search tree and smaller than a lookup table (both of which must identify \(q\) , not just its class). We give the first polynomial-time algorithm for the problem. The algorithm extends naturally to the setting where each query has multiple allowed classes.

Source: ACM Transactions on Algorithms

DOI: 10.1145/3709361

Authors: Marek Chrobak, Neal E. Young

Institution: University of California, Riverside

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: National Science Foundation, Division of Computing and Communication Foundations

Awards: AF:Small: Distributed Protocols for Information Dissemination in Ad-Hoc Radio Networks, G6948832959