{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:25:17Z","timestamp":1762100717781,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45681-3_34","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"410-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Answering the Most Correlated N Association Rules Efficiently"],"prefix":"10.1007","author":[{"given":"Jun","family":"Sese","sequence":"first","affiliation":[]},{"given":"Shinichi","family":"Morishita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In Proc. of PODS\u201998, pp. 18\u201324, June 1998.","key":"34_CR1","DOI":"10.1145\/275487.275490"},{"doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proc. of SIGMOD\u201993, pp. 207\u2013216, May 1993.","key":"34_CR2","DOI":"10.1145\/170036.170072"},{"unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of VLDB\u201994, pp. 487\u2013499, Sept. 1994.","key":"34_CR3"},{"doi-asserted-by":"crossref","unstructured":"R. J. Bayardo Jr. Efficiently mining long patterns from databases. In Proc. of SIGMOD\u201998, pp. 85\u201393, June 1998.","key":"34_CR4","DOI":"10.1145\/276304.276313"},{"doi-asserted-by":"crossref","unstructured":"R. J. Bayardo and R. Agrawal Mining the most interesting rules. In Proc. of SIGKDD\u201999, pp. 145\u2013153, Aug. 1999.","key":"34_CR5","DOI":"10.1145\/312129.312219"},{"doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Proc. of SIGMOD\u201997, pp. 265\u2013276, May 1997.","key":"34_CR6","DOI":"10.1145\/253260.253327"},{"doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket analysis. In Proc. of SIGMOD\u201997, pp. 265\u2013276, May 1997.","key":"34_CR7","DOI":"10.1145\/253260.253327"},{"doi-asserted-by":"crossref","unstructured":"B. Dunkel and N. Soparkar. Data organization and access for efficient data mining. In Proc. of ICDE\u201999, pp. 522\u2013529, March 1999.","key":"34_CR8","DOI":"10.1109\/ICDE.1999.754968"},{"doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of SIGMOD\u201900, pp. 1\u201312, May 2000.","key":"34_CR9","DOI":"10.1145\/342009.335372"},{"doi-asserted-by":"crossref","unstructured":"B. Liu, W. Hsu, and Y. Ma. Pruning and summarizing the discovered associations. In Proc. of SIGKDD\u201999, pp. 125\u2013134, 1999.","key":"34_CR10","DOI":"10.1145\/312129.312216"},{"doi-asserted-by":"crossref","unstructured":"S. Morishita and J. Sese. Traversing lattice itemset with statistical metric pruning. In Proc. of PODS\u201900, pp. 226\u2013236, May 2000.","key":"34_CR11","DOI":"10.1145\/335168.335226"},{"doi-asserted-by":"crossref","unstructured":"A. Nakaya, H. Hishigaki, and S. Morishita. Mining the quantitative trait loci associated with oral glucose tolerance in the OLETF rat. In Proc. of Pacific Symposium on Biocomputing, pp. 367\u2013379, Jan. 2000.","key":"34_CR12","DOI":"10.1142\/9789814447331_0035"},{"doi-asserted-by":"crossref","unstructured":"J. S. Park, M. S. Chen, and P. S. Yu. An effective hash-based algorithm for mining association rules. In Proc. of SIGMOD\u201995, pp. 175\u2013186, May 1995.","key":"34_CR13","DOI":"10.1145\/223784.223813"},{"unstructured":"R. Rymon. Search through systematic set enumeration. In Proc. of KR\u201992, pp. 539\u2013550, 1992.","key":"34_CR14"},{"doi-asserted-by":"crossref","unstructured":"P. Shenoy, J. R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbocharging vertical mining of large databases. In Proc. of SIGMOD\u201900, pp. 22\u201333, May 2000.","key":"34_CR15","DOI":"10.1145\/342009.335376"},{"doi-asserted-by":"crossref","unstructured":"G. I. Webb. Efficient search for association rules. In Proc. of SIGKDD\u201900, pp. 99\u2013107, Aug. 2000.","key":"34_CR16","DOI":"10.1145\/347090.347112"},{"doi-asserted-by":"crossref","unstructured":"M. J. Zaki. Generating non-redundant association rules. In Proc. of SIGKDD\u201900, pp. 34\u201343, Aug. 2000.","key":"34_CR17","DOI":"10.1145\/347090.347101"},{"unstructured":"M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. of KDD\u201997, pp. 343\u2013374, Aug. 1997.","key":"34_CR18"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:43Z","timestamp":1749573343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}