Skip to main content

Implementing Inductive Concept Learning For Cooperative Query Answering

  • Conference paper
  • First Online:
Data Analysis, Machine Learning and Knowledge Discovery

Abstract

Generalization operators have long been studied in the area of Conceptual Inductive Learning (Michalski, A theory and methodolgy of inductive learning. In: Machine learning: An artificial intelligence approach (pp. 111–161). TIOGA Publishing, 1983; De Raedt, About knowledge and inference in logical and relational learning. In: Advances in machine learning II (pp. 143–153). Springer, Berlin, 2010). We present an implementation of these learning operators in a prototype system for cooperative query answering. The implementation can however also be used as a usual concept learning mechanism for concepts described in first-order predicate logic. We sketch an extension of the generalization process by a ranking mechanism on answers for the case that some answers are not related to what user asked.

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 EPUB and 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

Notes

  1. 1.

    http://visualvm.java.net/

References

  • De Raedt, L. (2010). About knowledge and inference in logical and relational learning. In Advances in Machine Learning II (pp. 143–153). Berlin: Springer.

    Chapter  Google Scholar 

  • Gaasterland, T., Godfrey, P., & Minker, J. (1992). Relaxation as a platform for cooperative answering. Journal of Intelligent Information Systems, 1(3/4), 293–321.

    Article  Google Scholar 

  • Inoue, K., & Wiese, L. (2011). Generalizing conjunctive queries for informative answers. In 9th International Conference on Flexible Query Answering Systems. Lecture notes in artificial intelligence (Vol. 7022, pp. 1–12). New York: Springer.

    Google Scholar 

  • Michalski, R. S. (1983). A theory and methodolgy of inductive learning. In Machine learning: An artificial intelligence approach (pp. 111–161). TIOGA Publishing.

    Google Scholar 

  • Muslea, I. (2004). Machine learning for online query relaxation. In Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 246–255). New York: ACM.

    Google Scholar 

  • Nikitina, N., Rudolph, S., & Glimm, B. (2012). Interactive ontology revision. Journal of Web Semantics, 12, 118–130.

    Article  Google Scholar 

  • Shin, M. K., Huh, S.-Y., & Lee, W. (2007). Providing ranked cooperative query answers using the metricized knowledge abstraction hierarchy. Expert Systems with Applications, 32(2), 469–484.

    Article  Google Scholar 

  • Wu, Z., & Palmer, M. (1994). Verb semantics and Lexical selection. In 32nd Annual Meeting of the Association for Computational Linguistics (pp. 133–138). Los Altos: Morgan Kaufmann Publishers.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maheen Bakhtyar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bakhtyar, M., Dang, N., Inoue, K., Wiese, L. (2014). Implementing Inductive Concept Learning For Cooperative Query Answering. In: Spiliopoulou, M., Schmidt-Thieme, L., Janning, R. (eds) Data Analysis, Machine Learning and Knowledge Discovery. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Cham. https://doi.org/10.1007/978-3-319-01595-8_14

Download citation

Publish with us

Policies and ethics