{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:08:39Z","timestamp":1742987319120,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540224792"},{"type":"electronic","value":"9783540444978"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-44497-8_16","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T20:08:07Z","timestamp":1267128487000},"page":"306-323","source":"Crossref","is-referenced-by-count":2,"title":["Integrity Constraints over Association Rules"],"prefix":"10.1007","author":[{"given":"Artur","family":"Bykowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Daurel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"M\u00e9ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Rigotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1993","unstructured":"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\u2013216. ACM Press, Washington, D.C., USA (1993)"},{"key":"16_CR3","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"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\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. In: Proceedings ICDE 1999, Sydney, Australia, March 1999, pp. 188\u2013197 (1999)","DOI":"10.1109\/ICDE.1999.754924"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/276304.276313","volume-title":"Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data","author":"R.J. Bayardo","year":"1998","unstructured":"Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 85\u201393. ACM Press, New York (1998)"},{"key":"16_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45372-5_8","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J.-F. Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by mean of free-sets. In: Zighed, A.D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 75\u201385. Springer, Heidelberg (2000)"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"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\u00a07(1), 5\u201322 (2003)","journal-title":"Journal of Data Mining and Knowledge Discovery"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0094820","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J.-F. Boulicaut","year":"1998","unstructured":"Boulicaut, J.-F., Klemettinen, M., Mannila, H.: Querying inductive databases: A case study on the MINE RULE operator. In: \u017bytkow, J.M. (ed.) PKDD 1998. LNCS, vol.\u00a01510, pp. 194\u2013202. Springer, Heidelberg (1998)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/375551.375604","volume-title":"Proc. of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2001)","author":"A. Bykowski","year":"2001","unstructured":"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\u2013273. ACM, New York (2001)"},{"key":"16_CR10","unstructured":"Bykowski, A., Rigotti, C.: Disjunction-bordered condensed representation of frequent patterns. Information Systems (to appear)"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"Dehaspe, L., Toivonen, H.: Discovery of frequent datalog patterns. Journal of Data Mining and Knowledge Discovery\u00a03(1), 7\u201336 (1999)","journal-title":"Journal of Data Mining and Knowledge Discovery"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/360402.360421","volume":"2","author":"J. Hipp","year":"2000","unstructured":"Hipp, J., G\u00fcntzer, U., Nakhaeizadeh, G.: Algorithms for association rule mining \u2013 a general survey and comparison. SIGKDD Explorations\u00a02(1), 58\u201364 (2000)","journal-title":"SIGKDD Explorations"},{"issue":"11","key":"16_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"Imielinski, T., Mannila, H.: A database perspective on knowledge discovery. Communications of the ACM\u00a039(11), 58\u201364 (1996)","journal-title":"Communications of the ACM"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013134 (1999)","DOI":"10.1145\/312129.312216"},{"key":"16_CR15","first-page":"21","volume-title":"Proc. ILPS 1997","author":"H. Mannila","year":"1997","unstructured":"Mannila, H.: Inductive databases and condensed representations for data mining. In: Proc. ILPS 1997, Port Jefferson, USA, pp. 21\u201330. MIT Press, Cambridge (1997)"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"16_CR17","first-page":"229","volume-title":"Knowledge Discovery in Databases","author":"G. Piatetsky-Shapiro","year":"1991","unstructured":"Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229\u2013248. AAAI Press, Menlo Park (1991)"},{"key":"16_CR18","first-page":"432","volume-title":"Proc. VLDB 1995","author":"A. Savasere","year":"1995","unstructured":"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\u2013444. Morgan Kaufmann, San Francisco (1995)"},{"key":"16_CR19","unstructured":"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\u2013281 (1995)"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/233269.233311","volume-title":"Proc. ACM SIGMOD 1996","author":"R. Srikant","year":"1996","unstructured":"Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: Proc. ACM SIGMOD 1996, Montreal, Quebec, Canada, June 1996, pp. 1\u201312. ACM Press, New York (1996)"},{"key":"16_CR21","volume-title":"Database and Knowledge-Base Systems","author":"J. Ullman","year":"1989","unstructured":"Ullman, J.: Database and Knowledge-Base Systems, vol.\u00a0II. Computer Science Press, Rockville, MD (1989)"}],"container-title":["Lecture Notes in Computer Science","Database Support for Data Mining Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-44497-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:00:32Z","timestamp":1739916032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-44497-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540224792","9783540444978"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-44497-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}