Skip to main content

SWARM: An Approach for Mining Semantic Association Rules from Semantic Web Data

  • Conference paper
  • First Online:
PRICAI 2016: Trends in Artificial Intelligence (PRICAI 2016)

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

Included in the following conference series:

Abstract

The ever growing amount of Semantic Web data has made it increasingly difficult to analyse the information required by the users. Association rule mining is one of the most useful techniques for discovering frequent patterns among RDF triples. In this context, some statistical methods strongly rely on the user intervention that is time-consuming and error-prone due to a large amount of data. In these studies, the rule quality factors (e.g. Support and Confidence measures) consider only knowledge in the instance-level data. However, Semantic Web data contains knowledge in both instance-level and schema-level. In this paper, we introduce an approach called SWARM (Semantic Web Association Rule Mining) to automatically mine Semantic Association Rules from RDF data. We discuss how to utilize knowledge encode in the schema-level to enrich the semantics of rules. We also show that our approach is able to reveal common behavioral patterns associated with knowledge in the instance-level and schema-level. The proposed rule quality factors (Support and Confidence) consider knowledge not only in the instance-level but also schema-level. Experiments performed on the DBpedia Dataset (3.8) demonstrate the usefulness of the proposed approach.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://freebase.com.

  2. 2.

    http://dbpedia.org/page/George_Harrison.

  3. 3.

    http://dbpedia.org/page/John_Lennon.

  4. 4.

    http://wiki.dbpedia.org/services-resources/datasets/data-set-38/downloads-38/.

References

  1. Bizer, C., Heath, T., Berners-Lee, T.: Linked data-the story so far. Int. J. Semant. Web Inf. Syst. 5(3), 1–22 (2009)

    Article  Google Scholar 

  2. Kabir, S., Ripon, S., Rahman, M., Rahman, T.: Knowledge-based data mining using semantic web. IERI Procedia 7, 113–119 (2014)

    Article  Google Scholar 

  3. Galárraga, L.A., Teflioudi, C., Hose, K., Suchanek, F.: AMIE: association rule mining under incomplete evidence in ontological knowledge bases. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 413–422. International World WideWeb Conferences Steering Committee (2013)

    Google Scholar 

  4. Galárraga, L., Teflioudi, C., Hose, K., Suchanek, F.M.: Fast rule mining in ontological knowledge bases with AMIE+. VLDB J. 24(6), 707–730 (2015)

    Article  Google Scholar 

  5. Abedjan, Z., Naumann, F.: Improving rdf data through association rule mining. Datenbank-Spektrum 13(2), 111–120 (2013)

    Article  Google Scholar 

  6. Muggleton, S.: Inverse entailment and progol. New Gener. Comput. 13(3–4), 245–286 (1995)

    Article  Google Scholar 

  7. Goethals, B., Van den Bussche, J.: Relational association rules: getting WARM ER. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol. 2447, pp. 125–139. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Yang, B., Yih, W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575 (2014)

  9. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In ACM SIGMOD Record, vol. 22, no. 2. ACM, pp. 207–216 (1993)

    Google Scholar 

  10. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Disc. 15(1), 55–86 (2007)

    Article  MathSciNet  Google Scholar 

  11. Nebot, V., Berlanga, R.: Finding association rules in semantic web data. Knowl. Based Syst. 25(1), 51–62 (2012)

    Article  Google Scholar 

  12. Abedjan, Z., Naumann, F.: Amending RDF entities with new facts. In: Presutti, V., Blomqvist, E., Troncy, R., Sack, H., Papadakis, I., Tordai, A. (eds.) ESWC Satellite Events 2014. LNCS, vol. 8798, pp. 131–143. Springer, Heidelberg (2014)

    Google Scholar 

  13. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Record, vol. 29, no. 2, pp. 1–12. ACM (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Molood Barati or Quan Bai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Barati, M., Bai, Q., Liu, Q. (2016). SWARM: An Approach for Mining Semantic Association Rules from Semantic Web Data. In: Booth, R., Zhang, ML. (eds) PRICAI 2016: Trends in Artificial Intelligence. PRICAI 2016. Lecture Notes in Computer Science(), vol 9810. Springer, Cham. https://doi.org/10.1007/978-3-319-42911-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-42911-3_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-42910-6

  • Online ISBN: 978-3-319-42911-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics