Skip to main content

An Extendable Meta-learning Algorithm for Ontology Mapping

  • Conference paper
Flexible Query Answering Systems (FQAS 2009)

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

Included in the following conference series:

Abstract

In this paper, we describe a machine learning approach to ontology mapping. Although Machine learning techniques have been used earlier in many semantic integration approaches, dependence on precision recall curves to preset the weights and thresholds of the learning systems has been a serious bottleneck. By recasting the mapping problem to a classification problem we try to automate this step and develop a robust and extendable meta learning algorithm. The implication is that we can now extend the same method to map the ontology pairs with different similarity measures which might not be specialized for the specific domain, yet obtain results comparable to the state of the art mapping algorithms that exploit machine learning methods. Interestingly we see that as the similarity measures are diluted, our approach performs significantly better for unbalanced classes. We have tested our approach using several similarity measures and two real world ontologies, and the test results we discuss validate our claim. We also present a discussion on the benefits of the proposed meta learning algorithm.

The research reported in this article was supported in part by National Science Foundation grants IIS SEIII 0612203, and CNS 0521454.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. http://www.w3.org/TR/owl-features/

  2. Inria ontology, http://fr.inrialpes.exmo.rdf.bib.owl

  3. Karlsruhe ontology, http://www.aifb.unikarlsruhe.de/ontology

  4. Cohen, W., Ravikumar, P., Fienberg, S.E.: A comparison of string metrics for matching names and records. In: KDD (2003)

    Google Scholar 

  5. Doan, A., Madhavan, J., Dhamankar, R., Domingos, P., Halevy, A.: Learning to match ontologies on the semantic web. VLDB Journal (2003)

    Google Scholar 

  6. Domingos, P., Pazzani, M.: Beyond independence: Conditions for the optimality of the simple bayesian classifier. In: ICML, pp. 105–112 (1996)

    Google Scholar 

  7. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley Interscience Publication, Hoboken (2000)

    Google Scholar 

  8. Jaro, M.A.: Probabilistic linkage of large public health data file. Statistics in Medicine 14, 491–498 (1995)

    Article  Google Scholar 

  9. Jiang, L., Wang, D., Cai, Z., Yan, X.: Survey of improving naive bayes for classification. In: Alhajj, R., Gao, H., Li, X., Li, J., Zaïane, O.R. (eds.) ADMA 2007. LNCS (LNAI), vol. 4632, pp. 134–145. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Kalyanpur, A., Parsia, B., Sirin, E., Cuenca-Grau, B., Hendler, J.: Swoop: A web ontology editing browser. Journal of Web Semantics 4(2) (2005)

    Google Scholar 

  11. Keogh, E., Pazzani, M.: Learning augmented bayesian classifiers: A comparison of distribution-based and classification-based approaches. In: International Workshop on Artificial Intelligence and Statistics, pp. 225–230 (1999)

    Google Scholar 

  12. Levenshtein, V.I.: Binary codes capable of correcting insertions and reversals. Soviet Physics Doklady 10(8), 707–710 (1966)

    MathSciNet  Google Scholar 

  13. Monge, A., Elkan, C.: The field matching problem: Algorithms and applications. In: KDD (1996)

    Google Scholar 

  14. Ng, A.Y., Jordan, M.I.: On discriminative vs. generative classifiers: A comparison of logistic regression and naive bayes. In: NIPS, pp. 841–848 (2001)

    Google Scholar 

  15. Shvaiko, P., Euzenat, J.: A survey of schema-based matching approaches (2005)

    Google Scholar 

  16. Sirin, E., Parsia, B., Grau, B.C., Kalyanpur, A., Katz, Y.: Pellet: A practical owl-dl reasoner. Journal of Web Semantics (2007)

    Google Scholar 

  17. Udrea, O., Getoor, L., Miller, R.J.: Leveraging data and structure for ontology integration. In: SIGMOD (2007)

    Google Scholar 

  18. Wang, Z., Webb, G.I.: Comparison of lazy bayesian rule and tree-augmented bayesian learning. In: ICDM, Maebashi, Japan, pp. 775–778 (2002)

    Google Scholar 

  19. Webb, G.I., Boughton, J., Wang, Z.: Not so naive bayes: Aggregating one-dependence estimators. Machine Learning 58(1), 5–24 (2005)

    Article  MATH  Google Scholar 

  20. Zheng, Z., Webb, G.I.: Lazy learning of bayesian rules. Machine Learning 4(1), 53–84 (2000)

    Article  Google Scholar 

  21. Zheng, Z., Webb, G.I., Ting, K.M.: Lazy bayesian rules: A lazy semi-naive bayesian learning technique competitive to boosting decision trees. In: ICML, pp. 493–502. Morgan Kaufmann, San Francisco (1999)

    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

Shahri, S.H., Jamil, H. (2009). An Extendable Meta-learning Algorithm for Ontology Mapping. In: Andreasen, T., Yager, R.R., Bulskov, H., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2009. Lecture Notes in Computer Science(), vol 5822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04957-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04957-6_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04956-9

  • Online ISBN: 978-3-642-04957-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics