"Efficient Sequential And Parallel Algorithms For Record Linkage." - Information and Links:

Efficient Sequential And Parallel Algorithms For Record Linkage. - Info and Reading Options

"Efficient Sequential And Parallel Algorithms For Record Linkage." and the language of the book is English.


“Efficient Sequential And Parallel Algorithms For Record Linkage.” Metadata:

  • Title: ➤  Efficient Sequential And Parallel Algorithms For Record Linkage.
  • Authors:
  • Language: English

Edition Identifiers:

  • Internet Archive ID: pubmed-PMC3932463

AI-generated Review of “Efficient Sequential And Parallel Algorithms For Record Linkage.”:


"Efficient Sequential And Parallel Algorithms For Record Linkage." Description:

The Internet Archive:

This article is from <a href="//archive.org/search.php?query=journaltitle%3A%28Journal%20of%20the%20American%20Medical%20Informatics%20Association%20:%20JAMIA%29" rel="ugc nofollow">Journal of the American Medical Informatics Association : JAMIA</a>, <a href="//archive.org/search.php?query=journaltitle%3A%28Journal%20of%20the%20American%20Medical%20Informatics%20Association%20:%20JAMIA%29%20AND%20volume%3A%2821%29" rel="ugc nofollow">volume 21</a>.<h2>Abstract</h2>Background and objective: Integrating data from multiple sources is a crucial and challenging problem. Even though there exist numerous algorithms for record linkage or deduplication, they suffer from either large time needs or restrictions on the number of datasets that they can integrate. In this paper we report efficient sequential and parallel algorithms for record linkage which handle any number of datasets and outperform previous algorithms. Methods: Our algorithms employ hierarchical clustering algorithms as the basis. A key idea that we use is radix sorting on certain attributes to eliminate identical records before any further processing. Another novel idea is to form a graph that links similar records and find the connected components. Results: Our sequential and parallel algorithms have been tested on a real dataset of 1 083 878 records and synthetic datasets ranging in size from 50 000 to 9 000 000 records. Our sequential algorithm runs at least two times faster, for any dataset, than the previous best-known algorithm, the two-phase algorithm using faster computation of the edit distance (TPA (FCED)). The speedups obtained by our parallel algorithm are almost linear. For example, we get a speedup of 7.5 with 8 cores (residing in a single node), 14.1 with 16 cores (residing in two nodes), and 26.4 with 32 cores (residing in four nodes). Conclusions: We have compared the performance of our sequential algorithm with TPA (FCED) and found that our algorithm outperforms the previous one. The accuracy is the same as that of this previous best-known algorithm.

Read “Efficient Sequential And Parallel Algorithms For Record Linkage.”:

Read “Efficient Sequential And Parallel Algorithms For Record Linkage.” by choosing from the options below.

Available Downloads for “Efficient Sequential And Parallel Algorithms For Record Linkage.”:

"Efficient Sequential And Parallel Algorithms For Record Linkage." is available for download from The Internet Archive in "texts" format, the size of the file-s is: 11.71 Mbs, and the file-s went public at Thu Oct 23 2014.

Legal and Safety Notes

Copyright Disclaimer and Liability Limitation:

A. Automated Content Display
The creation of this page is fully automated. All data, including text, images, and links, is displayed exactly as received from its original source, without any modification, alteration, or verification. We do not claim ownership of, nor assume any responsibility for, the accuracy or legality of this content.

B. Liability Disclaimer for External Content
The files provided below are solely the responsibility of their respective originators. We disclaim any and all liability, whether direct or indirect, for the content, accuracy, legality, or any other aspect of these files. By using this website, you acknowledge that we have no control over, nor endorse, the content hosted by external sources.

C. Inquiries and Disputes
For any inquiries, concerns, or issues related to the content displayed, including potential copyright claims, please contact the original source or provider of the files directly. We are not responsible for resolving any content-related disputes or claims of intellectual property infringement.

D. No Copyright Ownership
We do not claim ownership of any intellectual property contained in the files or data displayed on this website. All copyrights, trademarks, and other intellectual property rights remain the sole property of their respective owners. If you believe that content displayed on this website infringes upon your intellectual property rights, please contact the original content provider directly.

E. Fair Use Notice
Some content displayed on this website may fall under the "fair use" provisions of copyright law for purposes such as commentary, criticism, news reporting, research, or educational purposes. If you believe any content violates fair use guidelines, please reach out directly to the original source of the content for resolution.

Virus Scanning for Your Peace of Mind:

The files provided below have already been scanned for viruses by their original source. However, if you’d like to double-check before downloading, you can easily scan them yourself using the following steps:

How to scan a direct download link for viruses:

  • 1- Copy the direct link to the file you want to download (don’t open it yet).
    • (a free online tool) and paste the direct link into the provided field to start the scan.
  • 2- Visit VirusTotal (a free online tool) and paste the direct link into the provided field to start the scan.
  • 3- VirusTotal will scan the file using multiple antivirus vendors to detect any potential threats.
  • 4- Once the scan confirms the file is safe, you can proceed to download it with confidence and enjoy your content.

Available Downloads

  • Source: Internet Archive
  • Internet Archive Link: Archive.org page
  • All Files are Available: Yes
  • Number of Files: 14
  • Number of Available Files: 14
  • Added Date: 2014-10-23 21:44:14
  • Scanner: Internet Archive Python library 0.7.5
  • PPI (Pixels Per Inch): 367
  • OCR: ABBYY FineReader 9.0

Available Files:

1- Text PDF

  • File origin: original
  • File Format: Text PDF
  • File Size: 0.00 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034.pdf
  • Direct Link: Click here

2- Item Tile

  • File origin: original
  • File Format: Item Tile
  • File Size: 0.00 Mbs
  • File Name: __ia_thumb.jpg
  • Direct Link: Click here

3- Metadata

  • File origin: original
  • File Format: Metadata
  • File Size: 0.00 Mbs
  • File Name: pubmed-PMC3932463_files.xml
  • Direct Link: Click here

4- JSON

  • File origin: original
  • File Format: JSON
  • File Size: 0.00 Mbs
  • File Name: pubmed-PMC3932463_medline.json
  • Direct Link: Click here

5- Metadata

  • File origin: original
  • File Format: Metadata
  • File Size: 0.00 Mbs
  • File Name: pubmed-PMC3932463_meta.sqlite
  • Direct Link: Click here

6- Metadata

  • File origin: original
  • File Format: Metadata
  • File Size: 0.00 Mbs
  • File Name: pubmed-PMC3932463_meta.xml
  • Direct Link: Click here

7- DjVu

  • File origin: derivative
  • File Format: DjVu
  • File Size: 0.00 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034.djvu
  • Direct Link: Click here

8- Animated GIF

  • File origin: derivative
  • File Format: Animated GIF
  • File Size: 0.00 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034.gif
  • Direct Link: Click here

9- Abbyy GZ

  • File origin: derivative
  • File Format: Abbyy GZ
  • File Size: 0.00 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034_abbyy.gz
  • Direct Link: Click here

10- DjVuTXT

  • File origin: derivative
  • File Format: DjVuTXT
  • File Size: 0.00 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034_djvu.txt
  • Direct Link: Click here

11- Djvu XML

  • File origin: derivative
  • File Format: Djvu XML
  • File Size: 0.00 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034_djvu.xml
  • Direct Link: Click here

12- Single Page Processed JP2 ZIP

  • File origin: derivative
  • File Format: Single Page Processed JP2 ZIP
  • File Size: 0.01 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034_jp2.zip
  • Direct Link: Click here

13- Scandata

  • File origin: derivative
  • File Format: Scandata
  • File Size: 0.00 Mbs
  • File Name: PMC3932463-amiajnl-2013-002034_scandata.xml
  • Direct Link: Click here

14- Archive BitTorrent

  • File origin: metadata
  • File Format: Archive BitTorrent
  • File Size: 0.00 Mbs
  • File Name: pubmed-PMC3932463_archive.torrent
  • Direct Link: Click here

Search for “Efficient Sequential And Parallel Algorithms For Record Linkage.” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Efficient Sequential And Parallel Algorithms For Record Linkage.” in Libraries Near You:

Read or borrow “Efficient Sequential And Parallel Algorithms For Record Linkage.” from your local library.

Buy “Efficient Sequential And Parallel Algorithms For Record Linkage.” online:

Shop for “Efficient Sequential And Parallel Algorithms For Record Linkage.” on popular online marketplaces.