58 citations · 327 across the 60 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2023
The Computational Complexity of Concise Hypersphere Classification
Eduard Eiben, Robert Ganian, Iyad Kanj +2
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, obta…
cs.LG2012★ 8 cited
Algorithms and Complexity Results for Exact Bayesian Structure Learning
Sebastian Ordyniak, Stefan Szeider
Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computationa…