Abstract
In this paper, we propose to investigate the notion of integrity constraints in inductive databases. We advocate that integrity constraints can be used in this context as an abstract concept to encompass common data mining tasks such as the detection of corrupted data or of patterns that contradict the expert beliefs. To illustrate this possibility we propose a form of constraints called association map constraints to specify authorized confidence variations among the association rules. These constraints are easy to read and thus can be used to write clear specifications. We also present experiments showing that their satisfaction can be tested in practice.
This research is partially funded by the European Commission IST Programme – Accompanying Measures, AEGIS project (IST-2000-26450).
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, May 1993, pp. 207–216. ACM Press, Washington, D.C., USA (1993)
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press, Menlo Park (1996)
Bayardo, R., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. In: Proceedings ICDE 1999, Sydney, Australia, March 1999, pp. 188–197 (1999)
Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 85–93. ACM Press, New York (1998)
Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by mean of free-sets. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 75–85. Springer, Heidelberg (2000)
Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Journal of Data Mining and Knowledge Discovery 7(1), 5–22 (2003)
Boulicaut, J.-F., Klemettinen, M., Mannila, H.: Querying inductive databases: A case study on the MINE RULE operator. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 194–202. Springer, Heidelberg (1998)
Bykowski, A., Rigotti, C.: A condensed representation to find frequent patterns. In: Proc. of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2001), Santa Barbara, CA, USA, May 2001, pp. 267–273. ACM, New York (2001)
Bykowski, A., Rigotti, C.: Disjunction-bordered condensed representation of frequent patterns. Information Systems (to appear)
Dehaspe, L., Toivonen, H.: Discovery of frequent datalog patterns. Journal of Data Mining and Knowledge Discovery 3(1), 7–36 (1999)
Hipp, J., Güntzer, U., Nakhaeizadeh, G.: Algorithms for association rule mining – a general survey and comparison. SIGKDD Explorations 2(1), 58–64 (2000)
Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM 39(11), 58–64 (1996)
Liu, B., Hsu, W., Ma, Y.: Pruning and summarizing the discovered associations. In: Proc. of the Fifth Int. Conference on Knowledge Discovery and Data Mining (KDD 1999), San Diego, CA, USA, August 1999, pp. 125–134 (1999)
Mannila, H.: Inductive databases and condensed representations for data mining. In: Proc. ILPS 1997, Port Jefferson, USA, pp. 21–30. MIT Press, Cambridge (1997)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24(1), 25–46 (1999)
Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229–248. AAAI Press, Menlo Park (1991)
Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: Proc. VLDB 1995, Zurich, Switzerland, September 1995, pp. 432–444. Morgan Kaufmann, San Francisco (1995)
Silberschatz, A., Tuzhilin, A.: On subjective measures of interestingness in knowledge discovery. In: Proc. of the First Int. Conference on Knowledge Discovery and Data Mining (KDD 1995), Montreal, Canada, August 1995, pp. 275–281 (1995)
Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: Proc. ACM SIGMOD 1996, Montreal, Quebec, Canada, June 1996, pp. 1–12. ACM Press, New York (1996)
Ullman, J.: Database and Knowledge-Base Systems, vol. II. Computer Science Press, Rockville, MD (1989)
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
Bykowski, A., Daurel, T., Méger, N., Rigotti, C. (2004). Integrity Constraints over Association Rules. 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_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-44497-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22479-2
Online ISBN: 978-3-540-44497-8
eBook Packages: Springer Book Archive