Zobrazeno 1 - 10
of 8 554
pro vyhledávání: '"Koenen, A."'
Visualization, from simple line plots to complex high-dimensional visual analysis systems, has established itself throughout numerous domains to explore, analyze, and evaluate data. Applying such visualizations in the context of simulation science wh
Externí odkaz:
http://arxiv.org/abs/2408.03188
We present an Alternating Direction Method of Multipliers (ADMM) algorithm designed to solve the Weighted Generalized Fused LASSO Signal Approximator (wFLSA). First, we show that wFLSAs can always be reformulated as a Generalized LASSO problem. With
Externí odkaz:
http://arxiv.org/abs/2407.18077
Since its introduction in 1957, Lloyd's algorithm for $k$-means clustering has been extensively studied and has undergone several improvements. While in its original form it does not guarantee any approximation factor at all, Arthur and Vassilvitskii
Externí odkaz:
http://arxiv.org/abs/2406.02739
Category fluency is a widely studied cognitive phenomenon, yet two conflicting accounts have been proposed as the underlying retrieval mechanism -- an optimal foraging process deliberately searching through memory (Hills et al., 2012) and a random wa
Externí odkaz:
http://arxiv.org/abs/2405.06714
Autor:
Koenen, Niklas, Wright, Marvin N.
In recent years, neural networks have demonstrated their remarkable ability to discern intricate patterns and relationships from raw data. However, understanding the inner workings of these black box models remains challenging, yet crucial for high-s
Externí odkaz:
http://arxiv.org/abs/2404.11330
Autor:
Könen, David, Stiglmayr, Michael
This paper addresses the output-sensitive complexity for linear multi-objective integer minimum cost flow (MOIMCF) problems and provides insights about the time complexity for enumerating all supported nondominated vectors. The paper shows that there
Externí odkaz:
http://arxiv.org/abs/2312.01786
We consider the following natural problem that generalizes min-sum-radii clustering: Given is $k\in\mathbb{N}$ as well as some metric space $(V,d)$ where $V=F\cup C$ for facilities $F$ and clients $C$. The goal is to find a clustering given by $k$ fa
Externí odkaz:
http://arxiv.org/abs/2310.02130
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-9 (2024)
Abstract Following implementation of a national prevention program against iodine deficiency-related disorders in 1993 in Germany, the prevalence of thyroid disorders declined, but aggregated drug dispensation data suggested a recent increase in thyr
Externí odkaz:
https://doaj.org/article/0f7fccc32d5941bab18b5ff1db74334d
Autor:
Koenen, Niklas, Wright, Marvin N.
The R package innsight offers a general toolbox for revealing variable-wise interpretations of deep neural networks' predictions with so-called feature attribution methods. Aside from the unified and user-friendly framework, the package stands out in
Externí odkaz:
http://arxiv.org/abs/2306.10822
Autor:
Könen, David, Stiglmayr, Michael
This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). First, we highlight an inconsistency in various definitions of supported nondominated vectors f
Externí odkaz:
http://arxiv.org/abs/2305.12867