Different Types Of Datasets Research Articles

Bio-Optimization of Deep Learning Network Architectures

Deep learning is reaching new heights as a result of its cutting-edge performance in a variety of fields, including computer vision, natural language processing, time series analysis, and healthcare. Deep learning is implemented using batch and stochastic gradient descent methods, as well as a few optimizers; however, this led to subpar model performance. However, there is now a lot of effort being done to improve deep learning’s performance using gradient optimization methods. The suggested work analyses convolutional neural networks (CNN) and deep neural networks (DNN) using several cutting-edge optimizers to enhance the performance of architectures. This work uses specific optimizers (SGD, RMSprop, Adam, Adadelta, etc.) to enhance the performance of designs using different types of datasets for result matching. A thorough report on the optimizers’ performance across a variety of architectures and datasets finishes the study effort. This research will be helpful to researchers in developing their framework and appropriate architecture optimizers. The proposed work involves eight new optimizers using four CNN and DNN architectures. The experimental results exploit breakthrough results for improving the efficiency of CNN and DNN architectures using various datasets.

Intelligent Multi-Strategy Hybrid Fuzzy K-Nearest Neighbor Using Improved Hybrid Sine Cosine Algorithm

The sine and cosine algorithm is a new simple and effective population optimization method proposed in recent years that has been studied in many works of literature. Based on the basic principle of the sine and cosine algorithm, this paper fully studies the main parameters affecting the performance of the sine and cosine algorithm, integrates the reverse learning algorithm, adds an elite opposition solution and forms the hybrid sine and cosine algorithm (hybrid SCA). Combined with the fuzzy k-nearest neighbor method and the hybrid SCA, this paper numerically simulates two-class datasets and multi-class datasets, obtains a large number of numerical results and analyzes the results. The hybrid SCA FKNN proposed in this paper has achieved good accuracy in classification and prediction results under 10 different types of data sets. Compared with SCA FKNN, LSCA FKNN, BA FKNN, PSO FKNN and SSA FKNN, the prediction accuracy is significantly improved. In the Wilcoxon signed rank test with SCA FKNN and LSCA FKNN, the zero hypothesis (significance level 0.05) is rejected and the two classifiers have a significantly different accuracy.

A Comparative Study of the Argo‐Era Ocean Heat Content Among Four Different Types of Data Sets

AbstractWe conducted a comparative study of ocean heat content (OHC) in the top 2,000 m during the Argo‐era using 12 latest and representative global ocean data sets. The differences in the global and basins‐wide OHC trends were minor among the observation‐based data sets, and remarkable among the ocean reanalyzes (RAs). Some RAs might exhibit much higher or lower basins‐wide warming rates than the observation‐based data sets. In the top 700 m, RAs suggested similar large‐scale warming and cooling patterns, in agreement with the observation‐based data sets. Below 700 m, the major warming and cooling features were significantly different between RAs and the observation‐based data sets. All data sets suffered from relatively larger uncertainties in the highly dynamic regions. Special caution is suggested when estimating the OHC using only a single data set, especially a RA. Differences of RAs' OHC from observation‐based data sets were significantly reduced when considering their ensemble mean, to be further confirmed with a larger sample of data sets.

Possibilities and Limitations of Kinematically Identifying Stars from Accreted Ultra-faint Dwarf Galaxies

The Milky Way has accreted many ultra-faint dwarf galaxies (UFDs), and stars from these galaxies can be found throughout our Galaxy today. Studying these stars provides insight into galaxy formation and early chemical enrichment, but identifying them is difficult. Clustering stellar dynamics in 4D phase space (E, L z , J r , J z ) is one method of identifying accreted structure that is currently being utilized in the search for accreted UFDs. We produce 32 simulated stellar halos using particle tagging with the Caterpillar simulation suite and thoroughly test the abilities of different clustering algorithms to recover tidally disrupted UFD remnants. We perform over 10,000 clustering runs, testing seven clustering algorithms, roughly twenty hyperparameter choices per algorithm, and six different types of data sets each with up to 32 simulated samples. Of the seven algorithms, HDBSCAN most consistently balances UFD recovery rates and cluster realness rates. We find that, even in highly idealized cases, the vast majority of clusters found by clustering algorithms do not correspond to real accreted UFD remnants and we can generally only recover 6% of UFDs remnants at best. These results focus exclusively on groups of stars from UFDs, which have weak dynamic signatures compared to the background of other stars. The recoverable UFD remnants are those that accreted recently, z accretion ≲ 0.5. Based on these results, we make recommendations to help guide the search for dynamically linked clusters of UFD stars in observational data. We find that real clusters generally have higher median energy and J r , providing a way to help identify real versus fake clusters. We also recommend incorporating chemical tagging as a way to improve clustering results.

A new network-based community detection algorithm for disjoint communities

A community is a group of people that shares something in common. The definition of the community can be generalized as things that have common properties. By using this definition, community detection can be used to solve different problems in various areas. In this study, we propose a new network-based community detection algorithm that can work on different types of datasets. The proposed algorithm works on unweighted graphs and determines the weight by using cosine similarity. We apply a bottom-up approach and find the disjoint communities. First, we accept each node as an independent community. Then, the merging process is applied by using the modularity value as a stopping criterion. We use real datasets and evaluate the algorithm with modularity, normalized mutual information, and performance metrics. In addition, we test our algorithm by using central nodes. We also take into consideration the number of communities in the case they are known. The proposed algorithm has high modularity and accuracy in different datasets.

Crop Health Card for Plant Diseases

Abstract: Farmers have difficulty identifying, detecting, and treating plant diseases and their causes. Fruits are more susceptible to disease depending on the season and environmental conditions in which they grow during cultivation. The traditional method of predicting disease in fruits and plants is extremely difficult. Using the proposed model, a large dataset of different types of fruits and their diseases can be created, with a large number of images stored in different folders for processing the data set. Each data set is labeled with the type of disease and the affected fruit. This system is simple to train and test. Artificial Neural Networks are used to learn and categorize fruits and diseases. The proposed model can detect disease accurately and provide farmers with preventive measures and recommendations. Farmers all over the world will benefit from this system

Online and offline streaming feature selection methods with bat algorithm for redundancy analysis

Streaming feature selection (SFS), is the task of selecting the most informative features in dealing with high-dimensional or incrementally growing problems. Several SFS algorithms have been proposed in the literature. However, they do not consider all feature subsets at the redundancy analysis step due to computational concerns. Moreover, they do not reconsider previously removed features which leads to losing most of the useful information. In this paper, the redundancy analysis step is defined as a binary optimization problem. Then, a binary bat algorithm (BBA) is adopted to find the minimal informative subsets. In this way, a large number of feature subsets can be considered effectively at the redundancy analysis step. In addition, an effective priority list is used to maintain previously removed redundant features. Such a list allows the re-examination of informative features. As a result, it is possible to consider the mutual information between features that are not streamed in an small time interval. Experimental studies on fifteen different types of datasets show that our approach is superior to state-of-the-art online and offline streaming feature selection methods in terms of classification accuracy.

A Multi-omics Data Analysis Workflow Packaged as a FAIR Digital Object

In current biomedical and complex trait research, increasing numbers of large molecular profiling (omics) data sets are being generated. At the same time, many studies fail to be reproduced (Baker 2016, Kim 2018). In order to improve study reproducibility and data reuse, including integration of data sets of different types and origins, it is imperative to work with omics data that is findable, accessible, interoperable, and reusable (FAIR, Wilkinson 2016) at the source. The data analysis, integration and stewardship pillar of the Netherlands X-omics Initiative aims to facilitate multi-omics research by providing tools to create, analyze and integrate FAIR omics data. We here report a joint activity of X-omics and the Netherlands Twin Register demonstrating the FAIRification of a multi-omics data set and the development of a FAIR multi-omics data analysis workflow. The implementation of FAIR principles (Wilkinson 2016) can improve scientific transparency and facilitate data reuse. However, Kim (2018) showed in a case study that the availability of data and code are required but not sufficient to reproduce data analyses. They highlighted the importance of interoperable and open formats, and structured metadata. In order to increase research reproducibility on the data analysis level, additional practices such as version-control, code licensing, and documentation have been proposed. These include recommendations for FAIR software by the Netherlands eScience Center and the Dutch Data Archiving and Networked Services (DANS), and FAIR principles for research software proposed by the Research Data Alliance (Chue Hong 2022). Data analysis in biomedical research usually comprises multiple steps often resulting in complex data analysis workflows and requiring additional practices, such as containerization, to ensure transparency and reproducibility (Goble 2020, Stoudt 2021). We apply these practices to a multi-omics data set that comprises genome-wide DNA methylation profiles, targeted metabolomics, and behavioral data of two cohorts that participated in the ACTION Biomarker Study (ACTION, Aggression in Children: Unraveling gene-environment interplay to inform Treatment and InterventiON strategies, see consortium members in Suppl. material 1) (Boomsma 2015, Bartels 2018, Hagenbeek 2020, van Dongen 2021, Hagenbeek 2022). The ACTION-NTR cohort consists of twins that are either longitudinally concordant or discordant for childhood aggression. The ACTION-Curium-LUMC cohort consists of children referred to the Dutch LUMC Curium academic center for child and youth psychiatry. With the joint analysis of multi-omics data and behavioral data, we aim to identify substructures in the ACTION-NTR cohort and link them to aggressive behavior. First, the individuals are clustered using Similarity Network Fusion (SNF, Wang 2014), and latent feature dimensions are uncovered using different unsupervised methods including Multi-Omics Factor Analysis (MOFA) (Argelaguet 2018) and Multiple Correspondence Analysis (MCA, Lê 2008, Husson 2017). In a second step, we determine correlations between -omics and phenotype dimensions, and use them to explain the subgroups of individuals from the ACTION-NTR cohort. In order to validate the results, we project data of the ACTION-Curium-LUMC cohort onto the latent dimensions and determine if correlations between omics and phenotype data can be reproduced. Integration of data across cohorts and across data types, requires interoperability. We applied different practices to make the data FAIR, including conversion of files to community-standard formats, and capturing experimental metadata using the ISA (Investigation, Study, Assay) metadata framework (Johnson 2021) and ontology-based annotations. All data analysis steps including pre-processing of different omics data types were implemented in either R or Python and combined in a modular Nextflow (Di Tommaso 2017) workflow, where the environment for each step is provided as a Singularity (Kurtzer 2017) container. The analysis workflow is packaged in a Research Object Crate (RO-Crate) (Soiland-Reyes 2022). The RO-Crate is a FAIR digital object that contains the Nextflow workflow including ontology-based annotations of each analysis step. Since omics data is considered to be potentially personally identifiable, the packaged workflow contains a minimal synthetic data set resembling the original data structure. Finally, the code is made available on GitHub and the workflow is registered at Workflowhub (Goble 2021). Since our Nextflow workflow is set up in a modular manner, the individual analysis steps can be reused in other workflows. We demonstrate this replicability by applying different sub-workflows to data from two different cohorts.

Text-Based Emotion Recognition Using Deep Learning Approach.

Sentiment analysis is a method to identify people's attitudes, sentiments, and emotions towards a given goal, such as people, activities, organizations, services, subjects, and products. Emotion detection is a subset of sentiment analysis as it predicts the unique emotion rather than just stating positive, negative, or neutral. In recent times, many researchers have already worked on speech and facial expressions for emotion recognition. However, emotion detection in text is a tedious task as cues are missing, unlike in speech, such as tonal stress, facial expression, pitch, etc. To identify emotions from text, several methods have been proposed in the past using natural language processing (NLP) techniques: the keyword approach, the lexicon-based approach, and the machine learning approach. However, there were some limitations with keyword- and lexicon-based approaches as they focus on semantic relations. In this article, we have proposed a hybrid (machine learning + deep learning) model to identify emotions in text. Convolutional neural network (CNN) and Bi-GRU were exploited as deep learning techniques. Support vector machine is used as a machine learning approach. The performance of the proposed approach is evaluated using a combination of three different types of datasets, namely, sentences, tweets, and dialogs, and it attains an accuracy of 80.11%.

Imperative Role of Machine Learning Algorithm for Detection of Parkinson's Disease: Review, Challenges and Recommendations.

Parkinson’s disease (PD) is a neurodegenerative disease that affects the neural, behavioral, and physiological systems of the brain. This disease is also known as tremor. The common symptoms of this disease are a slowness of movement known as ‘bradykinesia’, loss of automatic movements, speech/writing changes, and difficulty with walking at early stages. To solve these issues and to enhance the diagnostic process of PD, machine learning (ML) algorithms have been implemented for the categorization of subjective disease and healthy controls (HC) with comparable medical appearances. To provide a far-reaching outline of data modalities and artificial intelligence techniques that have been utilized in the analysis and diagnosis of PD, we conducted a literature analysis of research papers published up until 2022. A total of 112 research papers were included in this study, with an examination of their targets, data sources and different types of datasets, ML algorithms, and associated outcomes. The results showed that ML approaches and new biomarkers have a lot of promise for being used in clinical decision-making, resulting in a more systematic and informed diagnosis of PD. In this study, some major challenges were addressed along with a future recommendation.

Developing a conceptual framework for short text categorization using hybrid CNN- LSTM based Caledonian crow optimization

Due to the continuous progression of social media networking sites, people share their thoughts, viewpoints, videos, speech and images through short texts. But the short texts are manually understandable but hard for the machine to collect data for clarification. The limited terms present in the short texts seem difficult while categorizing, analyzing as well as evaluating. Since social media and Bibliographic repositories like Digital Bibliography and Library Project (DBLP) contains a substantial amount of information, it is necessary to mine only useful information from the existing short texts. To achieve effectiveness and efficiency in short text categorization, the content-related characteristics derived from various machine learning techniques are admired. The significant objective of the proposed approach involves the categorization of short text and enhancing its accuracy, which can improve further finding collaborative research communities.. In this work, a hybrid convolutional neural network-long short term memory (CNN-LSTM) based new Caledonian crow optimization (NC2LO) model is utilized to classify the short texts. The crows utilize both social and asocial learning for developing tool modelling skills. Getting attracted to the behaviour of this variety of crows, and motivated by the learning strategy of crows, a new Caledonian crow optimization model referred to as NC2LO model is established. The conceptual framework of the proposed methodology consists of four different phases namely the data collection phase, data preparation phase, data pre-processing phase and short text categorization phase to classify the short texts with a high accuracy rate. Then, the proposed CNN-LSTM based NC2LO for short text categorization is evaluated using four different types of datasets namely IMDb, AG news, Twitter, and Tagmy News. Finally, the comparative analysis is carried out to evaluate the accuracy rate for various approaches and the analysis demonstrated that the proposed approach achieves a high accuracy rate of about 97%.

Neighborhood rough set based multi‐label feature selection with label correlation

SummaryNeighborhood rough set (NRS) is considered as an effective tool for feature selection and has been widely used in processing high‐dimensional data. However, most of the existing methods are difficult to deal with multi‐label data and are lack of considering label correlation (LC), which is an important issue in multi‐label learning. Therefore, in this article, we introduce a new NRS model with considering LC. First, we explore LC by calculating the similarity relation between labels and divide the related labels into several label subsets. Then, a new neighborhood relation is proposed, which can solve the problem of neighborhood granularity selection by using the nearest neighbor information distribution of instances under the related labels. On this basis, the NRS model is reconstructed by embedding LC information, and the related properties of the model are discussed. Moreover, we design a new feature significance function to evaluate the quality of features, which can well capture the specific relationship between features and labels. Finally, a greedy forward feature selection algorithm is designed. Extensive experiments which are conducted on different types of datasets verify the effectiveness of the proposed algorithm.

Performance evaluation of various machine learning and deep learning models for gene expression

Cancer is among those deadliest diseases that affects a mass. So, it requires the timely detection and treatment. There are number of ways through which cancer can be detected. Some of those ways are some “blood tests, CT (Computerized Tomography) scan, MRI (Magnetic Resonance Imaging), X-Ray, Ultrasound, gene expression, etc.”. Genes help doctors to find whether a person is suffering or going to suffer from any disease or not. In this paper, we have gone through various ML and DL from the literature. The models are trained and tested on 5 different types of datasets. These are “Lung Adenocarcinoma (LUAD), Lung Squamous Cell Carcinoma (LUSC), Breast Invasive Carcinoma (BRCA), Kidney Renal Clear Cell Carcinoma (KIRC), and Uterine Corpus Endometrial Carcinoma (UCEC)”. The models are evaluated on the different performance measures such as “MSE, Precision, Recall, F1_Score and Accuracy”.

A faster dynamic convergency approach for self-organizing maps

This paper proposes a novel variable learning rate to address two main challenges of the conventional Self-Organizing Maps (SOM) termed VLRSOM: high accuracy with fast convergence and low topological error. We empirically showed that the proposed method exhibits faster convergence behavior. It is also more robust in topology preservation as it maintains an optimal topology until the end of the maximum iterations. Since the learning rate adaption and the misadjustment parameter depends on the calculated error, the VLRSOM will avoid the undesired results by exploiting the error response during the weight updation. Then the learning rate is updated adaptively after the random initialization at the beginning of the training process. Experimental results show that it eliminates the tradeoff between the rate of convergence and accuracy and maintains the data's topological relationship. Extensive experiments were conducted on different types of datasets to evaluate the performance of the proposed method. First, we experimented with synthetic data and handwritten digits. For each data set, two experiments with a different number of iterations (200 and 500) were performed to test the stability of the network. The proposed method was further evaluated using four benchmark data sets. These datasets include Balance, Wisconsin Breast, Dermatology, and Ionosphere. In addition, a comprehensive comparative analysis was performed between the proposed method and three other SOM techniques: conventional SOM, parameter-less self-organizing map (PLSOM2), and RA-SOM in terms of accuracy, quantization error (QE), and topology error (TE). The results indicated the proposed approach produced superior results to the other three methods.

AutoElbow: An Automatic Elbow Detection Method for Estimating the Number of Clusters in a Dataset

The elbow technique is a well-known method for estimating the number of clusters required as a starting parameter in the K-means algorithm and certain other unsupervised machine-learning algorithms. However, due to the graphical output nature of the method, human assessment is necessary to determine the location of the elbow and, consequently, the number of data clusters. This article presents a simple method for estimating the elbow point, thus, enabling the K-means algorithm to be readily automated. First, the elbow-based graph is normalized using the graph’s minimum and maximum values along the ordinate and abscissa coordinates. Then, the distance between each point on the graph to the minimum (i.e., the origin) and maximum reference points, and the “heel” of the graph are calculated. The estimated elbow location is, thus, the point that maximizes the ratio of these distances, which corresponds to an approximate number of clusters in the dataset. We demonstrate that the strategy is effective, stable, and adaptable over different types of datasets characterized by small and large clusters, different cluster shapes, high dimensionality, and unbalanced distributions. We provide the clustering community with a description of the method and present comparative results against other well-known methods in the prior state of the art.

A multi-birth metric learning framework based on binary constraints

Multi-metric learning plays a significant role in improving the generalization of algorithms related to distance metrics since using a single metric is sometimes insufficient to handle complex data. Metric learning can adjust automatically the distance between samples to make the intra-class samples compact while making the inter-class distance as far as possible. To implement this intention better,in this work, we propose a novel multi-metric learning framework based on the pair constraints instead of triple constraints to reduce computational burden. To solve effectively the problem, we first propose a multi-birth metric learning model (termed MBML), where for each class sample, the global metric and a local metric are jointly trained. Both global and local structural information are adapted to better depict sample information. Then two alternating iterative algorithms are developed to optimize the MBML. The convergence of the proposed algorithm and complexity are analyzed theoretically. Moreover, a fast diagonal multi-metric learning method is proposed based on binary constraints, and problem can be reformulated a linear programming, with fast training speed, low the computational burden and the global optimal solutions. Numerical experiments are carried out on different scales and different types of datasets including an artificial data, benchmark datasets and an image database from binary class and multi-class problems. Experiment results confirm the feasibility and effectiveness of the proposed methods.

Recrystallization kinetics of the AA5xxx series aluminum alloys - revisited

In previous work [1], we analyzed the recrystallization kinetics in cold-rolled AA5657 and AA5182 based on measurements of the volume fraction of recrystallized material, the free (unimpinged) surface area density and the average size of the recrystallizing grains, plus the contiguity between recrystallizing grains, for a series of partially recrystallized samples. In that work, the calculated growth and nucleation rates were used as basis from the analysis. These two properties are derived from the measured parameters, which, as shown in the present work, adds to their uncertainty. In the present paper, we revisit the kinetics using improved stereological data and perform a full microstructural path analysis. The new analysis results are compared to the previous ones and the implications of using the different types of data sets and analytical approach for the interpretation of the kinetics are discussed.

Noise-Tolerant Fuzzy-$\beta$-Covering-Based Multigranulation Rough Sets and Feature Subset Selection

As a novel fuzzy covering, fuzzy <inline-formula><tex-math notation="LaTeX">$\beta$</tex-math></inline-formula> covering has attracted considerable attention. However, the traditional fuzzy-<inline-formula><tex-math notation="LaTeX">$\beta$</tex-math></inline-formula>-covering-based rough set and most of its extended models cannot well fit the distribution of samples in real data, which limits their application in classification learning and decision making. First, the upper and lower approximations of these models have no inclusion relation, so they cannot characterize a given objective concept accurately. Moreover, most of these models are hard to resist the influence of noise data, resulting in poor robustness in feature learning. For these reasons, a robust rough set model is set forth by combining fuzzy rough sets, covering-based rough sets, and multigranulation rough sets. To this end, the optimistic and pessimistic lower and upper approximations of a target concept are reconstructed by means of the fuzzy <inline-formula><tex-math notation="LaTeX">$\beta$</tex-math></inline-formula> neighborhood related to a family of fuzzy coverings, and a new multigranulation fuzzy rough set model is presented. Furthermore, a fuzzy dependence function is introduced to evaluate the classification ability of a family of fuzzy <inline-formula><tex-math notation="LaTeX">$\beta$</tex-math></inline-formula> coverings at different granularity levels. The dimensionality reduction of a given fuzzy covering decision table is carried out from the perspective of maintaining the discrimination power, and a forward algorithm for feature selection is developed by using the optimistic significance of candidate features as heuristic information. Three groups of numerical experiments on 16 different types of datasets demonstrate that the proposed model exhibits good robustness on datasets contaminated with noise and outperforms some state-of-the-art feature learning algorithms in terms of classification accuracy and the size of the selected feature subset.

Uni-Variate and Multi-Variate Short-Term Household Electricity Consumption Prediction Using Machine Learning Technique

Background: Electricity consumption prediction plays an important role in conservation, development, and future planning. Accurate prediction model has various field applications in real-life scenarios, future electricity demand estimation, performance evaluation of current time, fault detection, efficient energy production, resource-saving, and many more. In this paper, a CNN based short term building electricity consumption prediction model is developed and tested for two different types of datasets that can perform weekly prediction. Two different datasets are used to check how the algorithm behaves on different datasets i.e., what are the impacts dataset has on prediction accuracy. Errors were calculated using MAE and RMSE. Objective: The objective of the study is to develop an electricity consumption prediction (ECP) model for a univariate and multivariate dataset using CNN and LSTM network and to find that how the correlation and independency of features affect the electricity prediction task. Methods: The proposed electricity consumption model is built using the deep CNN andLSTM network and is trained and tested using the univariate and multivariate time series dataset thus the two experiments have been performed and are named as U-ECPCL (Univariate- Electricity Consumption Prediction using CNN and LSTM) and M-ECPCL (Multivariate- Electricity Consumption Prediction using CNN and LSTM) respectively. Results: The model predicts accurately with few errors with MAE of 0.251 and RMSE of 0.66 for univariate dataset and MAE of 4.36 and RMSE of 11.53 for a multivariate dataset. Conclusion: The model predicts accurately with few errors and if the prediction error of univariate and multivariate are compared then it is concluded that the univariate model outperforms the multivariate model.

A Novel Hybrid Convolutional Neural Network Approach for the Stomach Intestinal Early Detection Cancer Subtype Classification.

There may be different types of cancer that cause fatal effects in the human body. In general, cancer is nothing but the unnatural growth of blood cells in different parts of the body and is named accordingly. It may be skin cancer, breast cancer, uterus cancer, intestinal cancer, stomach cancer, etc. However, every type of cancer consists of unwanted blood cells which cause issues in the body starting from the minor to death. Cancer cells have the common features in them, and these common features we have used in our work for the processing. Cancer has a significant death rate; however, it is frequently curable with simple surgery if detected in its early stages. A quick and correct diagnosis may be extremely beneficial to both doctors and patients. In several medical domains, the latest deep-learning-based model's performance is comparable to or even exceeds that of human specialists. We have proposed a novel methodology based on a convolutional neural network that may be used for almost all types of cancer detection. We have collected different datasets of different types of common cancer from different sources and used 90% of the sample data for the training purpose, then we reduced it by 10%, and an 80% image set was used for the validation of the model. After that for testing purposes, we fed a sample dataset and obtain the results. The final output clearly shows that the proposed model outperforms the previous model when we compared our methodology with the existing work.