U.S. flag

An official website of the United States government

Skip Header


General Methods and Algorithms for Modeling and Imputing Discrete Data under a Variety of Constraints

Written by:
RRS2008-08

Abstract

Loglinear modeling methods have become quite straightforward to apply to discrete data X. The models for missing data involve minor extensions of hot-deck methods (Little and Rubin 2002). Edits are structural zeros that forbid certain patterns. Winkler (2003) provided the theory for connecting edit with imputation. In this paper, we give methods and algorithms for modeling/edit/imputation under linear and convex constraints. The methods can be used for statistical matching (D’Orazio, Di Zio, and Scanu 2006), edit/imputation in which models are also controlled for external constraints such as in benchmark data, and for creating synthetic data with significantly reduced risk of re-identification (Winkler 2007).

Related Information


Page Last Revised - October 28, 2021
Is this page helpful?
Thumbs Up Image Yes Thumbs Down Image No
NO THANKS
255 characters maximum 255 characters maximum reached
Thank you for your feedback.
Comments or suggestions?

Top

Back to Header