Abstract
Recently, inductive databases (IDBs) have been proposed to tackle the problem of knowledge discovery from huge databases. With an IDB, the user/analyst performs a set of very different operations on data using a query language, powerful enough to support all the required manipulations, such as data preprocessing, pattern discovery and pattern post-processing. We provide a comparison between three query languages (MSQL, DMQL and MINE RULE) that have been proposed for descriptive rule mining and discuss their common features and differences. These query languages look like extensions of SQL. We present them using a set of examples, taken from the real practice of rule mining. In the paper we discuss also OLE DB for Data Mining and Predictive Model Markup Language, two recent proposals that like the first three query languages respectively provide native support to data mining primitives and provide a description in a standard language of statistical and data mining models.
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
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000)
Boulicaut, J.-F., Bykowski, A.: Frequent closures as a concise representation for binary data mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 62–73. Springer, Heidelberg (2000)
Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery 7(1), 5–22 (2003)
Giacometti, A., Laurent, D., Diop, C.T.: Condensed representations for sets of mining queries. In: Proc. KDID 2002, Helsinki (FIN) (2002), An extended version appears in this volume
Imielinski, T., Mannila, H.: A Database Perspective on Knowledge Discovery. Communications of the ACM 3(4), 58–64 (1996)
Imielinski, T., Virmani, A., Abdulghani, A.: DataMine: Application Programming Interface and Query Language for Database Mining. In: Proc. KDD 1996, Portland (USA), pp. 256–261. AAAI Press, Menlo Park (1996)
Imielinski, T., Virmani, A.: MSQL: A Query Language for Database Mining. Data Mining and Knowledge Discovery 3(4), 373–408 (1999)
Jeudy, B., Boulicaut, J.-F.: Optimization of association rule mining queries. Intelligent Data Analysis 6(4), 341–357 (2002)
Jeudy, B., Boulicaut, J.-F.: Using condensed representations for interactive association rule mining. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 225–236. Springer, Heidelberg (2002)
Han, J., Fu, Y., Wang, W., Koperski, K., Zaiane, O.: DMQL: A Data Mining Query Language for Relational Databases. In: Proc. of SIGMOD Workshop DMKD 1996, Montreal (Canada), pp. 27–34 (1996)
Han, J., Kamber, M.: Data Mining – Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2001)
Meo, R., Psaila, G., Ceri, S.: A New SQL-like Operator for Mining Association Rules. In: Proc. VLDB 1996, Bombay (India), pp. 122–133. Morgan Kaufmann, San Francisco (1996)
Meo, R., Psaila, G., Ceri, S.: An Extension to SQL for Mining Association Rules. Data Mining and Knowledge Discovery 2(2), 195–224 (1998)
Virmani, A.: Second Generation Data Mining. PhD Thesis, Rutgers University (1998)
Zaki, M.J.: Generating non-redundant association rules. In: Proc. SIGKDD 2000, Boston (USA), pp. 34–43. ACM Press, New York (2000)
Netz, A., Chaudhuri, S., Fayyad, U., Bernhardt, J.: Integrating Data Mining with SQL Databases: OLE DB for Data Mining. In: Proc ICDE 2001, Heidelberg (Germany), pp. 379–387. IEEE Computer Society, Los Alamitos (2001)
OLEDB for Data Mining specifications, Available at: http://www.microsoft.com/data/oledb/dm
Predictive Model Mark-up Language, Available at: http://www.dmg.org/pmml-v2-0.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Botta, M., Boulicaut, JF., Masson, C., Meo, R. (2004). Query Languages Supporting Descriptive Rule Mining: A Comparative Study. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds) Database Support for Data Mining Applications. Lecture Notes in Computer Science(), vol 2682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44497-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-44497-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22479-2
Online ISBN: 978-3-540-44497-8
eBook Packages: Springer Book Archive