{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:30:54Z","timestamp":1775010654024,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503092"],"award-info":[{"award-number":["61503092"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012156","name":"Shenzhen Technical Project","doi-asserted-by":"crossref","award":["JCYJ20170307151733005"],"award-info":[{"award-number":["JCYJ20170307151733005"]}],"id":[{"id":"10.13039\/501100012156","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science Research Project of Guangdong Province","award":["2017A020220011"],"award-info":[{"award-number":["2017A020220011"]}]},{"name":"National Science Funding of Guangdong Province","award":["2016A030313659"],"award-info":[{"award-number":["2016A030313659"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2801261","type":"journal-article","created":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T14:20:00Z","timestamp":1517581200000},"page":"7593-7609","source":"Crossref","is-referenced-by-count":39,"title":["MEMU: More Efficient Algorithm to Mine High Average-Utility Patterns With Multiple Minimum Average-Utility Thresholds"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8768-9709","authenticated-orcid":false,"given":"Jerry Chun-Wei","family":"Lin","sequence":"first","affiliation":[]},{"given":"Shifeng","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774436"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-160811"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2159-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2717438"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0991-3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2510012"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.001"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","article-title":"Fast and memory efficient mining of frequent closed itemsets","volume":"18","author":"pasquier","year":"2006","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0896-1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44403-1_5"},{"key":"ref40","first-page":"363","article-title":"Core vector machines: Fast SVM training on very large data sets","volume":"6","author":"tsang","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2004.09.007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.01.006"},{"key":"ref14","year":"1996","journal-title":"Quest synthetic data generation code"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.11.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0750-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312274"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1089827.1089839"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.10"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2016.04.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.09.013"},{"key":"ref3","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th ACM-SIAM Symp Discrete Algorithms Soc Ind Appl Math"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41561-1_2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.05.066"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.08.022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_50"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref9","first-page":"36","article-title":"The SPMF open-source data mining library version 2 and beyond","author":"fournier-viger","year":"2016","journal-title":"Proc Eur Conf Mach Learn Principles Pract Knowl Discovery"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.009"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.03.016"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956788"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12145-6_14"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2345377"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45237-0_5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0219622012500307"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.51"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.aei.2016.02.003","article-title":"Fast algorithms for mining high-utility itemsets with various discount strategies","volume":"30","author":"lin","year":"2016","journal-title":"Adv Eng Informat"},{"key":"ref43","first-page":"1","article-title":"Efficient mining algorithms for frequent\/closed\/maximal itemsets","author":"uno","year":"2004","journal-title":"Proc IEEE ICDM Workshop Frequent Itemset Mining Implement"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.10.049"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08279384.pdf?arnumber=8279384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:48Z","timestamp":1641987588000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8279384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2801261","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}