Pith. Sign in

RECORD

Deep Learning to Jointly Schema Match, Impute, and Transform Databases

Databases · Submitted 22 Jun 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In synthetic and real-world experiments using two electronic health record databases, our algorithms outperform existing baselines for matching variable sets, while jointly learning to impute unshared or transformed variables.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2207.03536 (version 1)
Pith IDV7LRRWH4, Pith's permanent record of this paper and its review
CitationBradley A. Fritz, Christopher R. King, Michael S. Avidan, Mohamed Abdelhack, Sandhya Tripathi, Yixin Chen. "Deep Learning to Jointly Schema Match, Impute, and Transform Databases." arXiv:2207.03536 (2022). https://pith.science/paper/V7LRRWH4
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,748 input tokens.

What the abstract itself states, as probabilities: claims first 0.12 · states limitation 0.16 · human participants 0.57 · controlled comparison 0.80 · randomized assignment 0.01 · states quantitative result 0.06 · compares with prior results 0.97 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

An applied problem facing all areas of data science is harmonizing data sources. Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing and testing robust, generalizable algorithms, especially in health care. We approach this issue in the common but difficult case of numeric features such as nearly Gaussian and binary features, where unit changes and variable shift make simple matching of univariate summaries unsuccessful. We develop two novel procedures to address this problem. First, we demonstrate multiple methods of "fingerprinting" a feature based on its associations to other features. In the setting of even modest prior information, this allows most shared features to be accurately identified. Second, we demonstrate a deep learning algorithm for translation between databases. Unlike prior approaches, our algorithm takes advantage of discovered mappings while identifying surrogates for unshared features and learning transformations. In synthetic and real-world experiments using two electronic health record databases, our algorithms outperform existing baselines for matching variable sets, while jointly learning to impute unshared or transformed variables.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 An applied problem facing all areas of data science is harmonizing data sources. background 1.00 0.04 0.02 asserted 1.00
s1 Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing and testing robust, generalizable algorithms, especially in health care. background 1.00 0.05 0.03 asserted 1.00
s2 We approach this issue in the common but difficult case of numeric features such as nearly Gaussian and binary features, where unit changes and variable shift make simple matching of univariate summaries unsuccessful. background 0.86 0.12 0.02 asserted 1.00
s3 We develop two novel procedures to address this problem. contribution 0.99 0.87 0.04 asserted 0.98
s4 First, we demonstrate multiple methods of "fingerprinting" a feature based on its associations to other features. method 0.74 0.93 0.03 asserted 1.00
s5 In the setting of even modest prior information, this allows most shared features to be accurately identified. result 0.97 0.88 0.08 asserted 0.94
s6 Second, we demonstrate a deep learning algorithm for translation between databases. method 0.52 0.93 0.04 asserted 1.00
s7 Unlike prior approaches, our algorithm takes advantage of discovered mappings while identifying surrogates for unshared features and learning transformations. method 0.66 0.85 0.09 asserted 1.00
s8 In synthetic and real-world experiments using two electronic health record databases, our algorithms outperform existing baselines for matching variable sets, while jointly learning to impute unshared or transformed variables. result 1.00 0.97 0.86 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.69.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

An applied problem facing all areas of data science is harmonizing data sources. Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing and testing robust, generalizable algorithms, especially in health care. We approach this issue in the common but difficult case of numeric features such as nearly Gaussian and binary features, where unit changes and variable shift make simple matching of univariate summaries unsuccessful. We develop two novel procedures to address this problem. First, we demonstrate multiple methods of "fingerprinting" a feature based on its associations to other features. In the setting of even modest prior information, this allows most shared features to be accurately identified. Second, we demonstrate a deep learning algorithm for translation between databases. Unlike prior approaches, our algorithm takes advantage of discovered mappings while identifying surrogates for unshared features and learning transformations. In synthetic and real-world experiments using two electronic health record databases, our algorithms outperform existing baselines for matching variable sets, while jointly learning to impute unshared or transformed variables.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 2 sentences without a confident label

Cites as background 1 paper
  • For quantitative data, simple characteristics such as the mean, variance, mode, and fraction missing are commonly used [ref] .

    Schema Matching using Machine Learning · Related work · 0.83

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.