{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T19:55:30Z","timestamp":1770234930973,"version":"3.49.0"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"GIK Institute graduate program research"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021,4,1]]},"DOI":"10.1109\/tkde.2019.2945573","type":"journal-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T23:56:23Z","timestamp":1570492583000},"page":"1674-1691","source":"Crossref","is-referenced-by-count":35,"title":["On the Efficient Representation of Datasets as Graphs to Mine Maximal Frequent Itemsets"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-3483","authenticated-orcid":false,"given":"Zahid","family":"Halim","sequence":"first","affiliation":[]},{"given":"Omer","family":"Ali","sequence":"additional","affiliation":[]},{"given":"Muhammad","family":"Ghufran Khan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-018-9223-2"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2010.5569193"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2009-0369"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2437327"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.74"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2553-9_15"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCKE.2014.6993407"},{"key":"ref36","first-page":"269","article-title":"Graph based approach for finding frequent itemsets to discover association rules","volume":"3","author":"kant","year":"2013","journal-title":"International Journal of Engineering and Innovative Technology"},{"key":"ref35","first-page":"240","article-title":"Frequent pattern mining from dense graph streams","author":"cameron","year":"2014","journal-title":"Proc EDBT\/ICDT Workshops"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.01.025"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.074"},{"key":"ref62","first-page":"1","article-title":"Detailed description of an algorithm for enumeration of maximal frequent sets with irredundant dualization","author":"uno","year":"2003","journal-title":"Proc Workshop Frequent Itemset Mining Implementations"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.165"},{"key":"ref63","first-page":"307","article-title":"Fast discovery of association rules","author":"agrawal","year":"1996","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.01.062"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011656"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2007.41"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0178-1"},{"key":"ref66","first-page":"3389","article-title":"SPMF: A java open-source pattern mining library","volume":"15","author":"fournier-viger","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref29"},{"key":"ref67","first-page":"244","article-title":"The quest data mining system","author":"agrawal","year":"1996","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.04.043"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IRI.2004.1431488"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.125"},{"key":"ref20","first-page":"21","article-title":"CLOSET: An efficient algorithm for mining frequent closed itemsets","author":"pei","year":"2000","journal-title":"Proc 8th ACM SIGMOD Workshop Res Issues Data Mining Knowl Discovery"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557039"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989514"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.01.010"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0703-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914857"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.166"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2007.130"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1142\/S021821300800390X"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37453-1_2"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71701-0_8"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06483-3_8"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-53914-5_15"},{"key":"ref55","article-title":"Symbolic data mining methods with the coron platform","author":"szathmary","year":"2006"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.034"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-8681-6_31"},{"key":"ref52","first-page":"64","article-title":"GeneticMax: An efficient approach to mining maximal frequent itemsets based on genetic algorithms","volume":"3","author":"kabir","year":"2015","journal-title":"Inf Technol Industry"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0748-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.06.018"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32584-7_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2839752"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.03.041"},{"key":"ref14","first-page":"71","article-title":"Association rules mining: A recent overview","volume":"32","author":"kotsiantis","year":"2006","journal-title":"GESTS Int Trans Comput Sci Eng"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22729-0_5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2016.01.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.02.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1181"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024880713245"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2014.2359494"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691742"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0081-7"},{"key":"ref8","first-page":"487","article-title":"Fast algorithms for mining association rules","volume":"1215","author":"agrawal","year":"1994","journal-title":"Proc Int Conf Very Large Databases"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"ref49","article-title":"LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets","volume":"126","author":"uno","year":"2004","journal-title":"Proc Workshop Frequent Itemset Mining Implementations"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-014-0252-2"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0002-x"},{"key":"ref45","first-page":"570","article-title":"SmartMiner: A depth first algorithm guided by tail information for mining maximal frequent itemsets","author":"zou","year":"2002","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref48","article-title":"High performance mining of maximal frequent itemsets","volume":"16","author":"grahne","year":"2003","journal-title":"Proc 6th Int Workshop High Perform Data Mining"},{"key":"ref47","first-page":"385","article-title":"Mining maximal frequent itemsets by a boolean based approach","author":"salleb","year":"2002","journal-title":"Proc 15th Eur Conf Artif Intell"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-015-0345-6"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2013.09.006"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.03.004"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18032-8_50"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9371488\/08861155.pdf?arnumber=8861155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:52Z","timestamp":1652194252000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8861155\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,1]]},"references-count":70,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2945573","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,1]]}}}