A hierarchical Naïve Bayes model for approximate identity matching

A hierarchical Naïve Bayes model for approximate identity matching

0.00 Avg rating0 Votes
Article ID: iaor20115253
Volume: 51
Issue: 3
Start Page Number: 413
End Page Number: 423
Publication Date: Jun 2011
Journal: Decision Support Systems
Authors: , ,
Keywords: search
Abstract:

Organizations often manage identity information for their customers, vendors, and employees. Identity management is critical to various organizational practices ranging from customer relationship management to crime investigation. The task of searching for a specific identity is difficult because disparate identity information may exist due to the issues related to unintentional errors and intentional deception. In this paper we propose a hierarchical Naïve Bayes model that improves existing identity matching techniques in terms of searching effectiveness. Experiments show that our proposed model performs significantly better than the exact‐match based matching technique. With 50% training instances labeled, the proposed semi‐supervised learning achieves a performance comparable to the fully supervised record comparison algorithm. The semi‐supervised learning greatly reduces the efforts of manually labeling training instances without significant performance degradation.

Reviews

Required fields are marked *. Your email address will not be published.