A hierarchical Naïve Bayes model for approximate identity matching

  • Authors:
  • G. Alan Wang;Homa Atabakhsh;Hsinchun Chen

  • Affiliations:
  • Department of Business Information Technology, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, United States;Department of Management Information Systems, The University of Arizona, Tucson, AZ 85721, United States;Department of Management Information Systems, The University of Arizona, Tucson, AZ 85721, United States

  • Venue:
  • Decision Support Systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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 Naive 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.