Skip to main content

RDF Semantics for Web Association Rules

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6902))

Abstract

We present a vocabulary expansion of RDFS, which admits the assertion of rules that hold on associations among sets of RDFS classes, and we give an actual-world semantics to statements in the language expansion that properly captures the meaning commonly given to association rules w.r.t. context, support and confidence, while interacting with class subsumptions and instance typing. In addition, we exhibit a sound and complete procedure for the association rule entailment problem.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brickley, D., Guha, R. (eds.): RDF Vocabulary Description Language 1.0: RDF Schema, W3C Recommendation (2004), http://www.w3.org/TR/rdf-schema

  2. d’Amato, C., Fanizzi, N., Lukasiewicz, T.: Tractable Reasoning with Bayesian Description Logics. In: Greco, S., Lukasiewicz, T. (eds.) SUM 2008. LNCS (LNAI), vol. 5291, pp. 146–159. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. de Bruijn, J., Heymans, S.: Logical Foundations of RDF(S) with Datatypes. Journal of Artificial Intelligence Research 38, 535–568 (2010)

    MATH  Google Scholar 

  4. Hanson, W.: Actuality, Necessity, and Logical Truth. Philosophical Studies 130(3), 437–459 (2006)

    Article  Google Scholar 

  5. Hayes, P. (ed.): RDF Semantics, W3C Recommendation (2004), http://www.w3.org/TR/rdf-mt/

  6. Józefowska, J., Lawrynowicz, A., Lukaszewski, T.: The role of semantics in mining frequent patterns from knowledge bases in description logics with rules. TPLP 10(3), 251–289 (2010)

    MATH  Google Scholar 

  7. Lassila, O., Swick R. (eds.): Resource description framework (RDF) model and syntax specification, W3C Recommendation (1999), http://www.w3.org/TR/REC-rdf-syntax

  8. Lisi, F.: Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming. TPLP 8(3), 271–300 (2008)

    MATH  Google Scholar 

  9. Muñoz, S., Pérez, J., Gutierrez, C.: Minimal Deductive Systems for RDF. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 53–67. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Pasquier, N.: Mining Association Rules using Formal Concept Analysis. In: Stumme, G. (ed.) Contributions to ICCS 2000, Working with Conceptual Structures, pp. 259–264. Verlag Shaker, Aachen (2000)

    Google Scholar 

  11. Udrea, O., Subrahmanian, V., Majkic, Z.: Probabilistic RDF. In: IEEE International Conference on Information Reuse and Integration, pp. 172–177 (2006)

    Google Scholar 

  12. Zaki, M., Ogihara, M.: Theoretical Foundations of Association Rules. In: 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 71–78 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minuto Espil, M. (2011). RDF Semantics for Web Association Rules. In: Rudolph, S., Gutierrez, C. (eds) Web Reasoning and Rule Systems. RR 2011. Lecture Notes in Computer Science, vol 6902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23580-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23580-1_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23579-5

  • Online ISBN: 978-3-642-23580-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics