A probabilistic model for approximate identity matching

G. Alan Wang, Hsinchun Chen, Homa Atabakhsh

Research output: Contribution to conferencePaperpeer-review


Identity management is critical to various governmental practices ranging from providing citizens services to enforcing homeland security. The task of searching for a specific identity is difficult because multiple identity representations may exist due to issues related to unintentional errors and intentional deception. We propose a probabilistic Naïve Bayes model that improves existing identity matching techniques in terms of effectiveness. Experiments show that our proposed model performs significantly better than the exact-match based technique as well as the approximate-match based record comparison algorithm. In addition, our model greatly reduces the efforts of manually labeling training instances by employing a semi-supervised learning approach. This training method outperforms both fully supervised and unsupervised learning. With a training dataset that only contains 10% labeled instances, our model achieves a performance comparable to that of a fully supervised learning.

Original languageEnglish (US)
Number of pages2
StatePublished - 2006
Externally publishedYes
Event7th Annual International Conference on Digital Government Research, Dg.o 2006 - San Diego, CA, United States
Duration: May 21 2006May 24 2006


Other7th Annual International Conference on Digital Government Research, Dg.o 2006
Country/TerritoryUnited States
CitySan Diego, CA


  • Identity matching
  • Naïve Bayes model
  • Semi-supervised learning

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications


Dive into the research topics of 'A probabilistic model for approximate identity matching'. Together they form a unique fingerprint.

Cite this