Data mining techniques are useful in discovering hidden knowledge from large databases. One of its common techniques is sequential rule mining. A sequential rule (SR) helps in finding all sequential rules that achieved support and confidence threshold for help in prediction. It is an alternative to sequential pattern mining in that it takes the probability of the following patterns into account. In this paper, we address the preferable utilization of sequential rule mining algorithms by applying them to databases with different features for improving the efficiency in different fields of application. The three compared algorithms are the TRuleGrowth algorithm, which is an extension sequential rule algorithm of RuleGrowth; the top-k non-redundant sequential rules algorithm (TNS); and a non-redundant dynamic bit vector (NRD-DBV). The analysis compares the three algorithms regarding the run time, the number of produced rules, and the used memory to nominate which of them is best suited in prediction. Additionally, it explores the most suitable applications for each algorithm to improve the efficiency. The experimental results proved that the performance of the algorithms appears related to the dataset characteristics. It has been demonstrated that altering the window size constraint, determining the number of created rules, or changing the value of the minSup threshold can reduce execution time and control the number of valid rules generated.
4 November 2021 in IJCI. International Journal of Computers and Information
The COVID-19 (Coronavirus) is a catastrophic disease, as it causes a global health crisis. Due to the nature of COVID-19, it spreads quickly among humans and infects millions of people within a few periods in the world. It is critical to detect the behavior of COVID-19 and the speed of its mutating rapidly for better improvement of medications and assists patients in preventing the progression of the disease. This paper examines the discovery of additional information and interest patterns in COVID-19 genome sequences through using non-redundant sequential rule mining from both frequent closed dynamic bit vector and sequential generator patterns simultaneously. It helps to discover nucleotide rules and make the prediction of the next one. Almost all genotyping tests are partial, time-consuming, and involve multi-step processes. So, we implement a parallel approach to produce the sequential rules in less time required. Our experimental results show that; the proposed PNRD-CloGen algorithm improves the efficiency of prevention procedures and reducing the runtime needed to produce the sequential rules. It also helps to monitor the strain progression of COVID-19 sequentially and enhance clinical management.