{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:16Z","timestamp":1740169156148,"version":"3.37.3"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2959878","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:34:11Z","timestamp":1576542851000},"page":"181688-181705","source":"Crossref","is-referenced-by-count":7,"title":["TRICE: Mining Frequent Itemsets by Iterative TRimmed Transaction LattICE in Sparse Big Data"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2211-8360","authenticated-orcid":false,"given":"Muhammad","family":"Yasir","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6366-8230","authenticated-orcid":false,"given":"Muhammad Asif","family":"Habib","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8781-4143","authenticated-orcid":false,"given":"Muhammad","family":"Ashraf","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3074-9162","authenticated-orcid":false,"given":"Shahzad","family":"Sarwar","sequence":"additional","affiliation":[]},{"given":"Muhammad Umar","family":"Chaudhry","sequence":"additional","affiliation":[]},{"given":"Hamayoun","family":"Shahwani","sequence":"additional","affiliation":[]},{"given":"Mudassar","family":"Ahmad","sequence":"additional","affiliation":[]},{"given":"Ch.","family":"Muhammad Nadeem Faisal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276307"},{"key":"ref38","first-page":"67","article-title":"Mining association rules with item constraints","volume":"97","author":"srikant","year":"1997","journal-title":"Proc KDD"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.5755\/j01.itc.48.3.21137"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1089\/big.2013.0037"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0517-y"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2013.6574675"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276335"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1997.581756"},{"key":"ref35","first-page":"1203","author":"garcia-molina","year":"2009","journal-title":"Database Systems The Complete Book"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05179-1_16"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-014-0252-2"},{"key":"ref62","first-page":"968","article-title":"SaM: A split and merge algorithm for fuzzy frequent item set mining","author":"borgelt","year":"2009","journal-title":"Proc IFSA\/EUSFLAT Conf"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133914"},{"journal-title":"The spmf open-source data mining library version 2","year":"2016","author":"fournier-viger","key":"ref63"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3108936"},{"journal-title":"ExtendedBakery–Datasets","year":"2009","author":"dekhtyar","key":"ref64"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/9245392"},{"journal-title":"A Few Data Mining Algorithms in Pure Python","year":"2015","author":"dagenais","key":"ref65"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2015.120"},{"key":"ref2","first-page":"1","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf Very Large Data Bases (VLDB)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1186\/s13673-016-0064-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/WKDD.2008.48"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2007.4370490"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cageo.2016.10.003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2007.33"},{"key":"ref25","first-page":"204","author":"anand","year":"2014","journal-title":"Mining of Massive Datasets"},{"key":"ref50","first-page":"134","article-title":"Sampling large databases for association rules","author":"toivonen","year":"1996","journal-title":"Proc 22th Int Conf Very Large Data Bases"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253325"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2008.03.011"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.03.004"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.01.025"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-012-4638-z"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1080\/18756891.2010.9727736"},{"key":"ref54","article-title":"High performance frequent patterns extraction using compressed FP-tree","author":"gopalan","year":"2004","journal-title":"Proc SIAM Int Workshop High Perform Distrib Mining"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2015.10.001"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2004.04.010"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.064"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.11.031"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/191246.191314"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2016.11.010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1980022.1980315"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0122508"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.2006.873753"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-014-1408-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.08.028"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51281-5_44"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2187306"},{"key":"ref4","first-page":"47","article-title":"Discovery of spatial association rules in geographic information databases","author":"koperski","year":"1995","journal-title":"Proc Int l Symp Spatial Databases"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-012-1007-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/cp:20070390"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.150"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2006.08.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2012.02.003"},{"key":"ref49","first-page":"257","article-title":"An algorithm for mining association rules using perfect hashing and database pruning","author":"ozel","year":"2001","journal-title":"Proc Turkish Symp Artif Intell Neural Netw"},{"key":"ref9","article-title":"Smart retail 4.0 IoT consumer retailer model for retail intelligence and strategic marketing of in-store products","author":"jayaram","year":"2017","journal-title":"Proc 17th Int Bus Horizon-INBUSH ERA"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335376"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223813"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956788"},{"key":"ref42","first-page":"432","article-title":"An efficient algorithm for mining association rules in large databases","volume":"5","author":"savasere","year":"1995","journal-title":"Proc Int Conf Very Large Data Bases (VLDB)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839450"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.183"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08933017.pdf?arnumber=8933017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T02:01:47Z","timestamp":1643248907000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8933017\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2959878","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}