{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:12:09Z","timestamp":1740287529770,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200857"},{"type":"electronic","value":"9783540398042"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39804-2_5","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:06:45Z","timestamp":1277698005000},"page":"23-34","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Statistical Pruning of Association Rules"],"prefix":"10.1007","author":[{"given":"Alan","family":"Ableson","sequence":"first","affiliation":[]},{"given":"Janice","family":"Glasgow","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 12\u201315 (1994)","key":"5_CR1"},{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Intl. Conference on Management of Data, pp. 207\u2013216, 26\u201328 (1993)","key":"5_CR2","DOI":"10.1145\/170035.170072"},{"issue":"1","key":"5_CR3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y. Benjamini","year":"1995","unstructured":"Benjamini, Y., Hochberg, Y.: Controlling the false discovery rate: a practical and powerful approach to multiple testing. Journal of the Royal Statistical Society, Series B\u00a057(1), 300\u2013389 (1995)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)","key":"5_CR4"},{"unstructured":"Shah, D., et al.: Interestingness and pruning of mined patterns. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (1999)","key":"5_CR5"},{"unstructured":"Toivonen, H., et al.: Pruning and grouping of discovered association rules (1995)","key":"5_CR6"},{"doi-asserted-by":"crossref","unstructured":"Klemettinen, M., et al.: Finding interesting rules from large sets of discovered association rules. In: CIKM 1994, pp. 401\u2013407 (1994)","key":"5_CR7","DOI":"10.1145\/191246.191314"},{"key":"5_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic - CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., et al.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J., et al. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, p. 972. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: ICDM, pp. 163\u2013170 (2001)","key":"5_CR9","DOI":"10.1109\/ICDM.2001.989514"},{"doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Intl. Conference on Management of Data, June 05, pp. 1\u201312 (2000)","key":"5_CR10","DOI":"10.1145\/342009.335372"},{"unstructured":"Hussain, F., Liu, H., Lu, H.: Relative measure for mining interesting rules. In: The Fourth European Conference on Principles and Practice of Knowledge Discovery in Databases (2000)","key":"5_CR11"},{"doi-asserted-by":"crossref","unstructured":"Jaroszewicz, S., Simovici, D.A.: Pruning redundant association rules using maximum entropy principle. In: Advances in Knowledge Discovery and Data Mining, PAKDD, pp. 135\u2013147 (2002)","key":"5_CR12","DOI":"10.1007\/3-540-47887-6_13"},{"doi-asserted-by":"crossref","unstructured":"Bayardo Jr, R.J.: Efficiently mining long patterns from databases. In: ACM SIGMOD Intl. Conference on Management of Data, pp. 85\u201393 (1998)","key":"5_CR13","DOI":"10.1145\/276304.276313"},{"doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Pruning and summarizing the discovered associations. In: Knowledge Discovery and Data Mining, pp. 125\u2013134 (1999)","key":"5_CR14","DOI":"10.1145\/312129.312216"},{"unstructured":"Pavlov, D., Mannila, H., Smyth, P.: Beyond independence: Probabilistic models for query approximation on binary transaction data. Technical Report UCI-ICS TR-01-09, UC Irvine (2001)","key":"5_CR15"},{"key":"5_CR16","volume-title":"Introduction to Probability Models","author":"S.M. Ross","year":"1972","unstructured":"Ross, S.M.: Introduction to Probability Models. Academic Press, London (1972)"},{"doi-asserted-by":"crossref","unstructured":"Silverstein, C., Brin, S., Motwani, R.: Beyond market baskets: Generalizing association rules to correlations. In: SIGMOD Conference, pp. 265\u2013276 (1997)","key":"5_CR17","DOI":"10.1145\/253262.253327"},{"unstructured":"Steeg, E., Robinson, D.A., Willis, E.: Coincidence detection: A fast method for discovering higher-order correlations in multidimensional data. In: KDD 1998, pp. 112\u2013120 (1998)","key":"5_CR18"},{"doi-asserted-by":"crossref","unstructured":"Tan, P., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: ACM SIGKDD (2002)","key":"5_CR19","DOI":"10.1145\/775047.775053"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/151271.151274","volume":"19","author":"T. Wu","year":"1993","unstructured":"Wu, T.: An accurate computation of the hypergeometric distribution function. ACM Transactions on Mathematical Software (TOMS)\u00a019(1), 33\u201343 (1993)","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"doi-asserted-by":"crossref","unstructured":"Zaki, M.: Generating non-redundant association rules. In: KDD 2000, pp. 34\u201343 (2000)","key":"5_CR21","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39804-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T08:34:24Z","timestamp":1740213264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39804-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200857","9783540398042"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39804-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}