{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:17:03Z","timestamp":1761895023202,"version":"3.41.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP0772238"],"award-info":[{"award-number":["DP0772238"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2010,1]]},"abstract":"<jats:p>Self-sufficient itemsets are those whose frequency cannot be explained solely by the frequency of either their subsets or of their supersets. We argue that itemsets that are not self-sufficient will often be of little interest to the data analyst, as their frequency should be expected once that of the itemsets on which their frequency depends is known. We present tests for statistically sound discovery of self-sufficient itemsets, and computational techniques that allow those tests to be applied as a post-processing step for any itemset discovery algorithm. We also present a measure for assessing the degree of potential interest in an itemset that complements these statistical measures.<\/jats:p>","DOI":"10.1145\/1644873.1644876","type":"journal-article","created":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T20:23:07Z","timestamp":1263327787000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["Self-sufficient itemsets"],"prefix":"10.1145","volume":"4","author":[{"given":"Geoffrey I.","family":"Webb","sequence":"first","affiliation":[{"name":"Monash University, Australia"}]}],"member":"320","published-online":{"date-parts":[[2010,1,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011454"},{"volume-title":"Categorical Data Analysis","author":"Agresti A.","key":"e_1_2_1_3_1","unstructured":"Agresti , A. 2002. Categorical Data Analysis . Wiley-Interscience , New York . Agresti, A. 2002. Categorical Data Analysis. Wiley-Interscience, New York."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312243"},{"volume-title":"Proceedings of the 1st International Conference on Computational Logic (CL'00)","author":"Bastide Y.","key":"e_1_2_1_5_1","unstructured":"Bastide , Y. , Pasquier , N. , Taouil , R. , Stumme , G. , and Lakhal , L . 2000. Mining minimal non-redundant association rules using frequent closed itemsets . In Proceedings of the 1st International Conference on Computational Logic (CL'00) . Springer-Verlag, Berlin, 972--986. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., and Lakhal, L. 2000. Mining minimal non-redundant association rules using frequent closed itemsets. In Proceedings of the 1st International Conference on Computational Logic (CL'00). Springer-Verlag, Berlin, 972--986."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312219"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009895914772"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312241"},{"volume-title":"Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'02)","author":"Calders T.","key":"e_1_2_1_9_1","unstructured":"Calders , T. and Goethals , B . 2002. Mining all non-derivable frequent itemsets . In Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'02) . Springer, Berlin, 74--85. Calders, T. and Goethals, B. 2002. Mining all non-derivable frequent itemsets. In Proceedings of the 6th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'02). Springer, Berlin, 74--85."},{"volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining. 19--26","author":"Chan R.","key":"e_1_2_1_10_1","unstructured":"Chan , R. , Yang , Q. , and Shen , Y. D . 2003. Mining high utility itemsets . In Proceedings of the 3rd IEEE International Conference on Data Mining. 19--26 . Chan, R., Yang, Q., and Shen, Y. D. 2003. Mining high utility itemsets. In Proceedings of the 3rd IEEE International Conference on Data Mining. 19--26."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.1"},{"volume-title":"Proceedings of the International WEBKDD'99 Workshop. Springer","author":"Cooley R.","key":"e_1_2_1_12_1","unstructured":"Cooley , R. , Tan , P.-N. , and Srivastava , J . 1999. Discovery of interesting usage patterns from Web data . In Proceedings of the International WEBKDD'99 Workshop. Springer , Berlin, 163--182. Cooley, R., Tan, P.-N., and Srivastava, J. 1999. Discovery of interesting usage patterns from Web data. In Proceedings of the International WEBKDD'99 Workshop. Springer, Berlin, 163--182."},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/00031305.1999.10474456","article-title":"Bayesian data mining in large frequency tables, with an application to the FDA spontaneous reporting system","volume":"53","author":"DuMouchel W.","year":"1999","unstructured":"DuMouchel , W. 1999 . Bayesian data mining in large frequency tables, with an application to the FDA spontaneous reporting system . Americ. Statis. 53 , 3, 177 -- 190 . DuMouchel, W. 1999. Bayesian data mining in large frequency tables, with an application to the FDA spontaneous reporting system. Americ. Statis. 53, 3, 177--190.","journal-title":"Americ. Statis."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502526"},{"key":"e_1_2_1_15_1","unstructured":"Goethals B. 2007. NDI. Software. http:\/\/www.adrem.ua.ac.be\/goethals\/software\/. Goethals B. 2007. NDI. Software. http:\/\/www.adrem.ua.ac.be\/goethals\/software\/."},{"key":"e_1_2_1_16_1","unstructured":"Hettich S. and Bay S. D. 2006. The UCI KDD archive. Department of Information and Computer Science. University of California Irvine CA. http:\/\/kdd.ics.uci.edu. Hettich S. and Bay S. D. 2006. The UCI KDD archive. Department of Information and Computer Science. University of California Irvine CA. http:\/\/kdd.ics.uci.edu."},{"key":"e_1_2_1_17_1","first-page":"65","article-title":"A simple sequentially rejective multiple test procedure","volume":"6","author":"Holm S.","year":"1979","unstructured":"Holm , S. 1979 . A simple sequentially rejective multiple test procedure . Scandinavian J. Statis. 6 , 65 -- 70 . Holm, S. 1979. A simple sequentially rejective multiple test procedure. Scandinavian J. Statis. 6, 65--70.","journal-title":"Scandinavian J. Statis."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014074"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502560"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.81"},{"volume-title":"Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD'98)","author":"Megiddo N.","key":"e_1_2_1_21_1","unstructured":"Megiddo , N. and Srikant , R . 1998. Discovering predictive association rules . In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD'98) . AAAI Press, Menlo Park, US, 27--78. Megiddo, N. and Srikant, R. 1998. Discovering predictive association rules. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD'98). AAAI Press, Menlo Park, US, 27--78."},{"key":"e_1_2_1_22_1","unstructured":"Newman D. J. Hettich S. Blake C. and Merz C. J. 2006. UCI repository of machine learning databases. {Machine-readable data repository}. Department of Information and Computer Science University of California Irvine CA. Newman D. J. Hettich S. Blake C. and Merz C. J. 2006. UCI repository of machine learning databases. {Machine-readable data repository}. Department of Information and Computer Science University of California Irvine CA."},{"volume-title":"Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM'02)","author":"Pei J.","key":"e_1_2_1_23_1","unstructured":"Pei , J. , Dong , G. , Zou , W. , and Han , J . 2002. On computing condensed frequent pattern bases . In Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM'02) . 378--385. Pei, J., Dong, G., Zou, W., and Han, J. 2002. On computing condensed frequent pattern bases. In Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM'02). 378--385."},{"volume-title":"Knowledge Discovery in Databases","author":"Piatetsky-Shapiro G.","key":"e_1_2_1_24_1","unstructured":"Piatetsky-Shapiro , G. 1991. Discovery, analysis, and presentation of strong rules . In Knowledge Discovery in Databases , G. Piatetsky-Shapiro and J. Frawley, Eds. AAAI\/MIT Press, Menlo Park , CA. , 229--248. Piatetsky-Shapiro, G. 1991. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, G. Piatetsky-Shapiro and J. Frawley, Eds. AAAI\/MIT Press, Menlo Park, CA., 229--248."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.ps.46.020195.003021"},{"key":"e_1_2_1_26_1","unstructured":"Tabachnick B. G. and Fidell L. S. 2001. Using Multivariate Statistics. Allyn and Bacon Boston MA. Tabachnick B. G. and Fidell L. S. 2001. Using Multivariate Statistics. Allyn and Bacon Boston MA."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622620.1622635"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502569"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5006-x"},{"volume-title":"G. I. Webb & Associates","author":"Webb G. I.","key":"e_1_2_1_30_1","unstructured":"Webb , G. I. 2009. Magnum Opus Version 4.3. Software , G. I. Webb & Associates , Melbourne, Aust . Webb, G. I. 2009. Magnum Opus Version 4.3. Software, G. I. Webb & Associates, Melbourne, Aust."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0255-4"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956783"},{"volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB'05)","author":"Xin D.","key":"e_1_2_1_33_1","unstructured":"Xin , D. , Han , J. , Yan , X. , and Cheng , H . 2005. Mining compressed frequent-pattern sets . In Proceedings of the International Conference on Very Large Databases (VLDB'05) . 709--720. Xin, D., Han, J., Yan, X., and Cheng, H. 2005. Mining compressed frequent-pattern sets. In Proceedings of the International Conference on Very Large Databases (VLDB'05). 709--720."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.10.004"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347101"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000040429.96086.c7"},{"volume-title":"Proceedings of the 2nd SIAM International Conference on Data Mining. 457--473","author":"Zaki M. J.","key":"e_1_2_1_37_1","unstructured":"Zaki , M. J. and Hsiao , C. J . 2002. CHARM: An efficient algorithm for closed itemset mining . In Proceedings of the 2nd SIAM International Conference on Data Mining. 457--473 . Zaki, M. J. and Hsiao, C. J. 2002. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the 2nd SIAM International Conference on Data Mining. 457--473."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014094"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502572"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1644873.1644876","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1644873.1644876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:18Z","timestamp":1750250478000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1644873.1644876"}},"subtitle":["An approach to screening potentially interesting associations between items"],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["10.1145\/1644873.1644876"],"URL":"https:\/\/doi.org\/10.1145\/1644873.1644876","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2010,1]]},"assertion":[{"value":"2008-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-01-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}