Summary
Resource description framework (RDF) is becoming a popular encoding language for describing and interchanging metadata of web resources. In this paper, we propose an Apriori-based algorithm for mining association rules (AR) from RDF documents. We treat relations (RDF statements) as items in traditional AR mining to mine associations among relations. The algorithm further makes use of a domain ontology to provide generalization of relations. To obtain compact rule sets, we present a generalized pruning method for removing uninteresting rules. We illustrate a potential usage of AR mining on RDF documents for detecting patterns of terrorist activities. Experiments conducted based on a synthetic set of terrorist events have shown that the proposed methods were able to derive a reasonably small set of association rules capturing the key underlying associations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., T. Imielinski and A. Swami, 1993: Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data, 207–16.
Agrawal, R., and R. Srikant, 1994: Fast algorithms for mining association rules. Proceedings of the 20th International Conference in Very Large Databases, 487–99.
Braga, D., A. Campi, S. Ceri, M. Klemettinen and P.L. Lanzi, 2003: Discovering interesting information in XML data with association rules. Proceedings of ACM Symposium on Applied Computing, 450–4.
Buchner, A. G., M. Baumgarten, M. D. Mulvenna, R. Bohm and S. S. Anand, 2000: Data mining and XML: Current and future issues. Proceedings of International Conference on Web Information Systems Engineering 2000 IEEE, II, 131–5.
Cherif Latiri, Ch. and S. Ben Yahia, 2001: Generating implicit association rules from textual data. Proceedings of ACS/IEEE International Conference on Computer Systems and Applications, 137–43.
Ding, L., K. Wilkinson, C. Sayer and H. Kuno, 2003: Application-specific schema design for storing large RDF datasets. First International Workshop on Practical and Scalable Semantic Systems.
Ding, Q., K. Ricords and J. Lumpkin, 2003: Deriving general association rules from XML data. Proceedings of International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/ Distributed Computing, 348–52.
Dorre, J., P. Gerstl and R. Seiffert, 1999: Text mining: Finding nuggets in mountains of textual data. Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 398–401.
Han, J., and Y. Fu, 1995: Discovery of multi-level association rules from large databases. Proceedings of the 21st International Conference in Very Large Databases, 420–31.
Han, J., J. Pei and Y. Yin, 2000: Mining frequent patterns without candidate generation. Proceedings of the 2000 ACM-SIGMOD International Conference on Management of Data, 1–12.
Hilderman, R., J., and H. J. Hamilton, 1999: Knowledge discovery and interestingness measures: A survey. Technical Report CS 99-04, Department of Computer Science, University of Regina.
Hipp, J., U. Guntzer and G. Nakaeizadeh, 2000: Algorithms for association rule mining: A general survey and comparison. ACM SIGKDD Explorations, 2(1), 58–64.
Kodratoff, Y., 2001: Rating the interest of rules induced from data and within texts. Proceedings of Database and Expert Systems Applications 12th International Conference, 265–9.
Lee, J.-W., K. Lee and W. Kim, 2001: Preparations for semantics-based XML mining. Proceedings of 1st IEEE International Conference on Data Mining, 345–52.
Maedche, A., and V. Zacharias, 2002: Clustering ontology-based metadata in the semantic web. Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases, 342–60.
Pasquier, N., Y. Bastide, R. Taouil and L. Lakhal, 1998: Pruning closed itemset lattices for association rules. Proceedings of the BDA French Conference on Advanced Databases, 177–96.
Srikant, R., and R. Agrawal, 1995: Mining generalized association rules. Proceedings of the 21st International Conference in Very Large Databases, 407–19.
Tan, A.-H., 1999: Text mining: The state of the art and the challenges. Proceedings of the Pacific Asia Conference on Knowledge Discovery and Data Mining PAKDD’99 workshop on Knowledge Discovery from Advanced Databases, 65–70.
W3C, RDF Specification. URL: www.w3.org/RDF/.
W3C, RDF Schema Specification. URL: www.w3.org/TR/rdf-schema/.
XML DOM Tutorial. URL: www.w3schools.com/dom/default.asp.
Rights and permissions
Copyright information
© 2005 Dr Sanghamitra Bandyopadhyay
About this chapter
Cite this chapter
Jiang, T., Tan, AH. (2005). Ontology-Assisted Mining of RDF Documents. In: Advanced Methods for Knowledge Discovery from Complex Data. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/1-84628-284-5_9
Download citation
DOI: https://doi.org/10.1007/1-84628-284-5_9
Publisher Name: Springer, London
Print ISBN: 978-1-85233-989-0
Online ISBN: 978-1-84628-284-3
eBook Packages: Computer ScienceComputer Science (R0)