4
High-Performance Computing Techniques for Record Linkage Peter Christen, Tim Churches, Markus Hegland, Kim Lim, Ole M. Nielsen, Stephen Roberts and Justin Zhu Data Mining Group, Australian National University Epidemiology and Surveillance Branch, NSW Department of Health Contact: [email protected] Project web page: http://datamining.anu.edu.au/linkage.html Copyright c 2002 Peter Christen – p.1/14 A Collaborative Research Project ANU Data Mining Group Department of Computer Science Mathematical Sciences Institute Australian Partnership for Advanced Computing (APAC) New South Wales Department of Health Epidemiology and Surveillance Branch Funded by ANU and NSW Department of Health under an ANU Industry Collaboration Scheme (AICS) Copyright c 2002 Peter Christen – p.2/14 Record Linkage / Data Matching The task of linking together information from one or more data sources representing the same entity (patient, customer, provider, business, etc.) If no unique identifier is available, probabilistic linkage techniques have to be applied Applications of record linkage Remove duplicates in a data set (internal linkage) Merge new records into a larger master data set Create patient oriented statistics Compile data for longitudinal studies Clean data sets for data mining projects or mailing lists Copyright c 2002 Peter Christen – p.3/14 Record Linkage Example Three records, which are the same person? 1. Dr Smith, Peter; 42 Miller Street 2602 O’Connor 2. Pete Smith; 42 Miller St 2600 Canberra A.C.T. 3. P. Smithers, 24 Mill Street 2600 Canberra ACT Data cleaning and standardisation is an important first step for successful record linkage Probabilistic linkage is based on matching weights Use available information (names, addresses, dates) (can be missing, wrong, coded differently, outdated, etc.) Compute matching weights based on frequency counts Classify a pair of records as link, possible-link or non-link Copyright c 2002 Peter Christen – p.4/14

High-Performance Computing Techniques for Record Linkageusers.cecs.anu.edu.au/~christen/publications/ahoc2002-slides-4up.pdf · High-Performance Computing Techniques for Record Linkage

  • Upload
    others

  • View
    11

  • Download
    0

Embed Size (px)

Citation preview

Page 1: High-Performance Computing Techniques for Record Linkageusers.cecs.anu.edu.au/~christen/publications/ahoc2002-slides-4up.pdf · High-Performance Computing Techniques for Record Linkage

High-Performance Computing Techniquesfor Record Linkage

Peter Christen, Tim Churches, Markus Hegland, Kim Lim,

Ole M. Nielsen, Stephen Roberts and Justin Zhu

Data Mining Group, Australian National University

Epidemiology and Surveillance Branch, NSW Department of Health

Contact: [email protected]

Project web page: http://datamining.anu.edu.au/linkage.html

Copyright c

2002 Peter Christen – p.1/14

A Collaborative Research Project

ANU Data Mining GroupDepartment of Computer Science

Mathematical Sciences Institute

Australian Partnership for Advanced Computing (APAC)

New South Wales Department of HealthEpidemiology and Surveillance Branch

Funded by ANU and NSW Department of Healthunder an ANU Industry Collaboration Scheme (AICS)

Copyright c

2002 Peter Christen – p.2/14

Record Linkage / Data Matching

The task of linking together information from oneor more data sources representing the same entity(patient, customer, provider, business, etc.)

If no unique identifier is available, probabilisticlinkage techniques have to be applied

Applications of record linkageRemove duplicates in a data set (internal linkage)

Merge new records into a larger master data set

Create patient oriented statistics

Compile data for longitudinal studies

Clean data sets for data mining projects or mailing lists

Copyright c

2002 Peter Christen – p.3/14

Record Linkage Example

Three records, which are the same person?

1. Dr Smith, Peter; 42 Miller Street 2602 O’Connor

2. Pete Smith; 42 Miller St 2600 Canberra A.C.T.

3. P. Smithers, 24 Mill Street 2600 Canberra ACT

Data cleaning and standardisation is an importantfirst step for successful record linkage

Probabilistic linkage is based on matching weightsUse available information (names, addresses, dates)

(can be missing, wrong, coded differently, outdated, etc.)

Compute matching weights based on frequency counts

Classify a pair of records as link, possible-link or non-link

Copyright c

2002 Peter Christen – p.4/14

Page 2: High-Performance Computing Techniques for Record Linkageusers.cecs.anu.edu.au/~christen/publications/ahoc2002-slides-4up.pdf · High-Performance Computing Techniques for Record Linkage

Why this project?

Commercial software for record linkage is oftenexpensive and cumbersome to use

Project aimsAllow linkage of larger data sets (high-performance

and parallel computing techniques)

Reduce the amount of human resources needed

(improve linkage quality by using machine learning

and data mining techniques)

Reduce costs (free open source software)

Facilitate (epidemiological) research with freeand improved tools for record linkage

Copyright c

2002 Peter Christen – p.5/14

Open Source Software Tools

Advantages of open source softwareCan be downloaded for free from the Internet

Program code can be modified and improved

Often a worldwide supportive user community

Examples: Linux, Apache, Samba, MySQL, etc.

Software tools used for this project

Programming language Python www.python.org

(efficient, stable, many external modules, good support,

easy to extend, available for Unix, Windows and Mac)

Parallel extensions and libraries

(MPI, OpenMP, PyPar and PyRO)

Copyright c

2002 Peter Christen – p.6/14

Target Computing Platforms

Workstation or PC clusterCommodity PCs connected via local area network

Widespread availability, no extra costs

Use as virtual parallel computer (over night / weekends)

Multiprocessor (SMP) serversExample: Sun Enterprise, HP Superdome

4 – 30 CPUs, Gigabytes of memory, Terabytes of disk

High-performance super-cluster

Example: APAC National Facility (Compaq Alphaserver)

>100 CPUs, Gigabytes of memory, mass data storage

Copyright c

2002 Peter Christen – p.7/14

Linux Cluster ’Bunyip’ andAPAC National Facility

Copyright c

2002 Peter Christen – p.8/14

Page 3: High-Performance Computing Techniques for Record Linkageusers.cecs.anu.edu.au/~christen/publications/ahoc2002-slides-4up.pdf · High-Performance Computing Techniques for Record Linkage

Project Plan and Status

Project planData standardisation (January - July)

Probabilistic record linkage (August - September)

Parallelisation (October - November)

Data mining and machine learning (December - March)

Prototype software will be available soonData standardisation routines for names and addresses

Lookup-tables (names, titles, localities, countries, etc.)

Various other routines (e.g. name encodings and

approximate string comparisons)

Copyright c

2002 Peter Christen – p.9/14

Data Standardisation Approach

42 Main 3a 2600

26003a

App.Rd.

Miller 3a 29/4/198642 MainPeter Rd. App.

198629 4

AddressName Date

Geocode Locality

Doc 2600A.C.T.Canberra

Canberra A.C.T.

Title Givenname Surname YearMonthDay

PostcodeTerritoryLocalitynameno.Unit

Unittype

42

typeWayfareWayfare

nameno.Wayfare

peter miller

main canberra actapartmentroad

doctor

Two different approachesRules based (traditional) [e.g. AutoStan software]

Probabilistic Hidden Markov Models (HMM) [new]

(standardised training data needed)

Copyright c

2002 Peter Christen – p.10/14

HMM Standardisation

Middlename End

Surname

Start Title

Givenname

15%

85%5%

65%

10%

5%

5%25%

100%

20%

5%

75%

30%

55%

First experiments with Midwifes Data CollectionTen years of data (1990 - 2000), with 962,776 records

(no medical information, names and addresses only)

Average

�� � � � �

accuracy with addresses

(10-fold cross-validation using 900 training records

and 100 test records per fold)

Copyright c

2002 Peter Christen – p.11/14

Parallelisation Approach

Standardising

Linking

Standardising

Sequential Parallel

Linking Linking

Merging

Each record can be standardised independently

Linkage is done using blocking(each block can be processed independently)

Copyright c

2002 Peter Christen – p.12/14

Page 4: High-Performance Computing Techniques for Record Linkageusers.cecs.anu.edu.au/~christen/publications/ahoc2002-slides-4up.pdf · High-Performance Computing Techniques for Record Linkage

Data Mining Approach

Data mining and machine learning techniquesto learn data characteristics

Clustering (as alternative for blocking)

Predictive modelling

Decision trees and rules (for matches / non-matches)

Training data needed to build model(example pairs of known matches and non-matches)

ANU Data Mining group has several years ofexperience in predictive modelling, handling of

health data sets, data processing, etc.

Copyright c

2002 Peter Christen – p.13/14

Outlook

A new approach to probabilistic record linkageHigh-performance and parallel computing techniques

Data mining and machine learning techniques

Free open source software

Future extension of this project likelyARC Linkage grant for 2003

Further collaborations are welcome

Free prototype software available online soon:

http://datamining.anu.edu.au/linkage.html

Copyright c

2002 Peter Christen – p.14/14