{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:17:40Z","timestamp":1740169060035,"version":"3.37.3"},"reference-count":40,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2017.2788083","type":"journal-article","created":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T22:51:52Z","timestamp":1515106312000},"page":"14389-14409","source":"Crossref","is-referenced-by-count":10,"title":["Selective Database Projections Based Approach for Mining High-Utility Itemsets"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1062-6870","authenticated-orcid":false,"given":"Anita","family":"Bai","sequence":"first","affiliation":[]},{"given":"Parag S.","family":"Deshpande","sequence":"additional","affiliation":[]},{"given":"Meera","family":"Dhabu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29166-1_3"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2014.891839"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/ICA-2010-0340","article-title":"Mining quantitative association rules based on evolutionary computation and its application to atmospheric pollution","volume":"17","author":"martinez-ballesteros","year":"2010","journal-title":"Integr Comput -Aided Eng"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835839"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.12.082"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.10.027"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.07.006"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","article-title":"A binary PSO approach to mine high-utility itemsets","volume":"21","author":"lin","year":"2016","journal-title":"Soft Comput"},{"key":"ref34","first-page":"1035","article-title":"QuantMiner: A genetic algorithm for mining quantitative association rules","volume":"7","author":"salleb-aouissi","year":"2007","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2014.08.003"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.183"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20149-3_18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339546"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.045"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2458860"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250893"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2717438"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2702281"},{"key":"ref19","first-page":"616","article-title":"A one-phase method for mining high utility mobile sequential patterns in mobile commerce environments","author":"shie","year":"2012","journal-title":"Proc Int Conf Ind Eng Other Appl Appl Intell Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2510012"},{"key":"ref4","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","volume":"1215","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf Very Large Data Bases (VLDB)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.20"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn490"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-540-74553-2_26","article-title":"Mining high utility quantitative association rules","author":"yen","year":"2007","journal-title":"Proc Int Conf on Data Warehousing and Knowledge Discovery"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.51"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"ref2","first-page":"11","article-title":"Frequent itemset based hierarchical document clustering using Wikipedia as external knowledge","author":"kiran","year":"2010","journal-title":"Proc Int Conf Knowl -Based Intell Inf Eng Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.10.004"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.13053\/rcs-90-1-28","article-title":"Staged approach for grammatical gender identification of nouns using association rule mining and classification","volume":"90","author":"desai","year":"2015","journal-title":"Res Comput Sci"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0492-y"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"ref21","first-page":"689","article-title":"A two-phase algorithm for fast discovery of high utility itemsets","author":"liu","year":"2005","journal-title":"Proc Knowledge Discovery and Data Mining Conf"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.11.001"},{"key":"ref23","first-page":"83","article-title":"FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning","author":"fournier-viger","year":"2014","journal-title":"Proc Int Symp Methodol Intell Syst"},{"key":"ref26","first-page":"530","article-title":"EFIM: A highly efficient algorithm for high-utility itemset mining","author":"zida","year":"2015","journal-title":"Proc Mexican Int Conf Artif Intell"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08246497.pdf?arnumber=8246497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T05:41:30Z","timestamp":1643175690000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8246497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2788083","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}