{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:32Z","timestamp":1740169352784,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3350737","type":"journal-article","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T19:57:22Z","timestamp":1704743842000},"page":"6281-6297","source":"Crossref","is-referenced-by-count":0,"title":["WBIN-Tree: A Single Scan Based Complete, Compact and Abstract Tree for Discovering Rare and Frequent Itemset Using Parallel Technique"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5714-2611","authenticated-orcid":false,"given":"Shwetha","family":"Rai","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0736-7687","authenticated-orcid":false,"given":"Preetham","family":"Kumar","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Technology, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4842-211X","authenticated-orcid":false,"given":"K. Nakul","family":"Shetty","sequence":"additional","affiliation":[{"name":"Department of Electronics and Communication Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6150-7601","authenticated-orcid":false,"given":"M.","family":"Geetha","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2195-7050","authenticated-orcid":false,"given":"B.","family":"Giridhar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.5121\/csit.2014.4807"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.01.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-018-9629-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.18178\/ijmlc.2021.11.3.1037"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105824"},{"key":"ref6","first-page":"487","article-title":"Fast algorithms for mining association rules","volume-title":"Proc. Int. Conf. Very Large Data Bases","volume":"1215","author":"Agrawal"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.30919\/es8d731"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.30919\/es8d602"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3389\/fendo.2022.939367"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/6849017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/6503402"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.010"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-1812-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.01.046"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-020-02237-y"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44918-8_3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ssci.2022.106014"},{"journal-title":"A Probabilistic Comparison of Commonly Used Interest Measures for Association Rules","year":"2023","author":"Hahsler","key":"ref19"},{"key":"ref20","first-page":"2524","article-title":"A new perfect hashing and pruning algorithm for mining association rule","volume":"4","author":"Najadat","year":"2011","journal-title":"Commun. IBIMA"},{"key":"ref21","first-page":"367","article-title":"An efficient discovery of frequent concepts using weighted count tree","volume":"539","author":"Geetha","year":"2012","journal-title":"Inst. Comput. Sci., Social Informat. Telecommun. Eng."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41920-6_30"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2880275"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-018-0752-x"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2943015"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01222-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956788"},{"key":"ref28","first-page":"4477","article-title":"Postdiffset algorithm in rare pattern: An implementation via benchmark case study","volume":"8","author":"Man","year":"2018","journal-title":"Int. J. Electr. Comput. Eng."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.11591\/ijece.v9i6.pp5446-5453"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2007.30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115603"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115898"},{"key":"ref33","article-title":"F-tree: An algorithm for clustering transactional data using frequency tree","author":"Mahdi","year":"2017","journal-title":"arXiv:1705.00761"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-019-1043-x"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3179592"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2008.03.013"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9226-0_5"},{"volume-title":"Real Breast Cancer Data","year":"2023","key":"ref40"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-018-0759-3"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0887-x"},{"volume-title":"Gminer","year":"2023","author":"Agrawal","key":"ref43"},{"volume-title":"Frontier Expansion","year":"2023","key":"ref44"},{"key":"ref45","article-title":"Association rule mining-based radiomics in breast cancer diagnosis","author":"Jajroudi","year":"2023","journal-title":"Iranian J. Med. Phys."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2020.3015236"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1001\/jamasurg.2022.8388"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10382523.pdf?arnumber=10382523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T01:28:48Z","timestamp":1705541328000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10382523\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3350737","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}