{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:07:32Z","timestamp":1775912852598,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icdm.2003.1250893","type":"proceedings-article","created":{"date-parts":[[2004,4,23]],"date-time":"2004-04-23T18:38:15Z","timestamp":1082745495000},"page":"19-26","source":"Crossref","is-referenced-by-count":180,"title":["Mining high utility itemsets"],"prefix":"10.1109","author":[{"family":"Raymond Chan","sequence":"first","affiliation":[]},{"family":"Qiang Yang","sequence":"additional","affiliation":[]},{"family":"Yi-Dong Shen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347166"},{"key":"ref11","article-title":"CLOSET: An efficient algorithm for mining frequent closed itemsets","author":"pei","year":"2000","journal-title":"ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45681-3_34","article-title":"Answering the most correlated N association rules efficiently","author":"sese","year":"2002","journal-title":"Proceedings of 6th European Conference on Principles of Data Mining and Knowledge Discovery"},{"key":"ref13","article-title":"Objective-oriented utility-based association mining","author":"shen","year":"2002","journal-title":"Proc of the IEEE Int Conf on Data Mining"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/69.553165"},{"key":"ref15","article-title":"Mining association rules with item constraints","author":"srikant","year":"1997","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347112"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63223-9_108","article-title":"An algorithm for multi-relational discovery of subgroups","author":"wrobel","year":"1997","journal-title":"First European Symposium on Principles of Data Mining and Knowledge Discovery"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754924"},{"key":"ref6","article-title":"Mining top-k frequent closed patterns without minimum support","author":"han","year":"2002","journal-title":"Proc of the IEEE Int Conf on Data Mtninz"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276307"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/5254.889106"},{"key":"ref2","article-title":"Fast algorithm for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc of the 20th Int Conf on Very Large Databases"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref9","article-title":"Discov-ering frequent closed itemsets for association rules","author":"pasquier","year":"1999","journal-title":"Proc 7th Int Conf Database Theory"}],"event":{"name":"Third IEEE International Conference on Data Mining","location":"Melbourne, FL, USA","acronym":"ICDM-03"},"container-title":["Third IEEE International Conference on Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8854\/27998\/01250893.pdf?arnumber=1250893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T06:22:47Z","timestamp":1497594167000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250893\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icdm.2003.1250893","relation":{},"subject":[]}}