Skip to main content

Latent Topic Extraction from Relational Table for Record Matching

  • Conference paper
Discovery Science (DS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5808))

Included in the following conference series:

Abstract

We propose a latent feature extraction method for record linkage. We first introduce a probabilistic model that generates records with their latent topics. The proposed generative model is designed to utilize the co-occurrence among the attributes of the record. Then, we derive a topic estimation algorithm using the Gibbs sampling technique. The estimated topics are used to identify records. The proposed algorithm works in an unsupervised way; i.e., we do not need to prepare labor-intensive training data. We evaluated the proposed model using bibliographic records and proved that the proposed method tended to perform better for records with more attributes by utilizing their co-occurrence.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhattacharya, L., Getoor, L.: A Latent Dirichlet Model for Unsupervised Entity Resolution. In: SIAM Intl. Conf. on Data Mining (2006)

    Google Scholar 

  2. Bilenko, M., Mooney, R.J.: Adaptive Duplicate Detection Using Learnable String Similarity Measures. In: International Conference on Knowledge Discovery and Data Mining, pp. 39–48 (2003)

    Google Scholar 

  3. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. Journal of Machine Learning Research 3, 993–1022 (2003)

    MATH  Google Scholar 

  4. Bollegara, D., Matsuo, Y., Ishizuka, M.: Extracting key phrases to disambiguate personal name queries in web search. In: Coling-ACL Workshop on How Can Computational Liguistics Improve Information Retrieval (2006)

    Google Scholar 

  5. Cohen, W., Ravikumar, P., Fienberg, S.: A Comparison of String Distance Metrics for Name-matching Tasks. In: IIWeb 2003, pp. 73–78 (2003)

    Google Scholar 

  6. Fleischman, M., Hovy, E.: Multi-document Person Name Resolution. In: ACL Workshop on Reference Resolution (2004)

    Google Scholar 

  7. Griffiths, T.L., Steyvers, M.: Finding scientific topics. In: Proc. of the National Academy of Sciences, vol. 101 (suppl. 1), pp. 5228–5235 (2004)

    Google Scholar 

  8. Shu, L., Long, B., Meng, W.: A latent topic model for complete entity resolution. In: Intl. Conf. on Data Engineering, pp. 880–891 (2009)

    Google Scholar 

  9. Song, Y., Huang, J., Councill, I.G., Li, J., Giles, C.L.: Efficient topic-based unsupervised name disambiguation. In: Joint Conference on Digital Libraries, pp. 342–351 (2007)

    Google Scholar 

  10. Wang, X., Mohanty, N., McCallum, A.: Group and topic discovery from relations and text. In: Proc. of 3rd International Workshop on Link Discovery (LinkKDD), pp. 28–35 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Takasu, A., Fukagawa, D., Akutsu, T. (2009). Latent Topic Extraction from Relational Table for Record Matching. In: Gama, J., Costa, V.S., Jorge, A.M., Brazdil, P.B. (eds) Discovery Science. DS 2009. Lecture Notes in Computer Science(), vol 5808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04747-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04747-3_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04746-6

  • Online ISBN: 978-3-642-04747-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics