Next Article in Journal
Special Issue “2021 Selected Papers from Algorithms’ Editorial Board Members”
Previous Article in Journal
A Meeting Point of Probability, Graphs, and Algorithms: The Lovász Local Lemma and Related Results—A Survey
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimized Weighted Nearest Neighbours Matching Algorithm for Control Group Selection

by
Szabolcs Szekér
and
Ágnes Vathy-Fogarassy
*,†
Department of Computer Science and Systems Technology, Faculty of Information Technology, University of Pannonia, 8200 Veszprém, Hungary
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Algorithms 2021, 14(12), 356; https://doi.org/10.3390/a14120356
Submission received: 31 October 2021 / Revised: 26 November 2021 / Accepted: 3 December 2021 / Published: 8 December 2021
(This article belongs to the Section Algorithms for Multidisciplinary Applications)

Abstract

An essential criterion for the proper implementation of case-control studies is selecting appropriate case and control groups. In this article, a new simulated annealing-based control group selection method is proposed, which solves the problem of selecting individuals in the control group as a distance optimization task. The proposed algorithm pairs the individuals in the n-dimensional feature space by minimizing the weighted distances between them. The weights of the dimensions are based on the odds ratios calculated from the logistic regression model fitted on the variables describing the probability of membership of the treated group. For finding the optimal pairing of the individuals, simulated annealing is utilized. The effectiveness of the newly proposed Weighted Nearest Neighbours Control Group Selection with Simulated Annealing (WNNSA) algorithm is presented by two Monte Carlo studies. Results show that the WNNSA method can outperform the widely applied greedy propensity score matching method in feature spaces where only a few covariates characterize individuals and the covariates can only take a few values.
Keywords: control group selection; weighted k-nearest neighbour; simulated annealing; logistic regression; negative covariates control group selection; weighted k-nearest neighbour; simulated annealing; logistic regression; negative covariates
Graphical Abstract

Share and Cite

MDPI and ACS Style

Szekér, S.; Vathy-Fogarassy, Á. Optimized Weighted Nearest Neighbours Matching Algorithm for Control Group Selection. Algorithms 2021, 14, 356. https://doi.org/10.3390/a14120356

AMA Style

Szekér S, Vathy-Fogarassy Á. Optimized Weighted Nearest Neighbours Matching Algorithm for Control Group Selection. Algorithms. 2021; 14(12):356. https://doi.org/10.3390/a14120356

Chicago/Turabian Style

Szekér, Szabolcs, and Ágnes Vathy-Fogarassy. 2021. "Optimized Weighted Nearest Neighbours Matching Algorithm for Control Group Selection" Algorithms 14, no. 12: 356. https://doi.org/10.3390/a14120356

APA Style

Szekér, S., & Vathy-Fogarassy, Á. (2021). Optimized Weighted Nearest Neighbours Matching Algorithm for Control Group Selection. Algorithms, 14(12), 356. https://doi.org/10.3390/a14120356

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop