STATISTICAL PROPERTIES OF THE FILE-MERGING METHODOLOGY
Abstract
Matching is defined as the methodology of merging micro-data files to create larger files of data. Matching is often done to extract statistical information which cannot be obtained from the individual files that are incomplete. Current Federal statistical practice involving multivariate file-merging techniques is typically not based on a formal statistical theory. In view of this situation, a survey on matching is given. All known models for matching are presented under a unified framework, which consists of three situations involving the same or similar individuals. The properties of a maximum likelihood strategy to match files of data involving the same individuals are derived via ranks and order-statistics from bivariate populations. In addition, the properties of this strategy have been examined with respect to a more reasonable criterion called epsilon-correct matching. Asymptotic results for such situations, including (i) the Poisson approximation for the distribution of the number of correct matches, and (ii) convergence in probability of the average number of epsilon-correct matches have been derived. Small-sample properties, like the monotone behavior of the expected number of matches with respect to the dependence parameters of the underlying models have been proved. Two matching strategies due to Kadane (1978) and one strategy due to Sims (1978) for merging files of data on similar individuals are discussed. These strategies are evaluated based on a Monte-Carlo study of matching models involving trivariate normal distributions.
Degree
Ph.D.
Subject Area
Statistics
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.