NexTech 2021 Congress
October 03, 2021 to October 07, 2021 - Barcelona, Spain

  • UBICOMM 2021, The Fifteenth International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies
  • ADVCOMP 2021, The Fifteenth International Conference on Advanced Engineering Computing and Applications in Sciences
  • SEMAPRO 2021, The Fifteenth International Conference on Advances in Semantic Processing
  • AMBIENT 2021, The Eleventh International Conference on Ambient Computing, Applications, Services and Technologies
  • EMERGING 2021, The Thirteenth International Conference on Emerging Networks and Systems Intelligence
  • DATA ANALYTICS 2021, The Tenth International Conference on Data Analytics
  • GLOBAL HEALTH 2021, The Tenth International Conference on Global Health Challenges
  • CYBER 2021, The Sixth International Conference on Cyber-Technologies and Cyber-Systems

SoftNet 2021 Congress
October 03, 2021 to October 07, 2021 - Barcelona, Spain

  • ICSEA 2021, The Sixteenth International Conference on Software Engineering Advances
  • ICSNC 2021, The Sixteenth International Conference on Systems and Networks Communications
  • CENTRIC 2021, The Fourteenth International Conference on Advances in Human-oriented and Personalized Mechanisms, Technologies, and Services
  • VALID 2021, The Thirteenth International Conference on Advances in System Testing and Validation Lifecycle
  • SIMUL 2021, The Thirteenth International Conference on Advances in System Simulation
  • SOTICS 2021, The Eleventh International Conference on Social Media Technologies, Communication, and Informatics
  • INNOV 2021, The Tenth International Conference on Communications, Computation, Networks and Technologies
  • HEALTHINFO 2021, The Sixth International Conference on Informatics and Assistive Technologies for Health-Care, Medical Support and Wellbeing

NetWare 2021 Congress
November 14, 2021 to November 18, 2021 - Athens, Greece

  • SENSORCOMM 2021, The Fifteenth International Conference on Sensor Technologies and Applications
  • SENSORDEVICES 2021, The Twelfth International Conference on Sensor Device Technologies and Applications
  • SECURWARE 2021, The Fifteenth International Conference on Emerging Security Information, Systems and Technologies
  • AFIN 2021, The Thirteenth International Conference on Advances in Future Internet
  • CENICS 2021, The Fourteenth International Conference on Advances in Circuits, Electronics and Micro-electronics
  • ICQNM 2021, The Fifteenth International Conference on Quantum, Nano/Bio, and Micro Technologies
  • FASSI 2021, The Seventh International Conference on Fundamentals and Advances in Software Systems Integration
  • GREEN 2021, The Sixth International Conference on Green Communications, Computing and Technologies

TrendNews 2021 Congress
November 14, 2021 to November 18, 2021 - Athens, Greece

  • CORETA 2021, Advances on Core Technologies and Applications
  • DIGITAL 2021, Advances on Societal Digital Transformation

 


ThinkMind // International Journal On Advances in Software, volume 12, numbers 3 and 4, 2019 // View article soft_v12_n34_2019_6


Faster in Time and Better in Randomness Algorithms for Matching Subjects with Multiple Controls

Authors:
Hung-Jui Chang
Yu-Hsuan Hsu
Chih-Wen Hsueh
Mei-Lien Pan
Hsiao-Mei Tsao
Da-Wei Wang
Tsan-sheng Hsu

Keywords: matching; observational study; relative entropy.

Abstract:
In the era of learning healthcare systems and big data, observational studies play a vital role in discovering hidden (causal) associations within a dataset. To reduce bias in these observational studies, a matching step usually is adopted to randomly match each case subject with one or more control candidates. A high-quality matching algorithm, RandFlow, is proposed and compared with the commonly used – Simple Match, Matchit and Optmatch algorithms. The execution time, the memory usage, the successful matching rate, the statistical variation of relative risk, and the randomness computed employing the different algorithms are compared. The execution time of RandFlow was at least 30 times faster than commonly used methods, with at least a 66% reduction in memory usage. The variation of relative risk computed by RandFlow usually was smaller than by Simple Match. Simple Match had varying relative entropy, ranging from 0.2 to 0.95, while RandFlow almost uniformly had relative entropy close to 1. RanfFlow could find a matching so long as the maximum matching ratio was not reached. For obtaining more reliable study results, a two-phase matching is proposed. The first phase is to identify the maximum matching ratio, then is followed by matching multiple times and taking an average.

Pages: 249 to 258

Copyright: Copyright (c) to authors, 2019. Used with permission.

Publication date: December 30, 2019

Published in: journal

ISSN: 1942-2628

SERVICES CONTACT
2010 - 2017 © ThinkMind. All rights reserved.
Read Terms of Service and Privacy Policy.