Affiliation:
1. Politecnico di Milano, Italy
Abstract
In this work we describe the TreeRuler tool, which makes it possible for inexperienced users to access huge XML (or relational) datasets. TreeRuler encompasses two main features: (1) it mines all the frequent association rules from input documents without any a-priori specification of the desired results, and (2) it provides quick, summarized, thus often approximate answers to user’s queries, by using the previously mined knowledge. TreeRuler has been developed in the scenario of the Odyssey EU project dealing with information about crimes, both for the relational and XML data model. In this chapter we mainly focus on the objectives, strategies, and difficulties encountered in the XML context.
Reference32 articles.
1. Agrawal, R., Imieliński, T., & Swami, A. N. (1993). Mining association rules between sets of items in large databases. In P. Buneman, & S. Jajodia (Eds.), Proceedings of the ACM SIGMOD International Conference on Management of Data, (pp. 207-216). ACM.
2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, & C. Zaniolo (Eds.), Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), (pp. 487-499). Morgan Kaufmann.
3. Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. Proceedings of the 11th International Conference on Data Engineering (ICDE), (pp. 3-14). IEEE Computer Society.
4. Berzal, F., Jiménez, A., & Cubero, J. C. (2008). Mining induced and embedded subtrees in ordered, unordered, and partially-ordered trees. In Proceedings of the 17th International Symposium on Methodologies for Intelligent Systems, (pp. 111-120).
5. Boncz, P., Grust, T., van Keulen, M., Manegold, S., Rittinger, J., & Teubner, J. (2006). MonetDB/XQuery: A fast XQuery processor powered by a relational engine. In Proceedings of the 2006 ACM International Conference on Management of Data (SIGMOD), (pp. 479-490). ACM.