VLDB 2026 Research / reviewers in the wild / expert
Jonathan Gillard 0002
dblp:233/9744 · also Jonathan W. Gillard
· DBLP profile ↗
5ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0001-9166-298XORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Theory of computation · 2 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | A novel initialisation based on hospital-resident assignment for the k-modes algorithmabstractAbstract This paper presents a new way of selecting an initialisation for the $$k$$ k -modes algorithm that allows for a notion of game theoretic fairness that classic initialisations, namely those by Huang and Cao, do not. Our new method utilises the hospital-resident assignment problem to find the set of initial cluster centroids which we compare with two classical initialisation methods for $$k$$ k -modes: the original presented by Huang and the next most popular method of Cao and co-authors. To highlight the merits of our proposed method, two stages of analysis are presented. It is demonstrated that the proposed method is often able to offer computational speed-up of the order of $$50\%$$ 50 % . Improved clustering, in terms of a commonly used cost-function, was witnessed in several cases and can be of the order of $$10\%$$ 10 % , particularly for more complex datasets. Jonathan Gillard 0002, Vincent A. Knight, Henry Wilde |
Soft Comput. | 1 |
| 2021 | Multistart with early termination of descents
Antanas Zilinskas, Jonathan Gillard 0002, Megan Scammell, Anatoly A. Zhigljavsky |
J. Glob. Optim. | 2 |
| 2020 | Evolutionary dataset optimisation: learning algorithm quality through evolutionabstractAbstract In this paper we propose a novel method for learning how algorithms perform. Classically, algorithms are compared on a finite number of existing (or newly simulated) benchmark datasets based on some fixed metrics. The algorithm(s) with the smallest value of this metric are chosen to be the ‘best performing’. We offer a new approach to flip this paradigm. We instead aim to gain a richer picture of the performance of an algorithm by generating artificial data through genetic evolution, the purpose of which is to create populations of datasets for which a particular algorithm performs well on a given metric. These datasets can be studied so as to learn what attributes lead to a particular progression of a given algorithm. Following a detailed description of the algorithm as well as a brief description of an open source implementation, a case study in clustering is presented. This case study demonstrates the performance and nuances of the method which we call Evolutionary Dataset Optimisation. In this study, a number of known properties about preferable datasets for the clustering algorithms known ask-means and DBSCAN are realised in the generated datasets. Henry Wilde, Vincent A. Knight, Jonathan Gillard 0002 |
Appl. Intell. | 3 |
| 2013 | Emergency Medical Services Modelling
Paul R. Harper, Jonathan Gillard 0002, Vincent A. Knight, Leanne Smith, Julie Leanne Vile, Janet E. Williams |
SIMULTECH | 2 |
| 2013 | Optimization challenges in the structured low rank approximation problem
Jonathan Gillard 0002, Anatoly A. Zhigljavsky |
J. Glob. Optim. | 1 |