Zobrazeno 1 - 10
of 10 553
pro vyhledávání: '"Staden, A."'
Autor:
van Staden, Stephan
ABCDE is a sophisticated technique for evaluating differences between very large clusterings. Its main metric that characterizes the magnitude of the difference between two clusterings is the JaccardDistance, which is a true distance metric in the sp
Externí odkaz:
http://arxiv.org/abs/2409.18522
Autor:
van Staden, Stephan
A cluster id assignment scheme labels each cluster of a clustering with a distinct id. The goal of id assignment is semantic id stability, which means that, whenever possible, a cluster for the same underlying concept as that of a historical cluster
Externí odkaz:
http://arxiv.org/abs/2409.18254
Autor:
van Staden, Stephan
ABCDE is a technique for evaluating clusterings of very large populations of items. Given two clusterings, namely a Baseline clustering and an Experiment clustering, ABCDE can characterize their differences with impact and quality metrics, and thus h
Externí odkaz:
http://arxiv.org/abs/2409.13376
Autor:
van Staden, Stephan, Grubb, Alexander
This paper considers the problem of evaluating clusterings of very large populations of items. Given two clusterings, namely a Baseline clustering and an Experiment clustering, the tasks are twofold: 1) characterize their differences, and 2) determin
Externí odkaz:
http://arxiv.org/abs/2407.21430
Autor:
van Staden, Stephan
This paper defines pointwise clustering metrics, a collection of metrics for characterizing the similarity of two clusterings. These metrics have several interesting properties which make them attractive for practical applications. They can take into
Externí odkaz:
http://arxiv.org/abs/2405.10421
Autor:
Cheng, Yangyang, Staden, Katherine
Given graphs $G_1,\ldots,G_s$ all on a common vertex set and a graph $H$ with $e(H) = s$, a copy of $H$ is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G_i$. We establish a stability result for transversal Hamilton cycles:
Externí odkaz:
http://arxiv.org/abs/2403.09913
Let $\mathbf{G}=\{G_1, \ldots, G_m\}$ be a graph collection on a common vertex set $V$ of size $n$ such that $\delta(G_i) \geq (1+o(1))n/2$ for every $i \in [m]$. We show that $\mathbf{G}$ contains every Hamilton cycle pattern. That is, for every map
Externí odkaz:
http://arxiv.org/abs/2310.04138
Autor:
Cheng, Yangyang, Staden, Katherine
Given graphs $G_1,\ldots,G_s$ all on the same vertex set and a graph $H$ with $e(H) \leq s$, a copy of $H$ is transversal or rainbow if it contains at most one edge from each $G_c$. When $s=e(H)$, such a copy contains exactly one edge from each $G_i$
Externí odkaz:
http://arxiv.org/abs/2306.03595
Autor:
Philip Ivey, Gretha van Staden, Graham Harding, Dirk Oosthuizen, Elmarie Hoft, Philip van Staden, Eben Anthonissen, Kim Weaver, Martin Hill, Ross Shackleton
Publikováno v:
South African Journal of Science, Vol 120, Iss 9/10 (2024)
Research that directs the way stakeholders act and how they collaborate is essential when addressing complex environmental challenges in the field of sustainability science. For example, researchers attempting to manage Prosopis invasions through bio
Externí odkaz:
https://doaj.org/article/3884089bea484dc0a7763e7f2117be82
We present a parsimonious neural network approach, which does not rely on dynamic programming techniques, to solve dynamic portfolio optimization problems subject to multiple investment constraints. The number of parameters of the (potentially deep)
Externí odkaz:
http://arxiv.org/abs/2303.08968