{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:43Z","timestamp":1750308223853,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"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.1014140","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"683-688","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Dense itemsets"],"prefix":"10.1145","author":[{"given":"Jouni K.","family":"Sepp\u00e4nen","sequence":"first","affiliation":[{"name":"Helsinki University of Technology, Finland"}]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[{"name":"Helsinki University of Technology, Finland"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_2_1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R.","year":"1996","unstructured":"R. Agrawal , H. Mannila , R. Srikant , H. Toivonen , and A. I. Verkamo . Fast discovery of association rules . In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining , chapter 12, pages 307 -- 328 . AAAI Press , 1996 .]] R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, chapter 12, pages 307--328. AAAI Press, 1996.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775112"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"75","volume-title":"PKDD--2000","author":"Boulicaut J.-F.","year":"2000","unstructured":"J.-F. Boulicaut , A. Bykowski , and C. Rigotti . Approximation of frequency queries by means of free-sets . In PKDD--2000 , volume 1910 of LNCS , pages 75 -- 85 . Springer , 2000 .]] J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. In PKDD--2000, volume 1910 of LNCS, pages 75--85. Springer, 2000.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312241"},{"key":"e_1_3_2_1_6_1","first-page":"20","volume-title":"First International Workshop","author":"Bykowski A.","year":"2002","unstructured":"A. Bykowski , J. K. Sepp\u00e4nen , and J. Hollm\u00e9n . Model-independent bounding of Boolean formulae in binary data. In M. Klemettinen, R. Meo, F. Giannotti, and L. De Raedt, editors, Knowledge Discovery in Inductive Databases (KDID--02) , First International Workshop , pages 20 -- 31 , Helsinki, Finland , 2002 . University of Helsinki Department of Computer Science Report B--2002--7.]] A. Bykowski, J. K. Sepp\u00e4nen, and J. Hollm\u00e9n. Model-independent bounding of Boolean formulae in binary data. In M. Klemettinen, R. Meo, F. Giannotti, and L. De Raedt, editors, Knowledge Discovery in Inductive Databases (KDID--02), First International Workshop, pages 20--31, Helsinki, Finland, 2002. University of Helsinki Department of Computer Science Report B--2002--7.]]"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","first-page":"74","volume-title":"Proc. PKDD--2002","author":"Calders T.","year":"2002","unstructured":"T. Calders and B. Goethals . Mining all non-derivable frequent itemsets . In T. Elomaa, H. Mannila, and H. Toivonen, editors, Proc. PKDD--2002 , volume 2431 of LNCS , pages 74 -- 85 . Springer-Verlag , 2002 .]] T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In T. Elomaa, H. Mannila, and H. Toivonen, editors, Proc. PKDD--2002, volume 2431 of LNCS, pages 74--85. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"Pattern Classification and Scene Analysis","author":"Duda R.","year":"1973","unstructured":"R. Duda and P. Hart . Pattern Classification and Scene Analysis . Wiley , New York , 1973 .]] R. Duda and P. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973.]]"},{"key":"e_1_3_2_1_9_1","unstructured":"F. Geerts B. Goethals and T. Mielik\u00e4inen. Mining tiles and tilings. Manuscript in preparation.]]  F. Geerts B. Goethals and T. Mielik\u00e4inen. Mining tiles and tilings. Manuscript in preparation.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. Workshop on Frequent Itemset Mining Implementations (FIMI--03)","volume":"90","author":"Goethals B.","year":"2003","unstructured":"B. Goethals and M. J. Zaki , editors . Proc. Workshop on Frequent Itemset Mining Implementations (FIMI--03) , volume 90 of CEUR-WS, Melbourne, Florida , 2003 . http:\/\/CEUR-WS.org\/Vol-90\/.]] B. Goethals and M. J. Zaki, editors. Proc. Workshop on Frequent Itemset Mining Implementations (FIMI--03), volume 90 of CEUR-WS, Melbourne, Florida, 2003. http:\/\/CEUR-WS.org\/Vol-90\/.]]"},{"key":"e_1_3_2_1_11_1","first-page":"211","volume-title":"ICDM 2002","author":"Han J.","year":"2002","unstructured":"J. Han , J. Wang , Y. Lu , and P. Tzvetkov . Mining top-k frequent closed patterns without minimum support . In ICDM 2002 , pages 211 -- 218 , 2002 .]] J. Han, J. Wang, Y. Lu, and P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM 2002, pages 211--218, 2002.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972644"},{"key":"e_1_3_2_1_14_1","volume-title":"Advances in Neural Information Processing Systems","author":"Lee D. D.","year":"2000","unstructured":"D. D. Lee and H. S. Seung . Algorithms for non-negative matrix factorization . In Advances in Neural Information Processing Systems , 2000 .]] D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems, 2000.]]"},{"key":"e_1_3_2_1_15_1","series-title":"LNAI","first-page":"327","volume-title":"Proc. PKDD--2003","author":"Mielik\u00e4inen T.","year":"2003","unstructured":"T. Mielik\u00e4inen and H. Mannila . The pattern ordering problem . In N. Lavrac, D. Gamberger, L. Todorovski, and H. Blockeel, editors, Proc. PKDD--2003 , volume 2383 of LNAI , pages 327 -- 338 . Springer , 2003 .]] T. Mielik\u00e4inen and H. Mannila. The pattern ordering problem. In N. Lavrac, D. Gamberger, L. Todorovski, and H. Blockeel, editors, Proc. PKDD--2003, volume 2383 of LNAI, pages 327--338. Springer, 2003.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656256"},{"key":"e_1_3_2_1_17_1","volume-title":"Workshop on Research Issues in Data Mining and Knowledge Discovery","author":"Pei J.","year":"2001","unstructured":"J. Pei , A. K. Tung , and J. Han . Fault-tolerant frequent pattern mining: Problems and challenges . In Workshop on Research Issues in Data Mining and Knowledge Discovery , 2001 .]] J. Pei, A. K. Tung, and J. Han. Fault-tolerant frequent pattern mining: Problems and challenges. In Workshop on Research Issues in Data Mining and Knowledge Discovery, 2001.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.3287615"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952169"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502539"}],"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.1014140","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:25Z","timestamp":1750264285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":20,"alternative-id":["10.1145\/1014052.1014140","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014140","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"}}]}}