Abstract
One of the most important features of any database system is that it supports queries. For example, in relational databases one can construct new tables from the stored tables using relational algebra. For an inductive database, it is reasonable to assume that the stored tables have been modelled. The problem we study in this chapter is: do the models available on the stored tables help to model the table constructed by a query? To focus the discussion, we concentrate on one type of modelling, i.e., computing frequent item sets. This chapter is based on results reported in two earlier papers [12, 13]. Unifying the approaches advocated by those papers as well as comparing them is the main contribution of this chapter.
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
Rakesh Agrawal, Heikki Mannila, Ramakrishnan Srikant, Hannu Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307–328. AAAI, 1996.
Andrea Asperti and Giuseppe Longo. Categories, Types, and Structures. MIT Press, 1991.
P.J. Bickel, E.A. Hammel, and J.W. O’Connell. Sex bias in graduate admissions: Data from berkeley. Science, 187(4175):398–404, 1975.
Rudi Cilibrasi and Paul Vitanyi. Automatic meaning discovery using google. In IEEE Transactions on Knowledge and Data Engineering, volume 19, pages 370–383. 2007.
E.F. Codd. A relational model of data for large shared data banks. Communications of the ACM, 13(6):377–387, 1970.
Frans Coenen. The LUCS-KDD discretised/normalised ARM and CARM data library: http://www.csc.liv.ac.uk/˜frans/KDD/Software/LUCS KDD DN/. 2003.
T.M. Cover and J.A. Thomas. Elements of Information Theory, 2nd ed. John Wiley and Sons, 2006.
C. Faloutsos and V. Megalooikonomou. On data mining, compression and kolmogorov complexity. In Data Mining and Knowledge Discovery, volume 15, pages 3–20. Springer Verlag, 2007.
Usama M. Fayyad, Gregory Piatetsky-Shapiro, and Padhraic Smyth. From data mining to knowledge discovery: An overview. 1996.
Peter D. Grünwald. Minimum description length tutorial. In P.D. Grünwald and I.J. Myung, editors, Advances in Minimum Description Length. MIT Press, 2005.
Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD conference, 1998.
Arno Siebes. Data mining in inductive databases. In Francesco Bonchi and Jean-François Boulicaut, editors, Knowledge Discovery in Inductive Databases, 4th International Workshop, KDID 2005, Revised Selected and Invited Papers, volume 3933 of Lecture Notes in Computer Science, pages 1–23.Springer, 2005.
Arno Siebes and Diyah Puspitaningrum. Mining databases to mine queries faster. In Wray L. Buntine, Marko Grobelnik, Dunja Mladenic, and John Shawe-Taylor, editors, Proceedings ECML PKDD 2009, Part II, volume 5782 of Lecture Notes in Computer Science, pages 382–397. Springer, 2009.
Arno Siebes, Jilles Vreeken, and Matthijs vanLeeuwen. Item sets that compress. In Proceedings of the SIAM Conference on Data Mining, pages 393–404, 2006.
Jilles Vreeken, Matthijs vanLeeuwen, and Arno Siebes. Preserving privacy through data generation. In Proceedings of the IEEE International Conference on Data Mining, pages 685–690, 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Siebes, A., Puspitaningrum, D. (2010). Patterns on Queries. In: Džeroski, S., Goethals, B., Panov, P. (eds) Inductive Databases and Constraint-Based Data Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7738-0_13
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7738-0_13
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7737-3
Online ISBN: 978-1-4419-7738-0
eBook Packages: Computer ScienceComputer Science (R0)