What to Do about Missing Values in Time-Series Cross-Section Data

DSpace/Manakin Repository

What to Do about Missing Values in Time-Series Cross-Section Data

Citable link to this page

. . . . . .

Title: What to Do about Missing Values in Time-Series Cross-Section Data
Author: King, Gary; Honaker, James

Note: Order does not necessarily reflect citation order of authors.

Citation: Honaker, James and Gary King. 2010. What to do about missing values in time-series cross-section data. American Journal of Political Science 54(2): 561-581.
Full Text & Related Files:
Abstract: Applications of modern methods for analyzing data with missing values, based primarily on multiple imputation, have in the last half-decade become common in American politics and political behavior. Scholars in this subset of political science have thus increasingly avoided the biases and inefficiencies caused by ad hoc methods like listwise deletion and best guess imputation. However, researchers in much of comparative politics and international relations, and others with similar data, have been unable to do the same because the best available imputation methods work poorly with the time-series cross-section data structures common in these fields. We attempt to rectify this situation with three related developments. First, we build a multiple imputation model that allows smooth time trends, shifts across cross-sectional units, and correlations over time and space, resulting in far more accurate imputations. Second, we enable analysts to incorporate knowledge from area studies experts via priors on individual missing cell values, rather than on difficult-to-interpret model parameters. Third, because these tasks could not be accomplished within existing imputation algorithms, in that they cannot handle as many variables as needed even in the simpler cross-sectional data for which they were designed, we also develop a new algorithm that substantially expands the range of computationally feasible data types and sizes for which multiple imputation can be used. These developments also make it possible to implement the methods introduced here in freely available open source software that is considerably more reliable than existing algorithms.
Published Version: http://dx.doi.org/10.1111/j.1540-5907.2010.00447.x
Other Sources: http://gking.harvard.edu/files/pr.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4100248

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7262]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters