{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:47Z","timestamp":1750308227006,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014086","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"296-305","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Support envelopes"],"prefix":"10.1145","author":[{"given":"Michael","family":"Steinbach","sequence":"first","affiliation":[{"name":"University of Minnesota"}]},{"given":"Pang-Ning","family":"Tan","sequence":"additional","affiliation":[{"name":"Michigan State University"}]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of Minnesota"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646418.693194"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021571501451"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844807"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"Davey B. A.","year":"2002","unstructured":"B. A. Davey and H. A. Priestley . Introduction to Lattices and Order . Cambridge University Press , 2 nd edition, 2002 .]] B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2nd edition, 2002.]]","edition":"2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/550737"},{"key":"e_1_3_2_1_6_1","unstructured":"Bart Goethals and Mohammed J. Zaki. Frequent Itemset Mining Implementations Repository (FIMI). This site contains a wide-variety of algorithms for mining frequent closed and maximal itemsets http:\/\/fimi.cs.helsinki.fi\/.]]  Bart Goethals and Mohammed J. Zaki. Frequent Itemset Mining Implementations Repository (FIMI). This site contains a wide-variety of algorithms for mining frequent closed and maximal itemsets http:\/\/fimi.cs.helsinki.fi\/.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263684"},{"key":"e_1_3_2_1_8_1","volume-title":"Data Mining: Concepts and Techniques","author":"Han Jiawei","year":"2000","unstructured":"Jiawei Han and Micheline Kamber . Data Mining: Concepts and Techniques . Morgan Kaufmann Publishers , 2000 .]] Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/360402.360421"},{"key":"e_1_3_2_1_10_1","first-page":"189","volume-title":"Knowledge Discovery and Data Mining","author":"Mannila Heikki","year":"1996","unstructured":"Heikki Mannila and Hannu Toivonen . Multiple uses of frequent sets and condensed representations . In Knowledge Discovery and Data Mining , pages 189 -- 194 , 1996 .]] Heikki Mannila and Hannu Toivonen. Multiple uses of frequent sets and condensed representations. In Knowledge Discovery and Data Mining, pages 189--194, 1996.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009796218281"},{"key":"e_1_3_2_1_12_1","first-page":"361","volume-title":"Proc. 15emes Journees Bases de Donnees Avancees, BDA","author":"Pasquier Nicolas","year":"1999","unstructured":"Nicolas Pasquier , Yves Bastide , Rafik Taouil , and Lotfi Lakhal . Closed set based discovery of small covers for association rules . In Proc. 15emes Journees Bases de Donnees Avancees, BDA , pages 361 -- 381 , 1999 .]] Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Closed set based discovery of small covers for association rules. In Proc. 15emes Journees Bases de Donnees Avancees, BDA, pages 361--381, 1999.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"e_1_3_2_1_14_1","first-page":"714","volume-title":"Proc. of 19th IEEE Intl. Conf. on Data Engineering","author":"Pudi V.","year":"2003","unstructured":"V. Pudi and J. Haritsa . Generalized closed itemsets: A technique for improving the conciseness of rule covers . In Proc. of 19th IEEE Intl. Conf. on Data Engineering , Bangalore, India , March 2003 , pages 714 -- 716 . IEEE Computer Society, 2003.]] V. Pudi and J. Haritsa. Generalized closed itemsets: A technique for improving the conciseness of rule covers. In Proc. of 19th IEEE Intl. Conf. on Data Engineering, Bangalore, India, March 2003, pages 714--716. IEEE Computer Society, 2003.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773181"},{"key":"e_1_3_2_1_16_1","unstructured":"Michael Steinbach. Preliminary implementation of support envelope algorithms. http:\/\/www.cs.umn.edu\/~steinbac\/se\/se.html.]]  Michael Steinbach. Preliminary implementation of support envelope algorithms. http:\/\/www.cs.umn.edu\/~steinbac\/se\/se.html.]]"},{"key":"e_1_3_2_1_17_1","volume-title":"Support envelopes: A technique for exploring the structure of association patterns. Technical report","author":"Pang-Ning Tan Michael Steinbach","year":"2004","unstructured":"Michael Steinbach Pang-Ning Tan and Vipin Kumar . Tr# 2004-115 : Support envelopes: A technique for exploring the structure of association patterns. Technical report , Army High Performance Computing Research Center , April 2004 .]] Michael Steinbach Pang-Ning Tan and Vipin Kumar. Tr# 2004-115: Support envelopes: A technique for exploring the structure of association patterns. Technical report, Army High Performance Computing Research Center, April 2004.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952153"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502539"},{"key":"e_1_3_2_1_20_1","first-page":"1","volume-title":"DMKD 98","author":"Zaki Mohammed Javeed","year":"1998","unstructured":"Mohammed Javeed Zaki and Mitsunori Ogihara . Theoretical foundations of association rules . In DMKD 98 , pages 7: 1 -- 7 :8, June 1998 .]] Mohammed Javeed Zaki and Mitsunori Ogihara. Theoretical foundations of association rules. In DMKD 98, pages 7:1--7:8, June 1998.]]"},{"key":"e_1_3_2_1_21_1","volume-title":"SDM 2002","author":"Mohammed","year":"2002","unstructured":"Mohammed J. Zaki and Ching-Jui Hsiao. Charm: An efficient algorithm for closed itemset mining . In SDM 2002 , 2002 .]] Mohammed J. Zaki and Ching-Jui Hsiao. Charm: An efficient algorithm for closed itemset mining. In SDM 2002, 2002.]]"},{"volume-title":"conference 5, http:\/\/trec.nist.gov\/.]]","author":"Text","key":"e_1_3_2_1_22_1","unstructured":"Text retrieval conference 5, http:\/\/trec.nist.gov\/.]] Text retrieval conference 5, http:\/\/trec.nist.gov\/.]]"}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Seattle WA USA","acronym":"KDD04"},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014086","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:30Z","timestamp":1750264290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014086"}},"subtitle":["a technique for exploring the structure of association patterns"],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":22,"alternative-id":["10.1145\/1014052.1014086","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014086","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}