Cost-sensitive alternating decision trees for record linkage
AssigneeIntelius
InventorsAndrew Borthwick, Sheng Chen
Life of this patent
Estimating the term…
Loading patent…
AssigneeIntelius
InventorsAndrew Borthwick, Sheng Chen
Estimating the term…
Record Linkage (RL) is the task of identifying two or more records referring to the same entity (e.g., a person, a company, etc.). RL models can be based on Cost Sensitive Alternating Decision Trees (ADTree), an algorithm that uniquely combines boosting and decision trees algorithms to create shorter and easier-to-interpret linking rules. These models can be naturally trained to operate at industrial precision/recall operating points, and the shorter output rules are so clear that it can effectively explain its decisions to non-technical users via score aggregation or visualization. The models significantly outperform other baselines on the desired industrial operating points, and the improved understanding of the model's decisions led to faster debugging and feature development cycles.
A record linkage method comprising:
A non-transitory storage medium arrangement storing computer program instructions that operate on plural records, said storage medium arrangement storing the following computer program instructions:
A method of operating on plural records comprising:
A system for operating on plural records comprising:
Dependencies are inferred from the claim text.