{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T15:36:06Z","timestamp":1767713766017,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"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":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339546","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"78-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":97,"title":["Mining top-K high utility itemsets"],"prefix":"10.1145","author":[{"given":"Cheng Wei","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan, ROC, Tainan, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bai-En","family":"Shie","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan, ROC, Tainan, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan, ROC, Tainan, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Chicago, Chicago, Illinois, USA, Chicago, Illinois, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952150"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.44"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0078-6"},{"key":"e_1_3_2_2_6_1","first-page":"554","article-title":"Efficient Mining of High-utility Itemsets from Large Datasets. In PAKDD 2008","volume":"5012","author":"Erwin A.","year":"2008","unstructured":"A. Erwin , R. P. Gopalan and N. R. Achuthan . Efficient Mining of High-utility Itemsets from Large Datasets. In PAKDD 2008 , LNAI 5012 , pp. 554 -- 561 , 2008 . A. Erwin, R. P. Gopalan and N. R. Achuthan. Efficient Mining of High-utility Itemsets from Large Datasets. In PAKDD 2008, LNAI 5012, pp. 554--561, 2008.","journal-title":"LNAI"},{"key":"e_1_3_2_2_7_1","volume-title":"Proc. of ISMIS'00","author":"Fu A. W.","year":"2000","unstructured":"A. W. Fu , R. W. Kwong and J. Tang , Mining N-Most Interesting Itemsets , In Proc. of ISMIS'00 , 2000 . A. W. Fu, R. W. Kwong and J. Tang, Mining N-Most Interesting Itemsets, In Proc. of ISMIS'00, 2000."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_2_9_1","volume-title":"Mining Top-k Frequent Closed Patterns without Minimum Support,\" In Proc. of ICDM","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 Proc. of ICDM , 2002 . J. Han, J. Wang, Y. Lu and P. Tzvetkov, \"Mining Top-k Frequent Closed Patterns without Minimum Support,\" In Proc. of ICDM, 2002."},{"key":"e_1_3_2_2_10_1","volume-title":"Proc. of ICDM","author":"Hirate Y.","year":"2004","unstructured":"Y. Hirate , E. Iwahashi and H. Yamana , TF2P-Growth: An Efficient Algorithm for Mining Frequent patterns without any Thresholds , In Proc. of ICDM 2004 . Y. Hirate, E. Iwahashi and H. Yamana, TF2P-Growth: An Efficient Algorithm for Mining Frequent patterns without any Thresholds, In Proc. of ICDM 2004."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.107"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089827.1089839"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.009"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIDM.2005.007320"},{"key":"e_1_3_2_2_15_1","unstructured":"J. Pisharath Y. Liu B. Ozisikyilmaz R. Narayanan W. K. Liao A. Choudhary and G. Memik NU-MineBench version 2.0 dataset and technical report http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBench.html  J. Pisharath Y. Liu B. Ozisikyilmaz R. Narayanan W. K. Liao A. Choudhary and G. Memik NU-MineBench version 2.0 dataset and technical report http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBench.html"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11811305_48"},{"key":"e_1_3_2_2_17_1","first-page":"211","volume-title":"Proc. Int'l Conf. on Data Mining","author":"Shen L.","year":"1998","unstructured":"L. Shen , H. Shen , P. Pritchard and R. Topor , Finding the N Largest Itemsets , in Proc. Int'l Conf. on Data Mining , pp. 211 -- 222 , 1998 . L. Shen, H. Shen, P. Pritchard and R. Topor, Finding the N Largest Itemsets, in Proc. Int'l Conf. on Data Mining, pp. 211--222, 1998."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774436"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835839"},{"key":"e_1_3_2_2_20_1","volume-title":"ACM KDD Workshop on Utility-Based Data Mining Workshop","author":"Tseng V. S.","year":"2006","unstructured":"V. S. Tseng , C. J. Chu , and T. Liang . Efficient mining of temporal high-utility itemsets from data streams . In ACM KDD Workshop on Utility-Based Data Mining Workshop , 2006 . V. S. Tseng, C. J. Chu, and T. Liang. Efficient mining of temporal high-utility itemsets from data streams. In ACM KDD Workshop on Utility-Based Data Mining Workshop, 2006."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04595-0_31"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.81"},{"key":"e_1_3_2_2_23_1","first-page":"28","volume-title":"Proc. of ACM SIGKDD 2nd Workshop on Utility-Based Data Mining","author":"Yao H.","year":"2006","unstructured":"H. Yao , H. J. Hamilton , L. Geng , A unified framework for utility-based measures for mining itemsets . In Proc. of ACM SIGKDD 2nd Workshop on Utility-Based Data Mining , pp. 28 -- 37 , 2006 . H. Yao, H. J. Hamilton, L. Geng, A unified framework for utility-based measures for mining itemsets. In Proc. of ACM SIGKDD 2nd Workshop on Utility-Based Data Mining, pp. 28--37, 2006."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352793.1352839"},{"key":"e_1_3_2_2_25_1","first-page":"283","volume-title":"Lee. Mining High-utility Quantitative Association Rules. In Proc. of 9th Int'l Conf. on Data Warehousing and Knowledge Discovery (DaWaK'2007)","author":"Yen S.-J.","year":"2007","unstructured":"S.-J. Yen and Y.- S. Lee. Mining High-utility Quantitative Association Rules. In Proc. of 9th Int'l Conf. on Data Warehousing and Knowledge Discovery (DaWaK'2007) , Lecture Notes in Computer Science (LNCS) 4654 , pp. 283 -- 292 , 2007 . S.-J. Yen and Y.-S. Lee. Mining High-utility Quantitative Association Rules. In Proc. of 9th Int'l Conf. on Data Warehousing and Knowledge Discovery (DaWaK'2007), Lecture Notes in Computer Science (LNCS) 4654, pp. 283--292, 2007."},{"key":"e_1_3_2_2_26_1","unstructured":"Frequent itemset mining implementations repository http:\/\/fimi.cs.helsinki.fi\/  Frequent itemset mining implementations repository http:\/\/fimi.cs.helsinki.fi\/"},{"key":"e_1_3_2_2_27_1","unstructured":"FoodMart2000 Microsoft Developer Network (MSDN) http:\/\/msdn.microsoft.com\/en-us\/library\/aa217032(v=sql.80).asp  FoodMart2000 Microsoft Developer Network (MSDN) http:\/\/msdn.microsoft.com\/en-us\/library\/aa217032(v=sql.80).asp"}],"event":{"name":"KDD '12: The 18th 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"],"location":"Beijing China","acronym":"KDD '12"},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339546","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:08Z","timestamp":1750238468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":27,"alternative-id":["10.1145\/2339530.2339546","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339546","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}