Zobrazeno 1 - 10
of 342
pro vyhledávání: '"SOMMER, FRANK"'
Decision trees are a classic model for summarizing and classifying data. To enhance interpretability and generalization properties, it has been proposed to favor small decision trees. Accordingly, in the minimum-size decision tree training problem (M
Externí odkaz:
http://arxiv.org/abs/2412.11954
Network sparsification is the task of reducing the number of edges of a given graph while preserving some crucial graph property. In community-aware network sparsification, the preserved property concerns the subgraphs that are induced by the communi
Externí odkaz:
http://arxiv.org/abs/2402.15494
We show that the simplest local search heuristics for two natural Euclidean clustering problems are PLS-complete. First, we show that the Hartigan--Wong method for $k$-Means clustering is PLS-complete, even when $k = 2$. Second, we show the same resu
Externí odkaz:
http://arxiv.org/abs/2312.14916
We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we assume that failures only affect unsafe edges. In Unweighted Flexible Gra
Externí odkaz:
http://arxiv.org/abs/2308.04575
Random forests and, more generally, (decision\nobreakdash-)tree ensembles are widely used methods for classification and regression. Recent algorithmic advances allow to compute decision trees that are optimal for various measures such as their size
Externí odkaz:
http://arxiv.org/abs/2306.04423
In the Vertex Triangle 2-Club problem, we are given an undirected graph $G$ and aim to find a maximum-vertex subgraph of $G$ that has diameter at most 2 and in which every vertex is contained in at least $\ell$ triangles in the subgraph. So far, the
Externí odkaz:
http://arxiv.org/abs/2211.01701