<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Hierarchical Graphical Model for Record Linkage · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1207.4180/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1207.4180/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Hierarchical Graphical Model for Record Linkage — mentioned by upquark</title><link>https://news.ycombinator.com/item?id=7106745</link><guid isPermaLink="false">urn:hackerpapers:mention:1207.4180:7106745</guid><pubDate>Thu, 23 Jan 2014 02:41:09 GMT</pubDate><description>&lt;p&gt;Nope, there&amp;#x27;s plenty of math and stats involved in solving this problem correctly. The amount of math you would apply here depends on your familiarity with the problem domain (this is where CS education comes into play), and your willingness and ability to work with higher level math and stats (this is where math proves necessary even in mundane software engineering tasks). For the record, even basic relational algebra can be seen as part of applied math, but the rabbit hole goes way deeper. The best solutions for de-duplication of records without direct clues like unique IDs involve pretty…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1207.4180/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
