Research on decision tree approximation withdrawn after submission

A recently withdrawn arXiv paper proposed a polynomial-time algorithm for approximating the uniform decision tree problem. The algorithm achieved an approximation ratio of less than 11.57, improving upon previous greedy methods. Its approach involved decomposing the optimal decision tree using techniques from hierarchical clustering and reducing subproblems to the Maximum Coverage problem. AI

影响 This research, though withdrawn, explored algorithmic improvements relevant to decision-making processes in AI.

排序理由 The cluster contains a withdrawn academic paper detailing a new algorithmic approach.

在 arXiv cs.LG 阅读 →

• arXiv
• Decision Tree
• Hierarchical Clustering
• Maximum Coverage
• Michał Szyfelbein

• 论文
• 其他

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →