{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T19:01:33Z","timestamp":1751223693723,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":23,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1145\/2790798.2790807","type":"proceedings-article","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T12:36:32Z","timestamp":1441715792000},"page":"9-17","source":"Crossref","is-referenced-by-count":16,"title":["Mining High-Utility Itemsets with Multiple Minimum Utility Thresholds"],"prefix":"10.1145","author":[{"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[]}],"member":"320","reference":[{"key":"key-10.1145\/2790798.2790807-1","unstructured":"http:\/\/fimi.ua.ac.be\/data\/. 2012."},{"key":"key-10.1145\/2790798.2790807-2","doi-asserted-by":"crossref","unstructured":"R. Agrawal and R. Srikant. Quest synthetic data generator. http:\/\/www.Almaden.ibm.com\/cs\/quest\/syndata.htm., 1994.","DOI":"10.1145\/191843.191972"},{"key":"key-10.1145\/2790798.2790807-3","doi-asserted-by":"crossref","unstructured":"C. F. Ahmed, S. K. Tanbeer, B. S. Jeong, and Y. K. Le. Efficient tree structures for high utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering, 21(12):1708--1721, 2009.","DOI":"10.1109\/TKDE.2009.46"},{"key":"key-10.1145\/2790798.2790807-4","doi-asserted-by":"crossref","unstructured":"R. Chan, Q. Yang, and Y. D. Shen. Minging high utility itemsets. IEEE International Conference on Data Mining, pages 19--26, 2003.","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"key-10.1145\/2790798.2790807-5","doi-asserted-by":"crossref","unstructured":"M. S. Chen, J. Han, and P. S. Yu. Data mining: An overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering, 8(6):866--883, 1996.","DOI":"10.1109\/69.553155"},{"key":"key-10.1145\/2790798.2790807-6","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, C. W. Wu, S. Zida, and V. S. Tseng. Fhm: Faster high-utility itemset mining using estimated utility co-occurrence pruning. Lecture Notes in Computer Science, 8502:83--92, 2014.","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"key-10.1145\/2790798.2790807-7","doi-asserted-by":"crossref","unstructured":"J. Han, Y. Y. J. Pei, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1):53--87, 2004.","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"key-10.1145\/2790798.2790807-8","doi-asserted-by":"crossref","unstructured":"Y. H. Hu and Y. L. Chen. Mining association rules with multiple minimum supports: A new mining algorithm and a support tuning mechanism. Decision Support Systems, 42(1):1--24, 2006.","DOI":"10.1016\/j.dss.2004.09.007"},{"key":"key-10.1145\/2790798.2790807-9","doi-asserted-by":"crossref","unstructured":"R. U. Kiran and P. K. Reddy. Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. ACM International Conference on Extending Database Technology, pages 11--20, 2011.","DOI":"10.1145\/1951365.1951370"},{"key":"key-10.1145\/2790798.2790807-10","doi-asserted-by":"crossref","unstructured":"G. C. Lan, T. P. Hong, and V. S. Tseng. Discovery of high utility itemsets from on-shelf time periods of products. Expert Systems with Applications, 38(5):5851--5857, 2011.","DOI":"10.1016\/j.eswa.2010.11.040"},{"key":"key-10.1145\/2790798.2790807-11","doi-asserted-by":"crossref","unstructured":"G. C. Lan, T. P. Hong, and V. S. Tseng. An efficient projection-based indexing approach for mining high utility itemsets. Knowledge and Information Systems, 38(1):85--107, 2013.","DOI":"10.1007\/s10115-012-0492-y"},{"key":"key-10.1145\/2790798.2790807-12","doi-asserted-by":"crossref","unstructured":"G. C. Lan, T. P. Hong, V. S. Tseng, and S. L. Wang. Applying the maximum utility measure in high utility sequential pattern mining. Expert Systems with Applications, 41(11):5071--5081, 2014.","DOI":"10.1016\/j.eswa.2014.02.022"},{"key":"key-10.1145\/2790798.2790807-13","doi-asserted-by":"crossref","unstructured":"C. W. Lin, T. P. Hong, and W. H. Lu. The pre-fufp algorithm for incremental mining. Expert Systems with Applications, 36(5):9498--950, 2009.","DOI":"10.1016\/j.eswa.2008.03.014"},{"key":"key-10.1145\/2790798.2790807-14","doi-asserted-by":"crossref","unstructured":"C. W. Lin, T. P. Hong, and W. H. Lu. An effective tree structure for mining high utility itemsets. Expert Systems with Applications, 38(6):7419--7424, 2011.","DOI":"10.1016\/j.eswa.2010.12.082"},{"key":"key-10.1145\/2790798.2790807-15","doi-asserted-by":"crossref","unstructured":"B. Liu, W. Hsu, and Y. Ma. Mining association rules with multiple minimum supports. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 337--341, 1999.","DOI":"10.1145\/312129.312274"},{"key":"key-10.1145\/2790798.2790807-16","doi-asserted-by":"crossref","unstructured":"M. Liu and J. Qu. Mining high utility itemsets without candidate generation. ACM International Conference on Information and Knowledge Management, pages 55--64, 2012.","DOI":"10.1145\/2396761.2396773"},{"key":"key-10.1145\/2790798.2790807-17","doi-asserted-by":"crossref","unstructured":"Y. Liu, W. K. Liao, and A. Choudhary. A two-phase algorithm for fast discovery of high utility itemsets. Lecture Notes in Computer Science, 3518:689--695, 2005.","DOI":"10.1007\/11430919_79"},{"key":"key-10.1145\/2790798.2790807-18","doi-asserted-by":"crossref","unstructured":"Y. C. Liu, C. P. Cheng, and V. S. Tseng. Discovering relational-based association rules with multiple minimum supports on microarray datasets. Bioinformatics, 27(22):3142--3148, 2011.","DOI":"10.1093\/bioinformatics\/btr526"},{"key":"key-10.1145\/2790798.2790807-19","doi-asserted-by":"crossref","unstructured":"H. Ryang, U. Yun, and K. H. Ryu. Discovering high utility itemsets with multiple minimum supports. Intelligent Data Analysis, 18(6):1027--1047, 2014.","DOI":"10.3233\/IDA-140683"},{"key":"key-10.1145\/2790798.2790807-20","doi-asserted-by":"crossref","unstructured":"V. S. Tseng, B. E. Shie, C. W. Wu, and P. S. Yu. Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering, 25(8):1772--178, 2013.","DOI":"10.1109\/TKDE.2012.59"},{"key":"key-10.1145\/2790798.2790807-21","doi-asserted-by":"crossref","unstructured":"V. S. Tseng, C. W. Wu, B. E. Shie, and P. S. Yu. Up-growth: An efficient algorithm for high utility itemset mining. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 253--262, 2010.","DOI":"10.1145\/1835804.1835839"},{"key":"key-10.1145\/2790798.2790807-22","doi-asserted-by":"crossref","unstructured":"H. Yao and H. J. Hamilton. Mining itemset utilities from transaction databases. Data & Knowledge Engineering, 59(3):603--626, 2006.","DOI":"10.1016\/j.datak.2005.10.004"},{"key":"key-10.1145\/2790798.2790807-23","doi-asserted-by":"crossref","unstructured":"H. Yao, H. J. Hamilton, and C. J. Butz. A foundational approach to mining itemset utilities from databases. SIAM International Conference on Data Mining, pages 211--225, 2004.","DOI":"10.1137\/1.9781611972740.51"}],"event":{"number":"8","sponsor":["BytePress","Keio University"],"acronym":"C3S2E '15","name":"the Eighth International C* Conference","start":{"date-parts":[[2015,7,13]]},"location":"Yokohama, Japan","end":{"date-parts":[[2015,7,15]]}},"container-title":["Proceedings of the Eighth International C* Conference on Computer Science & Software Engineering - C3S2E '15"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790798.2790807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2790807&ftid=1617560&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:46Z","timestamp":1750223266000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2790798.2790807"}},"subtitle":[],"proceedings-subject":"Computer Science & Software Engineering","short-title":[],"issued":{"date-parts":[[2008]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1145\/2790798.2790807","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}