IP Library Granted Patent US 12,430,346
Granted Patent B2
US 12,430,346 · App. 18/731,699 · Granted Sep 30, 2025

Systems and methods for automatic clustering and canonical designation of related data in various data structures

Inventors: Lawrence Manning (New York, NY); Rahul Mehta (New York, NY); Daniel Erenrich (Mountain View, CA); Guillem Palou Visa (London, GB); Roger Hu (New York, NY); Xavier Falco (London, GB); Rowan Gilmore (London, GB); Eli Bingham (New York, NY); Jason Prestinario (New York, NY); Yifei Huang (Jersey City, NJ); Daniel Fernandez (New York, NY); Jeremy Elser (New York, NY); Clayton Sader (San Francisco, CA); Rahul Agarwal (San Francisco, CA); Matthew Elkherj (Menlo Park, CA); Nicholas Latourette (San Francisco, CA); Aleksandr Zamoshchin (Aurora, CO)
Assignee: Palantir Technologies Inc.
G06F16/24578G06F16/285G06F16/35G06F16/9535G06F18/23
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,430,346
App. No.
18/731,699
Granted
Sep 30, 2025
Kind
B2
Abstract

Computer implemented systems and methods are disclosed for automatically clustering and canonically identifying related data in various data structures. Data structures may include a plurality of records, wherein each record is associated with a respective entity. In accordance with some embodiments, the systems and methods further comprise identifying clusters of records associated with a respective entity by grouping the records into pairs, analyzing the respective pairs to determine a probability that both members of the pair relate to a common entity, and identifying a cluster of overlapping pairs to generate a collection of records relating to a common entity. Clusters may further be analyzed to determine canonical names or other properties for the respective entities by analyzing record fields and identifying similarities.

Claims (79)

1. A computer-implemented method comprising:

receiving, via a network interface configured to receive digital data packets including data records, data records;

generating a plurality of record pairs from the received data records, wherein generating the plurality of record pairs includes:

applying a blocking model to the data records to generate groups of data records based at least in part on relationships between values of fields of the data records;

causing a client computing device to present at least a portion of the groups of data records to a user via a first user interface;

receiving first user feedback, from the user and via input to the first user interface of the client computing device, identifying one or more bad groups of data records;

generating first update information to be fed back into the blocking model based on the first user feedback;

re-applying the blocking model, based at least in part on the first update information, to re-generate the groups of data records; and

designating each of the groups of data records as a record pair of the plurality of record pairs;

applying a machine learning model to determine respective probabilities, for each of the plurality of record pairs, that respective first records and second records of the respective record pairs are associated with a respective same entity;

identifying, from the plurality of record pairs, an indeterminate record pair based at least in part on the associated determined probability being below a pre-established threshold;

causing the client computing device to present the indeterminate record pair to a user via a second user interface;

receiving second user feedback, from the user and via input to the second user interface of the client computing device, indicating whether the first and second records of the indeterminate record pair are associated with the same entity;

generating second update information to be fed back into the machine learning model based on the second user feedback;

re-applying the machine learning model, based at least in part on the second update information, to re-determine the probability of the indeterminate record pair;

identifying, for each cluster of record pairs, respective geographical locations corresponding to the clusters based at least in part on the respective probabilities;

associating, based on the identified geographical locations corresponding to the clusters, geographical locations with each of the data records;

generating, and causing the client computing device to display, a geographic map; and

based on the geographical locations associated with the respective data records, overlaying a heat map of the data records on the geographical map, wherein the heat map illustrates, for individual clusters of record pairs, information regarding a size of the cluster at the geographical location corresponding to the cluster.

2. The computer-implemented method of claim 1 further comprising:

determining, based at least in part on the probabilities, respective entities associated with one or more clusters of record pairs; and

outputting the clusters of record pairs and the respective entities associated with each cluster to the client computing device.

3. The computer-implemented method of claim 2 further comprising:

determining, for the record that is included in each record pair of a first cluster of record pairs, a canonical value for at least one field based at least in part on the probabilities of the record pairs in the first cluster.

4. The computer-implemented method of claim 2 further comprising:

filtering the record pairs in a first cluster of record pairs, and wherein the entity associated with the first cluster of record pairs is determined based at least in part on the filtered record pairs.

5. The computer-implemented method of claim 2 further comprising:

pruning the record pairs in each cluster of record pairs to produce a bipartite graph.

6. The computer-implemented method of claim 5 , wherein the record pairs are pruned based at least in part on the probabilities.

7. A system comprising:

a network interface configured to receive digital data packets including data records; and

one or more processors configured to execute computer-executable instructions to at least:

receiving data records via the network interface;

generate a plurality of record pairs from the received data records, wherein generating the plurality of record pairs includes:

applying a blocking model to the data records to generate groups of data records based at least in part on relationships between values of fields of the data records;

causing a client computing device to present at least a portion of the groups of data records to a user via a first user interface;

receiving first user feedback, from the user and via input to the first user interface of the client computing device, identifying one or more bad groups of data records;

generating first update information to be fed back into the blocking model based on the first user feedback;

re-applying the blocking model, based at least in part on the first update information, to re-generate the groups of data records; and

designating each of the groups of data records as a record pair of the plurality of record pairs;

apply a machine learning model to determine respective probabilities, for each of the plurality of record pairs, that respective first records and second records of the respective record pairs are associated with a respective same entity;

identify, from the plurality of record pairs, an indeterminate record pair based at least in part on the associated determined probability being below a pre-established threshold;

cause the client computing device to present the indeterminate record pair to a user via a second user interface;

receive second user feedback, from the user and via input to the second user interface of the client computing device, indicating whether the first and second records of the indeterminate record pair are associated with the same entity;

generate second update information to be fed back into the machine learning model based on the second user feedback;

re-apply the machine learning model, based at least in part on the second update information, to re-determine the probability of the indeterminate record pair;

identify, for each cluster of record pairs, respective geographical locations corresponding to the clusters based at least in part on the respective probabilities;

associate, based on the identified geographical locations corresponding to the clusters, geographical locations with each of the data records;

generate, and causing the client computing device to display, a geographic map; and

based on the geographical locations associated with the respective data records, overlay a heat map of the data records on the geographical map, wherein the heat map illustrates, for individual clusters of record pairs, information regarding a size of the cluster at the geographical location corresponding to the cluster.

8. The system of claim 7 , wherein the one or more processors are configured to execute computer-executable instructions to further at least:

determine, based at least in part on the probabilities, respective entities associated with one or more clusters of record pairs; and

output the clusters of record pairs and the respective entities associated with each cluster to the client computing device.

9. The system of claim 8 , wherein the one or more processors are configured to execute computer-executable instructions to further at least:

determine, for the record that is included in each record pair of a first cluster of record pairs, a canonical value for at least one field based at least in part on the probabilities of the record pairs in the first cluster.

10. The system of claim 8 , wherein the one or more processors are configured to execute computer-executable instructions to further at least:

filter the record pairs in a first cluster of record pairs, and wherein the entity associated with the first cluster of record pairs is determined based at least in part on the filtered record pairs.

11. The system of claim 8 , wherein the one or more processors are configured to execute computer-executable instructions to further at least:

prune the record pairs in each cluster of record pairs to produce a bipartite graph.

12. The system of claim 7 , wherein the record pairs are pruned based at least in part on the probabilities.

13. A non-transitory computer-readable storage medium including computer-executable instructions that, when executed by one or more processors, cause the one or more processors to:

receive, via a network interface configured to receive digital data packets including data records, data records;

generate a plurality of record pairs from the received data records, wherein generating the plurality of record pairs includes:

applying a blocking model to the data records to generate groups of data records based at least in part on relationships between values of fields of the data records;

causing a client computing device to present at least a portion of the groups of data records to a user via a first user interface;

receiving first user feedback, from the user and via input to the first user interface of the client computing device, identifying one or more bad groups of data records;

generating first update information to be fed back into the blocking model based on the first user feedback;

re-applying the blocking model, based at least in part on the first update information, to re-generate the groups of data records; and

designating each of the groups of data records as a record pair of the plurality of record pairs;

apply a machine learning model to determine respective probabilities, for each of the plurality of record pairs, that respective first records and second records of the respective record pairs are associated with a respective same entity;

identify, from the plurality of record pairs, an indeterminate record pair based at least in part on the associated determined probability being below a pre-established threshold;

cause the client computing device to present the indeterminate record pair to a user via a second user interface;

receive second user feedback, from the user and via input to the second user interface of the client computing device, indicating whether the first and second records of the indeterminate record pair are associated with the same entity;

generate second update information to be fed back into the machine learning model based on the second user feedback;

re-apply the machine learning model, based at least in part on the update information, to re-determine the probability of the indeterminate record pair;

identify, for each cluster of record pairs, respective geographical locations corresponding to the clusters based at least in part on the respective probabilities;

associate, based on the identified geographical locations corresponding to the clusters, geographical locations with each of the data records;

generate, and causing the client computing device to display, a geographic map; and

based on the geographical locations associated with the respective data records, overlay a heat map of the data records on the geographical map, wherein the heat map illustrates, for individual clusters of record pairs, information regarding a size of the cluster at the geographical location corresponding to the cluster.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 5, 2024
From: MANNING, LAWRENCE; MEHTA, RAHUL; ERENRICH, DANIEL; VISA, GUILLEM PALOU; HU, ROGER; FALCO, XAVIER; GILMORE, ROWAN; BINGHAM, ELI; PRESTINARIO, JASON; HUANG, YIFEI; FERNANDEZ, DANIEL; ELSER, JEREMY; SADER, CLAYTON; AGARWAL, RAHUL; ELKHERJ, MATTHEW; LATOURETTE, NICHOLAS; ZAMOSHCHIN, ALEKSANDR
To: PALANTIR TECHNOLOGIES INC.
Reel/Frame 067628/0621 →
Continuity (6)
Continuation 18325616 · May 30, 2023
Continuation 17812984 · Jul 15, 2022
Continuation 16189040 · Nov 13, 2018
Continuation 15233149 · Aug 10, 2016
Provisional Application 62207335 · Aug 19, 2015
Related Publication 20240320227A1 · Sep 26, 2024
References Cited (400)
US 5826021A · Mastors et al. · 1998 [cited by applicant]
US 5832218A · Gibbs et al. · 1998 [cited by applicant]
US 5878434A · Draper et al. · 1999 [cited by applicant]
US 5897636A · Kaeser · 1999 [cited by applicant]
US 5966706A · Biliris et al. · 1999 [cited by applicant]
US 5978475A · Schneier et al. · 1999 [cited by applicant]
US 6006242A · Poole et al. · 1999 [cited by applicant]
US 6057757A · Arrowsmith et al. · 2000 [cited by applicant]
US 6101479A · Shaw · 2000 [cited by applicant]
US 6134582A · Kennedy · 2000 [cited by applicant]
US 6243717B1 · Gordon et al. · 2001 [cited by applicant]
US 6347374B1 · Drake et al. · 2002 [cited by applicant]
US 6430305B1 · Decker · 2002 [cited by applicant]
US 6463404B1 · Appleby · 2002 [cited by applicant]
US 6519627B1 · Dan et al. · 2003 [cited by applicant]
US 6523019B1 · Borthwick · 2003 [cited by applicant]
US 6725240B1 · Asad et al. · 2004 [cited by applicant]
US 7017046B2 · Doyle et al. · 2006 [cited by applicant]
US 7058648B1 · Lightfoot et al. · 2006 [cited by applicant]
US 7089541B2 · Ungar · 2006 [cited by applicant]
US 7117430B2 · Maguire et al. · 2006 [cited by applicant]
US 7403942B1 · Bayliss · 2008 [cited by applicant]
US 7461158B2 · Rider et al. · 2008 [cited by applicant]
US 7627489B2 · Schaeffer et al. · 2009 [cited by applicant]
US 7739246B2 · Mooney et al. · 2010 [cited by applicant]
US 7757220B2 · Griffith et al. · 2010 [cited by applicant]
US 7770032B2 · Nesta et al. · 2010 [cited by applicant]
US 7801871B2 · Gosnell · 2010 [cited by applicant]
US 7877421B2 · Berger et al. · 2011 [cited by applicant]
US 7912842B1 · Bayliss · 2011 [cited by applicant]
US 7962495B2 · Jain et al. · 2011 [cited by applicant]
US 8117022B2 · Linker · 2012 [cited by applicant]
US 8126848B2 · Wagner · 2012 [cited by applicant]
US 8190893B2 · Benson et al. · 2012 [cited by applicant]
US 8290838B1 · Thakur et al. · 2012 [cited by applicant]
US 8302855B2 · Ma et al. · 2012 [cited by applicant]
US 8364642B1 · Garrod · 2013 [cited by applicant]
US 8386377B1 · Xiong et al. · 2013 [cited by applicant]
US 8392556B2 · Goulet et al. · 2013 [cited by applicant]
US 8417715B1 · Bruckhaus et al. · 2013 [cited by applicant]
US 8429527B1 · Arbogast · 2013 [cited by applicant]
US 8527475B1 · Rammohan et al. · 2013 [cited by applicant]
US 8554719B2 · McGrew · 2013 [cited by applicant]
US 8601326B1 · Kirn · 2013 [cited by applicant]
US 8639552B1 · Chen et al. · 2014 [cited by applicant]
US 8676804B1 · Janos · 2014 [cited by examiner]
US 8688573B1 · Ruknoic et al. · 2014 [cited by applicant]
US 8700569B1 · Wilson et al. · 2014 [cited by applicant]
US 8788405B1 · Sprague · 2014 [cited by examiner]
US 8798354B1 · Bunzel et al. · 2014 [cited by applicant]
US 8812444B2 · Garrod et al. · 2014 [cited by applicant]
US 8838538B1 · Landau et al. · 2014 [cited by applicant]
US 8855999B1 · Elliot · 2014 [cited by applicant]
US 8903717B2 · Elliot · 2014 [cited by applicant]
US 8914366B1 · Li · 2014 [cited by examiner]
US 8924388B2 · Elliot et al. · 2014 [cited by applicant]
US 8924389B2 · Elliot et al. · 2014 [cited by applicant]
US 8938434B2 · Jain et al. · 2015 [cited by applicant]
US 8938686B1 · Erenrich et al. · 2015 [cited by applicant]
US 9047368B1 · Cooley · 2015 [cited by examiner]
US 9105000B1 · White et al. · 2015 [cited by applicant]
US 9230060B2 · Friedlander et al. · 2016 [cited by applicant]
US 9275125B1 · Mungur · 2016 [cited by examiner]
US 9286373B2 · Elliot et al. · 2016 [cited by applicant]
US 9348499B2 · Aymeloglu et al. · 2016 [cited by applicant]
US 9348851B2 · Kirn · 2016 [cited by applicant]
US 10127289B2 · Manning et al. · 2018 [cited by applicant]
US 10140664B2 · Erenrich · 2018 [cited by examiner]
US 10255246B1 · Zhang · 2019 [cited by examiner]
US 10599738B1 · Bayliss-McCulloch · 2020 [cited by examiner]
US 11392591B2 · Manning et al. · 2022 [cited by applicant]
US 11704325B2 · Manning et al. · 2023 [cited by applicant]
US 12038933B2 · Manning et al. · 2024 [cited by applicant]
US 20020035590A1 · Eibach et al. · 2002 [cited by applicant]
US 20020095360A1 · Joao · 2002 [cited by applicant]
US 20020103705A1 · Brady · 2002 [cited by applicant]
US 20020112157A1 · Doyle et al. · 2002 [cited by applicant]
US 20020194058A1 · Eldering · 2002 [cited by applicant]
US 20030061132A1 · Mason et al. · 2003 [cited by applicant]
US 20030074187A1 · Ait-Mokhtar et al. · 2003 [cited by applicant]
US 20030088438A1 · Maughan et al. · 2003 [cited by applicant]
US 20030093401A1 · Czahkowski et al. · 2003 [cited by applicant]
US 20030105759A1 · Bess et al. · 2003 [cited by applicant]
US 20030115481A1 · Baird et al. · 2003 [cited by applicant]
US 20030126102A1 · Borthwick · 2003 [cited by applicant]
US 20030171942A1 · Gaito · 2003 [cited by applicant]
US 20030177112A1 · Gardner · 2003 [cited by applicant]
US 20030182313A1 · Federwisch et al. · 2003 [cited by applicant]
US 20030212718A1 · Tester · 2003 [cited by applicant]
US 20040003009A1 · Wilmot · 2004 [cited by applicant]
US 20040006523A1 · Coker · 2004 [cited by applicant]
US 20040034570A1 · Davis · 2004 [cited by applicant]
US 20040083466A1 · Dapp et al. · 2004 [cited by applicant]
US 20040088177A1 · Travis et al. · 2004 [cited by applicant]
US 20040117387A1 · Civetta et al. · 2004 [cited by applicant]
US 20040153451A1 · Phillips et al. · 2004 [cited by applicant]
US 20040210763A1 · Jonas · 2004 [cited by applicant]
US 20040236688A1 · Bozeman · 2004 [cited by applicant]
US 20050010472A1 · Quatse et al. · 2005 [cited by applicant]
US 20050097441A1 · Herbach et al. · 2005 [cited by applicant]
US 20050102328A1 · Ring et al. · 2005 [cited by applicant]
US 20050131935A1 · O'Leary et al. · 2005 [cited by applicant]
US 20050262493A1 · Schmidt et al. · 2005 [cited by applicant]
US 20050262512A1 · Schmidt et al. · 2005 [cited by applicant]
US 20060010130A1 · Leff et al. · 2006 [cited by applicant]
US 20060080283A1 · Shipman · 2006 [cited by applicant]
US 20060080316A1 · Gilmore et al. · 2006 [cited by applicant]
US 20060085483A1 · Mooney et al. · 2006 [cited by applicant]
US 20060143075A1 · Carr et al. · 2006 [cited by applicant]
US 20060161558A1 · Tamma et al. · 2006 [cited by applicant]
US 20060178954A1 · Thukral et al. · 2006 [cited by applicant]
US 20060209085A1 · Wong et al. · 2006 [cited by applicant]
US 20060218206A1 · Bourbonnais et al. · 2006 [cited by applicant]
US 20060218491A1 · Grossman et al. · 2006 [cited by applicant]
US 20060253502A1 · Raman et al. · 2006 [cited by applicant]
US 20070000999A1 · Kubo et al. · 2007 [cited by applicant]
US 20070039018A1 · Saslow et al. · 2007 [cited by applicant]
US 20070067285A1 · Blume · 2007 [cited by applicant]
US 20070162454A1 · D'Albora et al. · 2007 [cited by applicant]
US 20070178501A1 · Rabinowitz et al. · 2007 [cited by applicant]
US 20070192122A1 · Routson et al. · 2007 [cited by applicant]
US 20070233756A1 · D'Souza et al. · 2007 [cited by applicant]
US 20070271317A1 · Carmel · 2007 [cited by applicant]
US 20070284433A1 · Domenica et al. · 2007 [cited by applicant]
US 20070295797A1 · Herman et al. · 2007 [cited by applicant]
US 20070299697A1 · Friedlander et al. · 2007 [cited by applicant]
US 20080005063A1 · Seeds · 2008 [cited by applicant]
US 20080104407A1 · Horne et al. · 2008 [cited by applicant]
US 20080126344A1 · Hoffman et al. · 2008 [cited by applicant]
US 20080126951A1 · Sood et al. · 2008 [cited by applicant]
US 20080140387A1 · Linker · 2008 [cited by applicant]
US 20080168054A1 · Lee et al. · 2008 [cited by applicant]
US 20080168531A1 · Gavin · 2008 [cited by applicant]
US 20080195672A1 · Hamel et al. · 2008 [cited by applicant]
US 20080201580A1 · Savitzky et al. · 2008 [cited by applicant]
US 20080208735A1 · Balet et al. · 2008 [cited by applicant]
US 20080228467A1 · Womack et al. · 2008 [cited by applicant]
US 20080267386A1 · Cooper · 2008 [cited by applicant]
US 20080270316A1 · Guidotti et al. · 2008 [cited by applicant]
US 20080281580A1 · Zabokritski · 2008 [cited by applicant]
US 20080301042A1 · Patzer · 2008 [cited by applicant]
US 20080313132A1 · Hao et al. · 2008 [cited by applicant]
US 20090012973A1 · Moon et al. · 2009 [cited by applicant]
US 20090055487A1 · Moraes et al. · 2009 [cited by applicant]
US 20090094270A1 · Alirez et al. · 2009 [cited by applicant]
US 20090106178A1 · Chu · 2009 [cited by applicant]
US 20090106242A1 · McGrew · 2009 [cited by applicant]
US 20090112745A1 · Stefanescu · 2009 [cited by applicant]
US 20090157732A1 · Hao et al. · 2009 [cited by applicant]
US 20090164387A1 · Armstrong et al. · 2009 [cited by applicant]
US 20090187546A1 · Whyte et al. · 2009 [cited by applicant]
US 20090216562A1 · Faulkner et al. · 2009 [cited by applicant]
US 20090228365A1 · Tomchek et al. · 2009 [cited by applicant]
US 20090228507A1 · Jain et al. · 2009 [cited by applicant]
US 20090228701A1 · Lin · 2009 [cited by applicant]
US 20090249244A1 · Robinson et al. · 2009 [cited by applicant]
US 20090259650A1 · Schuil · 2009 [cited by examiner]
US 20090271343A1 · Vaiciulis et al. · 2009 [cited by applicant]
US 20090299830A1 · West et al. · 2009 [cited by applicant]
US 20090307049A1 · Elliott et al. · 2009 [cited by applicant]
US 20090313311A1 · Hoffmann et al. · 2009 [cited by applicant]
US 20090313463A1 · Pang et al. · 2009 [cited by applicant]
US 20090319515A1 · Minton et al. · 2009 [cited by applicant]
US 20100057622A1 · Faith et al. · 2010 [cited by applicant]
US 20100070531A1 · Aymeloglu et al. · 2010 [cited by applicant]
US 20100070842A1 · Aymeloglu et al. · 2010 [cited by applicant]
US 20100076813A1 · Ghosh et al. · 2010 [cited by applicant]
US 20100082541A1 · Kottomtharayil · 2010 [cited by applicant]
US 20100082671A1 · Li et al. · 2010 [cited by applicant]
US 20100098318A1 · Anderson · 2010 [cited by applicant]
US 20100114817A1 · Broeder et al. · 2010 [cited by applicant]
US 20100114831A1 · Gilbert et al. · 2010 [cited by applicant]
US 20100125470A1 · Chisholm · 2010 [cited by applicant]
US 20100125604A1 · Martinez et al. · 2010 [cited by applicant]
US 20100145909A1 · Ngo · 2010 [cited by applicant]
US 20100204983A1 · Chung et al. · 2010 [cited by applicant]
US 20100211550A1 · Daniello et al. · 2010 [cited by applicant]
US 20100306285A1 · Shah et al. · 2010 [cited by applicant]
US 20100332008A1 · Knipfer et al. · 2010 [cited by applicant]
US 20110004626A1 · Naeymi-Rad et al. · 2011 [cited by applicant]
US 20110004702A1 · Tsofi et al. · 2011 [cited by applicant]
US 20110010401A1 · Adams et al. · 2011 [cited by applicant]
US 20110060910A1 · Gormish et al. · 2011 [cited by applicant]
US 20110066497A1 · Gopinath et al. · 2011 [cited by applicant]
US 20110093327A1 · Fordyce, III et al. · 2011 [cited by applicant]
US 20110099133A1 · Chang et al. · 2011 [cited by applicant]
US 20110131547A1 · Elaasar · 2011 [cited by applicant]
US 20110173093A1 · Psota et al. · 2011 [cited by applicant]
US 20110173189A1 · Singh et al. · 2011 [cited by applicant]
US 20110208565A1 · Ross et al. · 2011 [cited by applicant]
US 20110208822A1 · Rathod · 2011 [cited by applicant]
US 20110225586A1 · Bentley et al. · 2011 [cited by applicant]
US 20110238408A1 · Larcheveque et al. · 2011 [cited by applicant]
US 20110252282A1 · Meek et al. · 2011 [cited by applicant]
US 20110258216A1 · Supakkul et al. · 2011 [cited by applicant]
US 20110282890A1 · Griffith · 2011 [cited by applicant]
US 20120013684A1 · Robertson et al. · 2012 [cited by applicant]
US 20120022945A1 · Falkenborg et al. · 2012 [cited by applicant]
US 20120059853A1 · Jagota · 2012 [cited by applicant]
US 20120065987A1 · Farooq et al. · 2012 [cited by applicant]
US 20120078595A1 · Balandin et al. · 2012 [cited by applicant]
US 20120084287A1 · Lakshminarayan et al. · 2012 [cited by applicant]
US 20120089606A1 · Eshwar et al. · 2012 [cited by applicant]
US 20120136804A1 · Lucia · 2012 [cited by applicant]
US 20120150860A1 · Bhamidipati et al. · 2012 [cited by applicant]
US 20120191446A1 · Binsztok et al. · 2012 [cited by applicant]
US 20120215784A1 · King et al. · 2012 [cited by applicant]
US 20120254188A1 · Koperski · 2012 [cited by examiner]
US 20120290879A1 · Shibuya et al. · 2012 [cited by applicant]
US 20120294540A1 · Sun · 2012 [cited by examiner]
US 20120317115A1 · Naito · 2012 [cited by examiner]
US 20130006947A1 · Akinyemi et al. · 2013 [cited by applicant]
US 20130016106A1 · Yip et al. · 2013 [cited by applicant]
US 20130080521A1 · Souza et al. · 2013 [cited by applicant]
US 20130091084A1 · Lee · 2013 [cited by applicant]
US 20130096968A1 · Van Pelt et al. · 2013 [cited by applicant]
US 20130097130A1 · Bingol et al. · 2013 [cited by applicant]
US 20130124193A1 · Holmberg · 2013 [cited by applicant]
US 20130132348A1 · Garrod · 2013 [cited by applicant]
US 20130151453A1 · Bhanot et al. · 2013 [cited by applicant]
US 20130159305A1 · Starks · 2013 [cited by examiner]
US 20130166480A1 · Popescu et al. · 2013 [cited by applicant]
US 20130198565A1 · Mancoridis et al. · 2013 [cited by applicant]
US 20130226879A1 · Talukder et al. · 2013 [cited by applicant]
US 20130226944A1 · Baid et al. · 2013 [cited by applicant]
US 20130227016A1 · Risher · 2013 [cited by examiner]
US 20130246316A1 · Zhao et al. · 2013 [cited by applicant]
US 20130263019A1 · Castellanos et al. · 2013 [cited by applicant]
US 20130325826A1 · Agarwal et al. · 2013 [cited by applicant]
US 20130332450A1 · Castelli · 2013 [cited by examiner]
US 20140006404A1 · McGrew et al. · 2014 [cited by applicant]
US 20140032556A1 · Bayliss · 2014 [cited by examiner]
US 20140089339A1 · Siddiqui et al. · 2014 [cited by applicant]
US 20140095363A1 · Caldwell · 2014 [cited by applicant]
US 20140108074A1 · Miller et al. · 2014 [cited by applicant]
US 20140164379A1 · Jojgov et al. · 2014 [cited by applicant]
US 20140172856A1 · Imbruce · 2014 [cited by examiner]
US 20140222793A1 · Sadkin et al. · 2014 [cited by applicant]
US 20140244641A1 · Patterson · 2014 [cited by examiner]
US 20140244659A1 · Liu · 2014 [cited by examiner]
US 20140279299A1 · Erenrich · 2014 [cited by applicant]
US 20140297640A1 · Duftler et al. · 2014 [cited by applicant]
US 20140358829A1 · Hurwitz · 2014 [cited by applicant]
US 20140365507A1 · Wissner · 2014 [cited by examiner]
US 20150012509A1 · Kirn · 2015 [cited by applicant]
US 20150019991A1 · Kristjánsson · 2015 [cited by applicant]
US 20150032738A1 · Nachnani · 2015 [cited by examiner]
US 20150039473A1 · Hu · 2015 [cited by examiner]
US 20150046481A1 · Elliot · 2015 [cited by applicant]
US 20150100907A1 · Erenrich et al. · 2015 [cited by applicant]
US 20150106379A1 · Elliot et al. · 2015 [cited by applicant]
US 20150188715A1 · Castelluci et al. · 2015 [cited by applicant]
US 20150199363A1 · Morton · 2015 [cited by examiner]
US 20150227542A1 · Thatavarthy et al. · 2015 [cited by applicant]
US 20150324919A1 · Riggs · 2015 [cited by examiner]
US 20160004667A1 · Chakerian · 2016 [cited by examiner]
US 20160034715A1 · Dubov · 2016 [cited by examiner]
US 20160070706A1 · Lee · 2016 [cited by applicant]
US 20160110433A1 · Sawhney · 2016 [cited by examiner]
US 20160171557A1 · Fanous · 2016 [cited by examiner]
US 20160239496A1 · Motte · 2016 [cited by examiner]
US 20160314184A1 · Bendersky · 2016 [cited by examiner]
US 20170004198A1 · Zholudev · 2017 [cited by examiner]
US 20170032279A1 · Miserendino et al. · 2017 [cited by applicant]
US 20180285595A1 · Jessen · 2018 [cited by applicant]
US 20230297582A1 · Manning et al. · 2023 [cited by applicant]
AU 2014203669 · 2016 [cited by applicant]
CN 102054015 · 2014 [cited by applicant]
DE 102014204827 · 2014 [cited by applicant]
DE 102014204830 · 2014 [cited by applicant]
DE 102014204834 · 2014 [cited by applicant]
DE 102014213036 · 2015 [cited by applicant]
EP 1566758 · 2005 [cited by applicant]
EP 1962222 · 2008 [cited by applicant]
EP 2487610 · 2012 [cited by applicant]
EP 2551799 · 2013 [cited by applicant]
EP 2778913 · 2014 [cited by applicant]
EP 2778914 · 2014 [cited by applicant]
EP 2897051 · 2015 [cited by applicant]
EP 3035214 · 2016 [cited by applicant]
EP 3133511 · 2017 [cited by applicant]
GB 2366498 · 2002 [cited by applicant]
GB 2513472 · 2014 [cited by applicant]
GB 2513721 · 2014 [cited by applicant]
GB 2517582 · 2015 [cited by applicant]
NL 2013134 · 2015 [cited by applicant]
WO WO2005010685 · 2005 [cited by applicant]
WO WO2009051987 · 2009 [cited by applicant]
WO WO2010030919 · 2010 [cited by applicant]
WO WO2011017289 · 2011 [cited by applicant]
WO WO2011071833 · 2011 [cited by applicant]
WO WO2012061162 · 2012 [cited by applicant]
WO WO2012079836 · 2012 [cited by applicant]
WO WO2013067077 · 2013 [cited by applicant]
Systems and Methods for Automatic Clustering and Canonical Designation of Related Data in Various Data Strucutres, Jul. 19, 2022. [cited by applicant]
Systems and Methods for Automatic Clustering and Canonical Designation of Related Data in Various Data Strucutres, Jul. 18, 2023. [cited by applicant]
U.S. Appl. No. 18/325,616, Systems and Methods for Automatic Clustering and Canonical Designation of Related Data in Various Data Strucutres, filed May 30, 2023 [cited by applicant]
“A Tour of Pinboard,” <http://pinboard.in/tour> as printed May 15, 2014 in 6 pages. [cited by applicant]
“E-MailRelay,” <http://web.archive.org/web/20080821175021/http://emailrelay.sourceforge.net/> Aug. 21, 2008, pp. 2. [cited by applicant]
Anonymous, “A Real-World Problem of Matching Records,” Nov. 2006, <http://grupoweb.upf.es/bd-web/slides/ullman.pdf> pp. 1-16. [cited by applicant]
Bhattacharya et al., “Collective Entity Resolution in Relational Data,” ACM Transactions on Knowledge Discovery from Data (TKDD, Association for Computing Machinery, Inc., vol. 1, No. 1, Mar. 1, 2007, pp. 5-es. [cited by applicant]
Brandel, Mary, “Data Loss Prevention Dos and Don'ts,” <http://web.archive.org/web/20080724024847/http://www.csoonline.com/article/221272/Dos_and_Don_ts_for_Data_Loss_Prevention>, Oct. 10, 2007, pp. 5. [cited by applicant]
Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8. [cited by applicant]
Delicious, <http://delicious.com/> as printed May 15, 2014 in 1 page. [cited by applicant]
Draisbach et al., “A Comparison and Generalization of Blocking and Windowing Algorithm for Duplicate Detection,” Aug. 24, 2009, retrieved from https://hpi.de/fileadmin/user_upload/fachgebiete/naumann/publication/2009/QD… [cited by applicant]
Elmagarmid et al., “Duplicate Record Detection: A Survey,” IEEE Transactions on Knowledge and Data Engineering, IEEE Service Center, Los Alamitos, California, US, vol. 19, No. 1, Jan. 1, 2007, pp. 1-16. [cited by applicant]
Ferreira et al., “A Scheme for Analyzing Electronic Payment Systems,” Basil 1997. [cited by applicant]
Geiger, Jonathan G., “Data Quality Management, The Most Critical Initiative You Can Implement”, Data Warehousing, Management and Quality, Paper 098-29, SUGI 29, Intelligent Solutions, Inc., Bounder, CO, pp. 14, accessed… [cited by applicant]
Getoor et al., “Entity Resolution for Big Data,” Aug. 11, 2013, retrieved from http://www.umiacs.umd.edu/˜geotoor/Tutorials/ER_KDD2013.pdf. [cited by applicant]
Gill et al., “Computerised Linking of Medical Records: Methodological Guidelines.” [cited by applicant]
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32. [cited by applicant]
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services”, HiPC 2006, LNCS 4297, pp. 277-288, 2006. [cited by applicant]
Johnson, Maggie, “Introduction to YACC and Bison”. [cited by applicant]
Johnson, Steve, “Access 2013 on demand,” Access 2013 on Demand, May 9, 2013, Que Publishing. [cited by applicant]
Kardes et al., “Graph-based Approaches for Organization Entity Resolution in MapReduce,” Proceedings of the TextGraphs-8 Workshop, Oct. 18, 2013, pp. 70-78. [cited by applicant]
Kopcke et al., “Frameworks for Entity Matching: A Comparison,” Data & Knowledge Engineering, vol. 69, No. 2, Feb. 1, 2010, pp. 197-210. [cited by applicant]
Lim et al., “Resolving Attribute Incompatibility in Database Integration: An Evidential Reasoning Approach,” Department of Computer Science, University of Minnesota, 1994, <http://reference.kfupm.edu.sa/content/r/e/reso… [cited by applicant]
Litwin et al., “Multidatabase Interoperability,” IEEE Computer, Dec. 1986, vol. 19, No. 12, http://www.lamsade.dauphine.fr/˜litwin/mdb-interoperability.pdf, pp. 10-18. [cited by applicant]
Ma et al., “A New Approach to Secure Logging,” ACM Transactions on Storage, vol. 5, No. 1, Article 2, Published Mar. 2009, 21 pages. [cited by applicant]
Nadeau et al., “A Survey of Named Entity Recognition and Classification,” Jan. 15, 2004, pp. 20. [cited by applicant]
Nin et al., “On the Use of Semantic Blocking Techniques for Data Cleansing and Integration,” 11th International Database Engineering and Applications Symposium, 2007, pp. 9. [cited by applicant]
Pythagoras Communications Ltd., “Microsoft CRM Duplicate Detection,” Sep. 13, 2011, https://www.youtube.com/watch?v=j-7Qis0D0Kc. [cited by applicant]
Qiang et al., “A Mutual-Information-Based Approach to Entity Reconciliation in Heterogeneous Databases,” Proceedings of 2008 International Conference on Computer Science & Software Engineering, IEEE Computer Society, Ne… [cited by applicant]
Schneier et al., “Automatic Event Stream Notarization Using Digital Signatures,” Security Protocols, International Workshop Apr. 1996 Proceedings, Springer-Verlag, 1997, pp. 155-169, https://schneier.com/paper-event-str… [cited by applicant]
Schneier et al., “Cryptographic Support for Secure Logs on Untrusted Machines,” The Seventh USENIX Security Symposium Proceedings, USENIX Press, Jan. 1998, pp. 53-62, https://www.schneier.com/paper-secure-logs.pdf. [cited by applicant]
Sekine et al., “Definition, Dictionaries and Tagger for Extended Named Entity Hierarchy,” May 2004, pp. 1977-1980. [cited by applicant]
Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages. [cited by applicant]
Waters et al., “Building an Encrypted and Searchable Audit Log,” Published Jan. 9, 2004, 11 pages, http://www.parc.com/content/attachments/building_encrypted_searchable_5059_parc.pdf. [cited by applicant]
Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748. [cited by applicant]
Wikipedia, “Record Linkage,” May 9, 2015, retrieved from https://web.archive.org/web/20150509130215/http://en.wikipedia.org/wiki/Record_Linkage. [cited by applicant]
Winkler, William E., “Bureau of the Census Statistical Research Division Record Linkage Software and Methods for Merging Administrative Lists,” Statistical Research Report Series No. RR2001/03, Jul. 23, 2001, https://ww… [cited by applicant]
Zhao et al., “Entity Matching Across Heterogeneous Data Sources: An Approach Based On Constrained Cascade Generalization,” Data & Knowledge Engineering, vol. 66, No. 3, Sep. 2008, pp. 368-381. [cited by applicant]
Notice of Acceptance for Australian Patent Application No. 2014203669 dated Jan. 21, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 12/556,307 dated Mar. 21, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 12/556,307 dated Jan. 4, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/094,418 dated Jan. 25, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/223,918 dated Jan. 6, 2016. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/304,741 dated Apr. 7, 2015. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 14/552,336 dated Nov. 3, 2015. [cited by applicant]
Official Communication for Australian Patent Application No. 2014201506 dated Feb. 27, 2015. [cited by applicant]
Official Communication for Australian Patent Application No. 2014201507 dated Feb. 27, 2015. [cited by applicant]
Official Communication for Australian Patent Application No. 2014203669 dated May 29, 2015. [cited by applicant]
Official Communication for European Patent Application No. 09813700.3 dated Apr. 3, 2014. [cited by applicant]
Official Communication for European Patent Application No. 10188239.7 dated Mar. 24, 2016. [cited by applicant]
Official Communication for European Patent Application No. 14158958.0 dated Mar. 11, 2016. [cited by applicant]
Official Communication for European Patent Application No. 14158958.0 dated Apr. 16, 2015. [cited by applicant]
Official Communication for European Patent Application No. 14158958.0 dated Jun. 3, 2014. [cited by applicant]
Official Communication for European Patent Application No. 14158977.0 dated Jun. 10, 2014. [cited by applicant]
Official Communication for European Patent Application No. 14158977.0 dated Mar. 11, 2016. [cited by applicant]
Official Communication for European Patent Application No. 14158977.0 dated Apr. 16, 2015. [cited by applicant]
Official Communication for European Patent Application No. 14199180.2 dated Jun. 22, 2015. [cited by applicant]
Official Communication for European Patent Application No. 14199180.2 dated Aug. 31, 2015. [cited by applicant]
Official Communication for European Patent Application No. 15200073.3 dated Mar. 30, 2016. [cited by applicant]
Official Communication for European Patent Application No. 16184820.5 dated Jan. 3, 2017. [cited by applicant]
Official Communication for European Patent Application No. 16184820.5 dated Jan. 19, 2018. [cited by applicant]
Official Communication for European Patent Application No. 16184820.5 dated Dec. 19, 2018. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1411984.6 dated Aug. 1, 2016. [cited by applicant]
Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014. [cited by applicant]
Official Communication for Netherlands Patent Application No. 2012417 dated Sep. 18, 2015. [cited by applicant]
Official Communication for Netherlands Patent Application No. 2012421 dated Sep. 18, 2015. [cited by applicant]
Official Communication for Netherlands Patent Application No. 2012438 dated Sep. 21, 2015. [cited by applicant]
Official Communication for Netherlands Patent Application No. 2013134 dated Apr. 20, 2015. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622389 dated Mar. 20, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622404 dated Mar. 20, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622439 dated Mar. 24, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622439 dated Jun. 6, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 627061 dated Jul. 14, 2014. [cited by applicant]
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 12/556,307 dated Oct. 1, 2013. [cited by applicant]
Official Communication for U.S. Appl. No. 12/556,307 dated Feb. 13, 2012. [cited by applicant]
Official Communication for U.S. Appl. No. 12/556,307 dated Mar. 14, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 12/556,307 dated Sep. 2, 2011. [cited by applicant]
Official Communication for U.S. Appl. No. 12/556,307 dated Jun. 9, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 13/827,491 dated Mar. 30, 2016. [cited by applicant]
Official Communication for U.S. Appl. No. 13/827,491 dated Oct. 9, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/014,313 dated Jun. 18, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/014,313 dated Feb. 26, 2016. [cited by applicant]
Official Communication for U.S. Appl. No. 14/223,918 dated Jun. 8, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/304,741 dated Mar. 3, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/304,741 dated Aug. 6, 2014. [cited by applicant]
Official Communication for U.S. Appl. No. 14/526,066 dated Jan. 21, 2016. [cited by applicant]
Official Communication for U.S. Appl. No. 14/526,066 dated May 6, 2016. [cited by applicant]
Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/571,098 dated Nov. 10, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/571,098 dated Feb. 23, 2016. [cited by applicant]
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 24, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/800,447 dated Dec. 10, 2015. [cited by applicant]
Official Communication for U.S. Appl. No. 14/800,447 dated Mar. 3, 2016. [cited by applicant]