Header

UZH-Logo

Maintenance Infos

Iterations for Propensity Score Matching in MonetDB


Böhlen, Michael Hanspeter; Dolmatova, Oksana; Krauthammer, Michael; Mariyagnanaseelan, Alphonse; Stahl, Jonathan; Surbeck, Timo (2020). Iterations for Propensity Score Matching in MonetDB. In: 24thvEuropean Conference on Advances in Databases and Information Systems, ADBIS 2020, Lyon, 25 August 2020 - 27 August 2020. Springer, 189-203.

Abstract

The amount of data that is stored in databases and must be analyzed is growing fast. Many analytical tasks are based on iterative methods that approximate optimal solutions. Propensity score matching is a technique that is used to reduce bias during cohort building. The main step is the propensity score computation, which is usually implemented via iterative methods such as gradient descent. Our goal is to support efficient and scalable propensity score computation over relations in a column-oriented database. To achieve this goal, we introduce shape-preserving iterations that update values in existing tuples until a fix point is reached. Shape-preserving iterations enable gradient descent over relations and, thus, propensity score matching. We also show how to create appropriate input relations for shape-preserving iterations with randomly initialized relations. The empirical evaluation compares in-database iterations with the native implementation in MonetDB where iterations are flattened.

Abstract

The amount of data that is stored in databases and must be analyzed is growing fast. Many analytical tasks are based on iterative methods that approximate optimal solutions. Propensity score matching is a technique that is used to reduce bias during cohort building. The main step is the propensity score computation, which is usually implemented via iterative methods such as gradient descent. Our goal is to support efficient and scalable propensity score computation over relations in a column-oriented database. To achieve this goal, we introduce shape-preserving iterations that update values in existing tuples until a fix point is reached. Shape-preserving iterations enable gradient descent over relations and, thus, propensity score matching. We also show how to create appropriate input relations for shape-preserving iterations with randomly initialized relations. The empirical evaluation compares in-database iterations with the native implementation in MonetDB where iterations are flattened.

Statistics

Citations

Dimensions.ai Metrics

Altmetrics

Downloads

22 downloads since deposited on 01 Mar 2021
22 downloads since 12 months
Detailed statistics

Additional indexing

Item Type:Conference or Workshop Item (Lecture), refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Informatics
Dewey Decimal Classification:000 Computer science, knowledge & systems
Scopus Subject Areas:Physical Sciences > Theoretical Computer Science
Physical Sciences > General Computer Science
Language:English
Event End Date:27 August 2020
Deposited On:01 Mar 2021 08:46
Last Modified:02 Mar 2021 21:00
Publisher:Springer
OA Status:Green
Publisher DOI:https://doi.org/10.1007/978-3-030-54832-2_15
Other Identification Number:merlin-id:20730

Download

Green Open Access

Download PDF  'Iterations for Propensity Score Matching in MonetDB'.
Preview
Content: Published Version
Filetype: PDF
Size: 129kB
View at publisher