{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:20Z","timestamp":1761596720026,"version":"3.41.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Intelligent Information Systems"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1023\/a:1008637019359","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T15:12:40Z","timestamp":1040569960000},"page":"7-32","source":"Crossref","is-referenced-by-count":28,"title":["Designing Templates for Mining Association Rules"],"prefix":"10.1007","volume":"9","author":[{"given":"Elena","family":"Baralis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Psaila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"140511_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc.ACM SIGMOD Conference on Management of Data, pages 207\u2013216, Washington, D.C., May 1993. British Columbia.","DOI":"10.1145\/170036.170072"},{"key":"140511_CR2","volume-title":"Knowledge Discovery in Databases","author":"R. Agrawal","year":"1995","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In P. S. Usama M. Fayyad, G. Piatetsky-Shapiro and R. U. (Eds), editors, Knowledge Discovery in Databases, volume 2. AAAI\/MIT Press, Santiago, Chile, September 1995."},{"key":"140511_CR3","unstructured":"R. Agrawal, G. Psaila, E. L. Wimmers, and M. Zait. Querying shapes of histories. In Proceedings of the 21st VLDB Conference, Zurich, Switzerland, September 1995."},{"key":"140511_CR4","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20st VLDB Conference, Santiago, Chile, September 1994."},{"key":"140511_CR5","unstructured":"R. Agrawal and R. Srikant. Mining sequential patterns. In International Conference on Data Engineering, Taipei, Taiwan, March 1995."},{"key":"140511_CR6","unstructured":"A Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st VLDB Conference, Zurich, Swizerland, 1995."},{"key":"140511_CR7","unstructured":"U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. AAAI Press \/ The MIT Press, 1996."},{"key":"140511_CR8","unstructured":"J. Han and Fu. Discovery of multiple-level association rules from large databases. In Proceedings of the 21st VLDB Conference, Zurich, Switzerland, September 1995."},{"key":"140511_CR9","unstructured":"H. Toivonen. Sampling large databases for association rules. In Proceedings of the 22nd VLDB Conference, Bombay (Mumbai), India, 1996."},{"key":"140511_CR10","unstructured":"T. Imielinski. From file mining to database mining. In Proceedings of SIGMOD-96Workshop on Research Issues on Data Mining and knowledge Discovery, pages 35\u201339, May 1996."},{"key":"140511_CR11","unstructured":"R. Meo, G. Psaila, and S. Ceri. A new sql-like operator for mining association rules. In Proceedings of the 22st VLDB Conference, Bombay, India, September 1996."},{"key":"140511_CR12","doi-asserted-by":"crossref","unstructured":"J. S. Park, M. Shen, and P. S. Yu. An effective hash based algorithm for mining association rules. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, San Jose, California, May 1995.","DOI":"10.1145\/223784.223813"},{"key":"140511_CR13","unstructured":"R. Srikant and R. Agrawal. Mining generalized association rules. In Proceedings of the 21st VLDB Conference, Zurich, Switzerland, September 1995."},{"key":"140511_CR14","doi-asserted-by":"crossref","unstructured":"R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, San Jose, California, May 1996.","DOI":"10.1145\/233269.233311"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008637019359.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008637019359\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008637019359.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:19:59Z","timestamp":1749219599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008637019359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["140511"],"URL":"https:\/\/doi.org\/10.1023\/a:1008637019359","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"type":"print","value":"0925-9902"},{"type":"electronic","value":"1573-7675"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}