{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T21:26:00Z","timestamp":1790717160470,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540433248","type":"print"},{"value":"9783540458760","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45876-x_9","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:28:28Z","timestamp":1181183308000},"page":"106-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Composition of Mining Contexts for Efficient Extraction of Association Rules"],"prefix":"10.1007","author":[{"given":"Cheikh Talibouya","family":"Diop","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Giacometti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Spyratos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"9_CR1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo (1996). Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, pp 309\u2013328, AAAI-MIT Press."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"E. Baralis and G. Psaila (1999). Incremental Refinement of Mining Queries. In Proc. of DAWAK\u201999, pp. 173\u2013182, Florence.","DOI":"10.1007\/3-540-48298-9_19"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J.D. Ullman and S. Tsur (1997), Dynamic Itemset Counting and Implication Rules for Market Basket Data. In Proc. of SIGMOD Conference, pp. 255\u2013264.","DOI":"10.1145\/253262.253325"},{"key":"9_CR4","unstructured":"A. K. Chandra and P. M. Merlin (1977). Optimal implementation of conjunctive queries in relational databases. In Proc. of the Ninth ACM Symposium on Theory of Computing, pp. 77\u201390."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"D. Cheung, J. Han, V. Ng, and C.Y. Wong (1996) Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proc. of ICDE\u201996, pp. 106\u2013114, New Orleans, USA.","DOI":"10.1109\/ICDE.1996.492094"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"L. Dehaspe and H. Toivonen (1999). Discovery of Frequent Datalog Patterns. Data Mining and Knowledge Discovery, 3, pp. 7\u201336, Kluwer Academic Publishers.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9_CR7","unstructured":"C.T. Diop, A. Giacometti, D. Laurent and N. Spyratos (2000). Extraction de r\u00e9gles d\u2019association entre vues: vers une approche incr\u00e9mentale (French). In Proc. of BDA\u20192000, pp. 323\u2013344, Blois, France. English version available as Tech. Rep. LI\/E3I No. 241, University of Tours, France."},{"key":"9_CR8","unstructured":"C.T. Diop, A. Giacometti, D. Laurent and N. Spyratos (2001). Combining Mining Tasks through Relational Algebra. Techn. Rep. LI\/E3I, Tours, France (full paper, to appear)."},{"key":"9_CR9","unstructured":"J. Han, Y. Fu, K. Kopersky and O. Zaiane (1996). DMQL: A Data Mining Query Language for Relational Databases. In Proc. of DMKD\u201996 (SIGMOD\u201996 Workshop on KDD), Montreal, Canada."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/A:1009816913055","volume":"3","author":"T. Imielinski","year":"1999","unstructured":"T. Imielinski and A. Virmani (1999). MSQL: A Query Language for Database Mining. Data Mining and Knowledge Discovery, Vol. 3, No. 4, pp. 373\u2013408, Kluwer Academic Publishers.","journal-title":"MSQL: A Query Language for Database Mining. Data Mining and Knowledge Discovery"},{"key":"9_CR11","unstructured":"M. Kamber, J. Han, J. Chiang (1997). Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes. In Proc. of KDD\u201997, pp. 207\u2013210, Newport Beach, USA."},{"key":"9_CR12","unstructured":"H. Mannila, H. Toivonen (1997). Levelwise Search and Borders of Theories in Knowledge Discovery. Techn. Rep. C-1997-8, University of Helsinki."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"T. Morzy, M. Wojciechowski and M. Zakrzewicz (2000). Materialized Data Mining Views. In Proc. of PKDD\u20192000, Springer Verlag, pp. 65\u201374, France.","DOI":"10.1007\/3-540-45372-5_7"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"B. Nag, P. Deshpande and D.J. DeWitt (1999). Using a Knowledge Cache for Interactive Discovery of Association Rules. In Proc. of KDD\u201999, pp. 244\u2013253, San Diego, USA.","DOI":"10.1145\/312129.312238"},{"key":"9_CR15","unstructured":"B. Nag, P. Deshpande and D.J. DeWitt (2001). Caching for Multi-dimensional Data Mining Queries. In Proc. of SCI\u20192001, Orlando, Florida."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"J.S. Park, M. Chen, P.S. Yu (1995). An Effiective Hash Based Algorithm for Mining Association Rules. SIGMOD Conference, pp. 175\u2013186.","DOI":"10.1145\/568271.223813"},{"key":"9_CR17","unstructured":"A. Savasere, E. Omiecinski and S.B. Navathe (1995). An Efficient Algorithm for Mining Association Rules in Large Databases. VLDB Conference, pp. 432\u2013444."},{"key":"9_CR18","unstructured":"S. Thomas, S. Bodagala, K. Alsabti and Sanjay Ranka (1997). An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In Proc. of KDD\u201997, pp. 263\u2013266, Newport Beach, USA."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"S. Tsur and al. (1998), Query Flocks: A Generalization of Association-Rule Mining. SIGMOD Conference, pp. 1\u201312.","DOI":"10.1145\/276305.276306"},{"key":"9_CR20","unstructured":"J.D. Ullman (1989). Principles of Databases and Knowledge-Base Systems. Vol. 1\u20132, Computer Science Press."}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45876-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:18:24Z","timestamp":1737076704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45876-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433248","9783540458760"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45876-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"14 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}