A multithreaded hybrid framework for mining frequent itemsets

Jashma Suresh Ponmudiyan Poovan, Dinesh Acharya Udupi, Nandanavana Veerappareddy Subba Reddy

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Mining frequent itemsets is an area of data mining that has beguiled several researchers in recent years. Varied data structures such as Nodesets, DiffNodesets, NegNodesets, N-lists, and Diffsets are among a few that were employed to extract frequent items. However, most of these approaches fell short either in respect of run time or memory. Hybrid frameworks were formulated to repress these issues that encompass the deployment of two or more data structures to facilitate effective mining of frequent itemsets. Such an approach aims to exploit the advantages of either of the data structures while mitigating the problems of relying on either of them alone. However, limited efforts have been made to reinforce the efficiency of such frameworks. To address these issues this paper proposes a novel multithreaded hybrid framework comprising of NegNodesets and N-list structure that uses the multicore feature of today's processors. While NegNodesets offer a concise representation of itemsets, N-lists rely on List intersection thereby speeding up the mining process. To optimize the extraction of frequent items a hash-based algorithm has been designed here to extract the resultant set of frequent items which further enhances the novelty of the framework.

Original languageEnglish
Pages (from-to)3249-3264
Number of pages16
JournalInternational Journal of Electrical and Computer Engineering
Issue number3
Publication statusPublished - 2022

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Electrical and Electronic Engineering


Dive into the research topics of 'A multithreaded hybrid framework for mining frequent itemsets'. Together they form a unique fingerprint.

Cite this