Zobrazeno 1 - 10
of 55
pro vyhledávání: '"D'Onofrio, Federico"'
In this paper, we study the embedded feature selection problem in linear Support Vector Machines (SVMs), in which a cardinality constraint is employed, leading to a fully explainable selection model. The problem is NP-hard due to the presence of the
Externí odkaz:
http://arxiv.org/abs/2404.10099
We study incremental knapsack problems with profits given by a special class of monotone submodular functions, that we dub all-or-nothing. We show that these problems are not harder to approximate than a less general class of modular incremental knap
Externí odkaz:
http://arxiv.org/abs/2304.12967
In recent years, there has been growing attention to interpretable machine learning models which can give explanatory insights on their behaviour. Thanks to their interpretability, decision trees have been intensively studied for classification tasks
Externí odkaz:
http://arxiv.org/abs/2210.10567
Publikováno v:
In Computers and Operations Research January 2024 161
Autor:
D’Onofrio, Federico, Serra, Gerardo
Publikováno v:
Research in the History of Economic Thought and Methodology: Including a Symposium on Economists and Authoritarian Regimes in the 20th Century
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
D'Onofrio, Federico1 (AUTHOR) federico.donofrio@univie.ac.at, Tyler, Hannah2 (AUTHOR) hannah.tyler@unil.ch
Publikováno v:
History of Political Economy. Jun2022, Vol. 54 Issue 3, p459-481. 23p. 1 Chart.
Autor:
D'Onofrio, Federico
Publikováno v:
The Agricultural History Review, 2017 Jan 01. 65(2), 277-296.
Externí odkaz:
https://www.jstor.org/stable/26447843