{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:25:07Z","timestamp":1730233507704,"version":"3.28.0"},"reference-count":55,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1109\/icccnt51525.2021.9580115","type":"proceedings-article","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T19:29:48Z","timestamp":1635967788000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Significant Itemset Mining with Support-Attractiveness Framework"],"prefix":"10.1109","author":[{"given":"Subrata","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalyani","family":"Mali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1007\/s40747-020-00226-4"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/ACCESS.2020.2964682"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1111\/exsy.12551"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1016\/j.bdr.2020.100146"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1007\/s10462-018-9629-z"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1007\/s13369-020-05085-2"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/ACCESS.2021.3070132"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1007\/s10489-020-01899-7"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/ACCESS.2020.3029302"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/ACCESS.2021.3071777"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1007\/978-3-030-24322-7_53"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/ReTIS.2015.7232867"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/s10115-017-1103-8"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1002\/widm.1329"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1002\/widm.1207"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ICICCS51141.2021.9432237"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1080\/03772063.2020.1838343"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/312129.312274"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/ICDM.2003.1250944"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1016\/j.ins.2011.05.012"},{"key":"ref26","first-page":"141","article-title":"Mining and ranking association rules in support, confidence, correlation and dissociation framework","volume":"404","author":"datta","year":"2015","journal-title":"proc of 4th FICTA"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/j.sbspro.2011.11.022"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1016\/j.eswa.2020.114530"},{"key":"ref51","first-page":"658","article-title":"Statistical approach for mining frequent itemsets","volume":"1393","author":"mishra","year":"2021","journal-title":"ICAICR '20 CCIS"},{"key":"ref55","first-page":"36","article-title":"The SPMF open-source data mining library version 2","author":"fournier-viger","year":"9853","journal-title":"proc of PAKDD'16 part III"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1080\/02564602.2020.1819891"},{"key":"ref53","first-page":"208","article-title":"Parallelization of frequent itemset mining methods with FP-tree: An experiment with PrePost+ algorithm","volume":"18","author":"jamsheela","year":"2021","journal-title":"The International Arab Journal of Information Technology"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1109\/IICETA50496.2020.9318834"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.epidem.2018.05.007"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1007\/s11227-020-03190-5"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/j.chb.2016.07.035"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1287\/isre.2013.0512"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/j.is.2018.01.008"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/j.datak.2007.06.009"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/s00500-020-05229-4"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.23919\/FRUCT50888.2021.9347577"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/s40747-018-0085-9"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ICDM.2003.1250982"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/1117454.1117479"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/C3IT.2015.7060207"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1002\/widm.1074"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/1132960.1132963"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/240455.240464"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/s10115-020-01464-1"},{"key":"ref49","first-page":"330","article-title":"An extenstion of the Apriori algorithm for finding frequent itemsets","author":"karimtabar","year":"2020","journal-title":"proc of IEEE ICWR'20"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/170036.170072"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1371\/journal.pone.0194777"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1016\/j.eswa.2019.113046"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/WiSPNET.2017.8299993"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1016\/j.eswa.2020.113805"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1016\/j.cose.2020.101969"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.3233\/JIFS-179666"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/ICoAC.2017.7951761"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1016\/j.eswa.2019.113004"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1186\/s40537-020-00330-9"}],"event":{"name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","start":{"date-parts":[[2021,7,6]]},"location":"Kharagpur, India","end":{"date-parts":[[2021,7,8]]}},"container-title":["2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9579467\/9579470\/09580115.pdf?arnumber=9580115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:46Z","timestamp":1652201746000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9580115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/icccnt51525.2021.9580115","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]}}}