Context and target configurations for mining RDF data

Association rule mining has been widely studied in the context of basket analysis and sale recommendations [1]. In fact, the concept can be applied to any domain with many items or events in which interesting relationships can be inferred from co-occurrence of those items or events in existing subsets (transactions). The increasing amount of Linked Open Data (LOD) in the World Wide Web raises new opportunities and challenges for the data mining community [5]. LOD is often represented in the Resource Description Framework (RDF) data model. In RDF, data is represented by a triple structure consisting of subject, predicate, and object (SPO). Each triple represents a statement/fact. We propose an approach that applies association rule mining at statement level by introducing the concept of mining configurations.

[1]  Tom Heath,et al.  Linked Data: Evolving the Web into a Global Data Space , 2011, Linked Data.

[2]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[3]  Jens Lehmann,et al.  DBpedia - A crystallization point for the Web of Data , 2009, J. Web Semant..

[4]  Yun Chi,et al.  Frequent Subtree Mining - An Overview , 2004, Fundam. Informaticae.

[5]  Felix Naumann,et al.  Profiling linked open data with ProLOD , 2010, 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010).

[6]  Agnieszka Lawrynowicz,et al.  The role of semantics in mining frequent patterns from knowledge bases in description logics with rules , 2010, Theory and Practice of Logic Programming.

[7]  Rafael Berlanga Llavori,et al.  Mining Association Rules from Semantic Web Data , 2010, IEA/AIE.

[8]  Tim Berners-Lee,et al.  Linked data , 2020, Semantic Web for the Working Ontologist.