Work with interactive mapping tools from across the Census Bureau.
Collection of audio features and sound bites.
The Census Bureau packages data and information into easy-to-understand visuals.
Browse Census Bureau images.
Read briefs and reports from Census Bureau experts.
Watch Census Bureau vignettes, testimonials, and video files.
Read research analyses from Census Bureau experts.
Developer portal to access services and documentation for the Census Bureau's APIs.
Explore Census Bureau data on your mobile device with interactive tools.
Find a multitude of DVDs, CDs and publications in print by topic.
These external sites provide more data.
Download extraction tools to help you get the in-depth data you need.
Explore Census data with interactive visualizations covering a broad range of topics.
How we provide the best mix of timeliness, relevancy, quality, and cost for the data we collect.
Learn about other opportunities to collaborate with us.
Explore the rich historical background of an organization with roots almost as old as the nation.
Explore prospective positions available at the Census Bureau.
Explore Census programs targeted for particular needs.
Discover the latest in Census Bureau data releases, reports, and events.
The Census Bureau's Director writes on how we measure America's people, places and economy.
Find interesting and quirky statistics regarding national celebrations and major events.
Listen to audio files on fun facts, historical figures, and celebrations of the month.
Find media toolkits, advisories, and all the latest Census news.
See what's coming up in releases and reports.
Record linkage, or computer matching, is needed for the creation and maintenance of name and
address lists that support operations for and evaluations of a Year 2000 Census. This paper describes
three advances. The first is an enhanced method of string comparison for dealing with typographical
variations and scanning errors. It improves upon string comparators in computer science. The second
is a linear assignment algorithm that can use only 0.002 as much storage as existing algorithms in
operations research, requires at most an additional 0.03 increase in time, and has less of a tendency
to make erroneous matching assignments than existing sparse-array algorithms because of how it
deals with most arcs. The third is an expectation-maximization algorithm for estimating parameters in
latent class, loglinear models of the type arising in record linkage. The associated theory and software
are the only known means of dealing with general interaction patterns and allow weak use of a priori
information via a generalization to the MCECM algorithm of Meng and Rubin. Models assuming that
interactions are conditionally independent given the class are typically considered in biostatistics and