An Efficient and Unique TF/IDF Algorithmic Model-Based Data Analysis for Handling Applications with Big Data Streaming

Abstract

As the field of data science grows, document analytics has become a more challenging task for rough classification, response analysis, and text summarization. These tasks are used for the analysis of text data from various intelligent sensing systems. The conventional approach for data analytics and text processing is not useful for big data coming from intelligent systems. This work proposes a novel TF/IDF algorithm with the temporal Louvain approach to solve the above problem. Such an approach is supposed to help the categorization of documents into hierarchical structures showing the relationship between variables, which is a boon to analysts making essential decisions. This paper used public corpora, such as Reuters-21578 and 20 Newsgroups for massive-data analytic experimentation. The result shows the efficacy of the proposed algorithm in terms of accuracy and execution time across six datasets. The proposed approach is validated to bring value to big text data analysis. Big data handling with map-reduce has led to tremendous growth and support for tasks like categorization, sentiment analysis, and higher-quality accuracy from the input data. Outperforming the state-of-the-art approach in terms of accuracy and execution time for six datasets ensures proper validation.

The Use of Ensemble Models for Multiple Class and Binary Class Classification for Improving Intrusion Detection Systems

“…using a precise subset of the KDDTest+ dataset, the model was assessed, but then the outputs proved that employing a weighting system with the model resulted in an improved general performance better than the model that did not include weighting scheme. Individual class performance on binarization approaches have been analyzed in all the above-mentioned works; however, the lowest FPR was realized in the recent works [32][33][34][35][36] while many other algorithm and DoS were considered by [37][38][39][40][41][42][43][44].…”

“…If we have S number of features subset having A number of attributes, then M s is evaluation of these S subsets with A number of attributes, where M c f represents the average correlation between class label and attributes. M f f is average correlation values between attributes, or we can say how much two features are associated with each other based on this M f f function [37]. If we have a classification problem, CFS calculates symmatrix uncertainty shown in Equation 3:…”

Realizing an Efficient IoMT-Assisted Patient Diet Recommendation System Through Machine Learning Model

“…In case of classifying random forest, the majority vote was used to predict the target but for regression analysis, random forest takes mean value of all the decision trees and then predict as threshold is set for each node. Splitting is then performed base on that threshold [46].…”

“…However, all ANNs may be characterized by their processing unit (PE) transfer functions. Their learning methods and by the connection equations.PE, is a fundamental component of ANN and it receives many weighted signals from other processing units [46]. Figure 3 shows the Biological Neuron structure [47] wile Figure 4 shows the working flow of neural network.…”

Enhancing Security of Health Information Using Modular Encryption Standard in Mobile Cloud Computing

“…While the threats to different kinds of medical records and their impacts can be categorized as given in Tables 2 and 3. Although HI offers interesting security and protection challenges that require a crisp assessment of the standard facilities and approaches to deal with HI security [16][17][18]. The importance of security and protection in healthcare raises the issues of the information classification, which is the primary determinant in the adaptation and successful utilization of HI.…”