{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T10:58:25Z","timestamp":1785927505542,"version":"3.56.0"},"reference-count":40,"publisher":"MDPI AG","issue":"20","license":[{"start":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T00:00:00Z","timestamp":1666310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Internet of Things (IoT)-backed smart shopping carts are generating an extensive amount of data in shopping markets around the world. This data can be cleaned and utilized for setting business goals and strategies. Artificial intelligence (AI) methods are used to efficiently extract meaningful patterns or insights from such huge amounts of data or big data. One such technique is Association Rule Mining (ARM) which is used to extract strategic information from the data. The crucial step in ARM is Frequent Itemsets Mining (FIM) followed by association rule generation. The FIM process starts by tuning the support threshold parameter from the user to produce the number of required frequent patterns. To perform the FIM process, the user applies hit and trial methods to rerun the aforesaid routine in order to receive the required number of patterns. The research community has shifted its focus towards the development of top-K most frequent patterns not using the support threshold parameter tuned by the user. Top-K most frequent patterns mining is considered a harder task than user-tuned support-threshold-based FIM. One of the reasons why top-K most frequent patterns mining techniques are computationally intensive is the fact that they produce a large number of candidate itemsets. These methods also do not use any explicit pruning mechanism apart from the internally auto-maintained support threshold parameter. Therefore, we propose an efficient TKIFIs Miner algorithm that uses depth-first search strategy for top-K identical frequent patterns mining. The TKIFIs Miner uses specialized one- and two-itemsets-based pruning techniques for topmost patterns mining. Comparative analysis is performed on special benchmark datasets, for example, Retail with 16,469 items, T40I10D100K and T10I4D100K with 1000 items each, etc. The evaluation results have proven that the TKIFIs Miner is at the top of the line, compared to recently available topmost patterns mining methods not using the support threshold parameter.<\/jats:p>","DOI":"10.3390\/s22208063","type":"journal-article","created":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T10:09:23Z","timestamp":1666606163000},"page":"8063","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Top-K Identical Frequent Itemsets Mining without Support Threshold Parameter from Transactional Datasets Produced by IoT-Based Smart Shopping Carts"],"prefix":"10.3390","volume":"22","author":[{"given":"Saif Ur","family":"Rehman","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Peshawar, Peshawar 25120, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3265-0297","authenticated-orcid":false,"given":"Noha","family":"Alnazzawi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Yanbu Industrial College, Royal Commission for Jubail and Yanbu, Yanbu Industrial City 41912, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0944-9878","authenticated-orcid":false,"given":"Jawad","family":"Ashraf","sequence":"additional","affiliation":[{"name":"Institute of Computing, Kohat University of Science and Technology, Kohat 26000, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javed","family":"Iqbal","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Peshawar, Peshawar 25120, Pakistan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shafiullah","family":"Khan","sequence":"additional","affiliation":[{"name":"Faculty of Computer and Software Engineering, Huaiyin Institute of Technology, Huai\u2019an 233003, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"key":"ref_1","first-page":"291","article-title":"A survey on Internet of Things architectures","volume":"30","author":"Ray","year":"2018","journal-title":"J. King Saud Univ.-Comput. Inf. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1109\/COMST.2021.3067354","article-title":"A Survey on Standards for Interoperability and Security in the Internet of Things","volume":"23","author":"Lee","year":"2021","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"9555","DOI":"10.1007\/s12652-020-02696-3","article-title":"A distributed ensemble design based intrusion detection system using fog computing to protect the internet of things networks","volume":"12","author":"Kumar","year":"2021","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kumar, P., Tripathi, R., and Gupta, G.P. (2021, January 5\u20138). P2IDF: A privacy-preserving based intrusion detection framework for software defined Internet of Things-fog (SDIoT-Fog). Proceedings of the 2021 International Conference on Distributed Computing and Networking, Nara, Japan.","DOI":"10.1145\/3427477.3429989"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.3103\/S0146411621020085","article-title":"Design of anomaly-based intrusion detection system using fog computing for IoT network","volume":"55","author":"Kumar","year":"2021","journal-title":"Autom. Control Comput. Sci."},{"key":"ref_6","unstructured":"Vilmos, A., Medaglia, C., and Moroni, A. (2011). NFC Technology and its application Scenarios in a future of IOT. Stolpan Proj., 1\u201321."},{"key":"ref_7","first-page":"480","article-title":"Machine-to-machine communications: Architectures, standards and applications","volume":"6","author":"Chen","year":"2012","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"68426","DOI":"10.1109\/ACCESS.2020.2986681","article-title":"IoT-based smart shopping cart using radio frequency identification","volume":"8","author":"Shahroz","year":"2020","journal-title":"IEEE Access"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Wang, Z., Liang, W., Zhang, Y., Wang, J., Tao, J., Chen, C., Yan, H., and Men, T. (2019, January 8\u201310). Data mining in IoT era: A method based on improved frequent items mining algorithm. Proceedings of the 2019 5th International Conference on Big Data and Information Analytics (BigDIA), Kunming, China.","DOI":"10.1109\/BigDIA.2019.8802727"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"431047","DOI":"10.1155\/2015\/431047","article-title":"Data Mining for the Internet of Things: Literature Review and Challenges","volume":"11","author":"Chen","year":"2015","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Kireev, V.S., Guseva, A.I., Bochkaryov, P.V., Kuznetsov, I.A., and Filippov, S.A. (2018). Association rules mining for predictive analytics in IoT cloud system. Biologically Inspired Cognitive Architectures Meeting, Springer.","DOI":"10.1007\/978-3-319-99316-4_14"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., and Swami, A. (1993, January 25\u201328). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA.","DOI":"10.1145\/170035.170072"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"4515","DOI":"10.1007\/s10489-018-1231-1","article-title":"Observation of sales trends by mining emerging patterns in dynamic markets","volume":"48","author":"Weng","year":"2018","journal-title":"Appl. Intell."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"252797","DOI":"10.1155\/2014\/252797","article-title":"FraudMiner: A Novel Credit Card Fraud Detection Model Based on Frequent Itemset Mining","volume":"2014","author":"Seeja","year":"2014","journal-title":"Sci. World J."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1016\/j.comnet.2005.10.018","article-title":"DSM-PLW: Single-pass mining of path traversal patterns over streaming Web click-sequences","volume":"50","author":"Li","year":"2006","journal-title":"Comput. Netw."},{"key":"ref_16","first-page":"493","article-title":"Detecting and diagnosing a disease by patient monitoring system","volume":"2","author":"Chaudhary","year":"2014","journal-title":"Int. J. Mech. Eng. Inf. Technol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3212","DOI":"10.1109\/TKDE.2020.2967722","article-title":"Discovering Relaxed Functional Dependencies Based on Multi-Attribute Dominance","volume":"33","author":"Caruccio","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Papenbrock, T., and Naumann, F. (July, January 26). A hybrid approach to functional dependency discovery. Proceedings of the 2016 International Conference on Management of Data, San Francisco, CA, USA.","DOI":"10.1145\/2882903.2915203"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Wei, Z., and Link, S. (2019, January 8\u201311). Discovery and ranking of functional dependencies. Proceedings of the 2019 IEEE 35th International Conference on Data Engineering (ICDE), Macao, China.","DOI":"10.1109\/ICDE.2019.00137"},{"key":"ref_20","unstructured":"Asmat, N., Rehman, S.U., Ashraf, J., and Habib, A. (2015, January 20\u201321). Maximal frequent itemsets based hierarchical strategy for document clustering. Proceedings of the International Conference on Computer Science, Data Mining and Mechanical Engineering (ICCDMME\u20192015), Bangkok, Thailand."},{"key":"ref_21","unstructured":"Ashraf, J., Ahmed, S., and Ahsan, M. (2016, January 5\u20136). A review on support threshold free frequent itemsets mining approaches. Proceedings of the 2016 19th International Multi-Topic Conference (INMIC), Islamabad, Pakistan."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s10489-013-0506-9","article-title":"Mining top-k frequent patterns with combination reducing techniques","volume":"41","author":"Pyun","year":"2014","journal-title":"Appl. Intell."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","article-title":"Mining top-k frequent patterns in the presence of the memory constraint","volume":"17","author":"Chuang","year":"2008","journal-title":"VLDB J."},{"key":"ref_24","unstructured":"Fu, A.W.-C., Kwong, R.W.-W., and Tang, J. (2000, January 11\u201314). Mining n-most interesting itemsets. Proceedings of the International Symposium on Methodologies for Intelligent Systems, Charlotte, NC, USA."},{"key":"ref_25","unstructured":"Han, J., Wang, J., Lu, Y., and Tzvetkov, P. (2002, January 9\u201312). Mining top-k frequent closed patterns without minimum support. Proceedings of the 2002 IEEE International Conference on Data Mining, Maebashi City, Japan."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"e385","DOI":"10.7717\/peerj-cs.385","article-title":"TKFIM: Top-K frequent itemset mining technique based on equivalence classes","volume":"7","author":"Iqbal","year":"2021","journal-title":"PeerJ Comput. Sci."},{"key":"ref_27","first-page":"88","article-title":"Mining N-most interesting itemsets without support threshold by the COFI-tree","volume":"1","author":"Ngan","year":"2005","journal-title":"Int. J. Bus. Intell. Data Min."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Quang, T.M., Oyanagi, S., and Yamazaki, K. (2006, January 14\u201316). ExMiner: An efficient algorithm for mining top-k frequent patterns. Proceedings of the International Conference on Advanced Data Mining and Applications, Xi\u2019an, China.","DOI":"10.1007\/11811305_48"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10115-015-0907-7","article-title":"Top-K Miner: Top-K identical frequent itemsets discovery without user support threshold","volume":"48","author":"Rehman","year":"2016","journal-title":"Knowl. Inf. Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-010-0363-3","article-title":"Mining top\u2212 k frequent patterns without minimum support threshold","volume":"30","author":"Salam","year":"2012","journal-title":"Knowl. Inf. Syst."},{"key":"ref_31","unstructured":"Ebecken, N.F.F. (1998). Finding the N largest itemsets. Transactions on Information and Communications Technologies, WIT Press."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","article-title":"Mining frequent itemsets without support threshold: With and without item constraints","volume":"16","author":"Cheung","year":"2004","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_33","unstructured":"Saxena, A.S., Dawar, S., Goyal, V., and Bera, D. (2019). Mining Top-k Trajectory-Patterns from Anonymized Data. arXiv."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Zeng, J., Yan, X., Han, M., and Tang, B. (2021, January 19\u201322). Fast core-based top-k frequent pattern discovery in knowledge graphs. Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE), Chania, Greece.","DOI":"10.1109\/ICDE51399.2021.00086"},{"key":"ref_35","unstructured":"Schirmer, P., Papenbrock, T., Kruse, S., Naumann, F., Hempfing, D., Mayer, T., and Neusch\u00e4fer-Rube, D. (2019, January 26\u201329). DynFD: Functional Dependency Discovery in Dynamic Datasets. Proceedings of the 22nd International Conference on Extending Database Technology, Lisbon, Portugal."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.14778\/3401960.3401965","article-title":"Fast incremental discovery of pointwise order dependencies","volume":"13","author":"Tan","year":"2020","journal-title":"Proc. VLDB Endow."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., and Gouda, K. (2003, January 24\u201327). Fast vertical mining using diffsets. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/956750.956788"},{"key":"ref_38","unstructured":"Asuncion, A., and Newman, D. (2007). UCI Machine Learning Repository."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Goethals, B. (2003, January 19). Frequent itemset mining dataset repository. Proceedings of the EEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI\u201903), Melbourne, FL, USA.","DOI":"10.1145\/967900.968012"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","article-title":"Mining frequent patterns without candidate generation","volume":"29","author":"Han","year":"2000","journal-title":"ACM Sigmod Rec."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/20\/8063\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:59:09Z","timestamp":1760144349000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/22\/20\/8063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,21]]},"references-count":40,"journal-issue":{"issue":"20","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["s22208063"],"URL":"https:\/\/doi.org\/10.3390\/s22208063","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,21]]}}}