arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.07103cs.LGcs.CCcs.DS
收藏

简洁超球面分类的计算复杂度

The Computational Complexity of Concise Hypersphere Classification

Royal Holloway, University of London(伦敦大学皇家霍洛威学院);TU Wien(维也纳技术大学);DePaul University(德保罗大学);University of Leeds(利兹大学)

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

AI总结:

针对二值数据超球面分类难获简洁解释的问题,首次从参数化复杂度角度研究,给出更强下界与新固定参数算法,可找到存在的精确简洁解释。

摘要:

超球面分类是一种经典的基础方法,能够为实值数据和二值数据的分类提供易于处理的解释。然而,在处理二值数据时,通过超球面分类获得(理想情况下简洁的)解释要比处理实值数据困难得多。本文首次对二值数据的超球面分类问题展开复杂度理论层面的研究。我们采用细粒度参数化复杂度范式,分析输入数据中可能存在的结构特性以及潜在的简洁性约束所产生的影响。我们的研究成果包括更强的下界,以及针对二值数据超球面分类的全新固定参数算法,当存在精确且简洁的解释时,该算法能够将其找到。

英文摘要:

Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanation via hypersphere classification is much more difficult when dealing with binary data than real-valued data. In this paper, we perform the first complexity-theoretic study of the hypersphere classification problem for binary data. We use the fine-grained parameterized complexity paradigm to analyze the impact of structural properties that may be present in the input data as well as potential conciseness constraints. Our results include stronger lower bounds and new fixed-parameter algorithms for hypersphere classification of binary data, which can find an exact and concise explanation when one exists.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑