Mining Hypotheses from Data in OWL: Advanced Evaluation and Complete Construction-Reference-Cited by-同舟云学术

Mining Hypotheses from Data in OWL: Advanced Evaluation and Complete Construction

Published:2017 Issue: Volume: Page:577-593
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Sazonau Viachaslau,Sattler Uli

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-68288-4_34

Reference23 articles.

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487–499. Morgan Kaufmann, Santiago de Chile, September 1994

2. Lecture Notes in Computer Science;T Alsubait,2014

3. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications, 2nd edn. Cambridge University Press, New York (2010)

4. Baader, F., Sertkaya, B., Turhan, A.: Computing the least common subsumer w.r.t. a background terminology. J. Appl. Logic 5(3), 392–420 (2007)

5. Cohen, W.W., Hirsh, H.: Learning the CLASSIC description logic: theoretical and experimental results. In: Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR 1994), pp. 121–133. Morgan Kaufmann, Bonn, May 1994

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning multiple concepts in description logic through three perspectives;The Knowledge Engineering Review;2021

2. Learning Description Logic Ontologies: Five Approaches. Where Do They Stand?;KI - Künstliche Intelligenz;2020-04-22

3. On the Complexity of Learning Description Logic Ontologies;Reasoning Web. Declarative Artificial Intelligence;2020

4. Rule Induction and Reasoning over Knowledge Graphs;Lecture Notes in Computer Science;2018