Decision Trees for Entity Identification: Approximation Algorithms and Hardness Results
Summary: Extends entity-identification decision trees beyond binary/uniform inputs to arbitrary attribute alphabets and priors, minimizing expected test cost. Greedy yields O(r_K·log N) (r_K≤log K); Ω(log N) hardness even for K=2 so greedy is binary-optimal up to constants; connects to an Erdős Ramsey conjecture. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,368 | Helping Satisfy Multiple Objectives During a Service Desk Conversation | 2008 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,924 | Improved Approximation Algorithms for Relational Clustering | 2024 | PODS | 4.1945683e-05 |
| 7,605 | The Computation of Optimal Subset Repairs | 2020 | VLDB | 4.697534e-05 |
| 7,501 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7180617e-05 |
| 11,443 | Approximation Algorithms for Large Scale Data Analysis | 2021 | PODS | 4.1945683e-05 |
| 11,595 | Minimization of Classifier Construction Cost for Search Queries | 2020 | SIGMOD | 4.1945683e-05 |
| 6,482 | Approximate Algorithms for k-Anonymity | 2007 | SIGMOD | 5.045711e-05 |
| 11,264 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1945683e-05 |
| 8,851 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4363908e-05 |
| 8,992 | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations | 2022 | PODS | 4.413099e-05 |
| 4,194 | On the Complexity of Approximate Query Optimization | 2002 | PODS | 6.3697822e-05 |