Search results

Up to date development in sentiment analysis has resulted in a symbolic growth in the volume of study, especially on more subjective text types, namely, product or movie reviews. The key difference between these texts with news articles is that their target is defined and unique across the text. Hence, the reviews on newspaper articles can deal with three subtasks: correctly spotting the target, splitting the good and bad content from the reviews on the concerned target and evaluating different opinions provided in a detailed manner. On defining these tasks, this paper aims to implement a new sentiment analysis model for article reviews from the newspaper.

Here, tweets from various newspaper articles are taken and the sentiment analysis process is done with pre-processing, semantic word extraction, feature extraction and classification. Initially, the pre-processing phase is performed, in which different steps such as stop word removal, stemming, blank space removal are carried out and it results in producing the keywords that speak about positive, negative or neutral. Further, semantic words (similar) are extracted from the available dictionary by matching the keywords. Next, the feature extraction is done for the extracted keywords and semantic words using holoentropy to attain information statistics, which results in the attainment of maximum related information. Here, two categories of holoentropy features are extracted: joint holoentropy and cross holoentropy. These extracted features of entire keywords are finally subjected to a hybrid classifier, which merges the beneficial concepts of neural network (NN), and deep belief network (DBN). For improving the performance of sentiment classification, modification is done by inducing the idea of a modified rider optimization algorithm (ROA), so-called new steering updated ROA (NSU-ROA) into NN and DBN for weight update. Hence, the average of both improved classifiers will provide the classified sentiment as positive, negative or neutral from the reviews of newspaper articles effectively.

Three data sets were considered for experimentation. The results have shown that the developed NSU-ROA + DBN + NN attained high accuracy, which was 2.6% superior to particle swarm optimization, 3% superior to FireFly, 3.8% superior to grey wolf optimization, 5.5% superior to whale optimization algorithm and 3.2% superior to ROA-based DBN + NN from data set 1. The classification analysis has shown that the accuracy of the proposed NSU − DBN + NN was 3.4% enhanced than DBN + NN, 25% enhanced than DBN and 28.5% enhanced than NN and 32.3% enhanced than support vector machine from data set 2. Thus, the effective performance of the proposed NSU − ROA + DBN + NN on sentiment analysis of newspaper articles has been proved.

This paper adopts the latest optimization algorithm called the NSU-ROA to effectively recognize the sentiments of the newspapers with NN and DBN. This is the first work that uses NSU-ROA-based optimization for accurate identification of sentiments from newspaper articles.

In general, the optimal reactive power compensation could drastically enhance the performance of distributed network by the reduction of power loss and by enhancement of line loadability and voltage profile. Till now, there exist various reactive power compensation models including capacitor placement, joined process of on-load tap changer and capacitor banks and integration of DG. Further, one of the current method is the allocation of distribution FACTS (DFACTS) device. Even though, the DFACTS devices are usually used in the enhancement of power quality, they could be used in the optimal reactive power compensation with more effectiveness.

This paper introduces a power quality enhancement model that is based on a new hybrid optimization algorithm for selecting the precise unified power quality conditioner (UPQC) location and sizing. A new algorithm rider optimization algorithm (ROA)-modified particle swarm optimization (PSO) in fitness basis (RMPF) is introduced for this optimal selections.

Through the performance analysis, it is observed that as the iteration increases, there is a gradual minimization of cost function. At the 40th iteration, the proposed method is 1.99 per cent better than ROA and genetic algorithm (GA); 0.09 per cent better than GMDA and WOA; and 0.14, 0.57 and 1.94 per cent better than Dragonfly algorithm (DA), worst solution linked whale optimization (WS-WU) and PSO, respectively. At the 60th iteration, the proposed method attains less cost function, which is 2.07, 0.08, 0.06, 0.09, 0.07 and 1.90 per cent superior to ROA, GMDA, DA, GA, WS-WU and PSO, respectively. Thus, the proposed model proves that it is better than other models.

This paper presents a technique for optimal placing and sizing of UPQC. To the best of the authors’ knowledge, this is the first work that introduces RMPF algorithm to solve the optimization problems.

The containerization application is one among the technologies that enable microservices architectures, which is observed to be the model for operating system (OS) virtualization. Containers are the virtual instances of the OS that are structured as the isolation for the OS atmosphere and its file system, which are executed on the single kernel and a single host. Hence, every microservice application is evolved in a container without launching the total virtual machine. The system overhead is minimized in this way as the environment is maintained in a secured manner. The exploitation of a microservice is as easy to start the execution of a new container. As a result, microservices could scale up by simply generating new containers until the required scalability level is attained. This paper aims to optimize the container allocation.

This paper introduces a new customized rider optimization algorithm (C-ROA) for optimizing the container allocation. The proposed model also considers the impact of system performance along with its security. Moreover, a new rescaled objective function is defined in this work that considers threshold distance, balanced cluster use, system failure, total network distance and security as well. At last, the performance of proposed work is compared over other state-of-the-art models with respect to convergence and cost analysis.

For experiment 1, the implemented model at 50th iteration has achieved minimal value, which is 29.24%, 24.48% and 21.11% better from velocity updated grey wolf optimisation (VU-GWO), whale random update assisted LA (WR-LA) and rider optimization algorithm (ROA), respectively. Similarly, on considering Experiment 2, the proposed model at 100th iteration attained superior performance than conventional models such as VU-GWO, WR-LA and ROA by 3.21%, 7.18% and 10.19%, respectively. The developed model for Experiment 3 at 100th iteration is 2.23%, 5.76% and 6.56% superior to VU-GWO, WR-LA and ROA.

This paper presents the latest fictional optimization algorithm named ROA for optimizing the container allocation. To the best of the authors’ knowledge, this is the first study that uses the C-ROA for optimization.

Internet has endorsed a tremendous change with the advancement of the new technologies. The change has made the users of the internet to make comments regarding the service or product. The Sentiment classification is the process of analyzing the reviews for helping the user to decide whether to purchase the product or not.

A rider feedback artificial tree optimization-enabled deep recurrent neural networks (RFATO-enabled deep RNN) is developed for the effective classification of sentiments into various grades. The proposed RFATO algorithm is modeled by integrating the feedback artificial tree (FAT) algorithm in the rider optimization algorithm (ROA), which is used for training the deep RNN classifier for the classification of sentiments in the review data. The pre-processing is performed by the stemming and the stop word removal process for removing the redundancy for smoother processing of the data. The features including the sentiwordnet-based features, a variant of term frequency-inverse document frequency (TF-IDF) features and spam words-based features are extracted from the review data to form the feature vector. Feature fusion is performed based on the entropy of the features that are extracted. The metrics employed for the evaluation in the proposed RFATO algorithm are accuracy, sensitivity, and specificity.

By using the proposed RFATO algorithm, the evaluation metrics such as accuracy, sensitivity and specificity are maximized when compared to the existing algorithms.

The proposed RFATO algorithm is modeled by integrating the FAT algorithm in the ROA, which is used for training the deep RNN classifier for the classification of sentiments in the review data. The pre-processing is performed by the stemming and the stop word removal process for removing the redundancy for smoother processing of the data. The features including the sentiwordnet-based features, a variant of TF-IDF features and spam words-based features are extracted from the review data to form the feature vector. Feature fusion is performed based on the entropy of the features that are extracted.

This paper aims to propose a new assessment system module for handling the comprehensive answers written through the answer interface.

The working principle is under three major phases: Preliminary semantic processing: In the pre-processing work, the keywords are extracted for each answer given by the course instructor. In fact, this answer is actually considered as the key to evaluating the answers written by the e-learners. Keyword and semantic processing of e-learners for hierarchical clustering-based ontology construction: For each answer given by each student, the keywords and the semantic information are extracted and clustered (hierarchical clustering) using a new improved rider optimization algorithm known as Rider with Randomized Overtaker Update (RR-OU). Ontology matching evaluation: Once the ontology structures are completed, a new alignment procedure is used to find out the similarity between two different documents. Moreover, the objects defined in this work focuses on “how exactly the matching process is done for evaluating the document.” Finally, the e-learners are classified based on their grades.

On observing the outcomes, the proposed model shows less relative mean squared error measure when weights were (0.5, 0, 0.5), and it was 71.78% and 16.92% better than the error values attained for (0, 0.5, 0.5) and (0.5, 0.5, 0). On examining the outcomes, the values of error attained for (1, 0, 0) were found to be lower than the values when weights were (0, 0, 1) and (0, 1, 0). Here, the mean absolute error (MAE) measure for weight (1, 0, 0) was 33.99% and 51.52% better than the MAE value for weights (0, 0, 1) and (0, 1, 0). On analyzing the overall error analysis, the mean absolute percentage error of the implemented RR-OU model was 3.74% and 56.53% better than k-means and collaborative filtering + Onto + sequential pattern mining models, respectively.

This paper adopts the latest optimization algorithm called RR-OU for proposing a new assessment system module for handling the comprehensive answers written through the answer interface. To the best of the authors’ knowledge, this is the first work that uses RR-OU-based optimization for developing a new ontology alignment-based online assessment of e-learners.

With the advancements in photo editing software, it is possible to generate fake images, degrading the trust in digital images. Forged images, which appear like authentic images, can be created without leaving any visual clues about the alteration in the image. Image forensic field has introduced several forgery detection techniques, which effectively distinguish fake images from the original ones, to restore the trust in digital images. Among several forgery images, spliced images involving human faces are more unsafe. Hence, there is a need for a forgery detection approach to detect the spliced images.

This paper proposes a Taylor-rider optimization algorithm-based deep convolutional neural network (Taylor-ROA-based DeepCNN) for detecting spliced images. Initially, the human faces in the spliced images are detected using the Viola–Jones algorithm, from which the 3-dimensional (3D) shape of the face is established using landmark-based 3D morphable model (L3DMM), which estimates the light coefficients. Then, the distance measures, such as Bhattacharya, Seuclidean, Euclidean, Hamming, Chebyshev and correlation coefficients are determined from the light coefficients of the faces. These form the feature vector to the proposed Taylor-ROA-based DeepCNN, which determines the spliced images.

Experimental analysis using DSO-1, DSI-1, real dataset and hybrid dataset reveal that the proposed approach acquired the maximal accuracy, true positive rate (TPR) and true negative rate (TNR) of 99%, 98.88% and 96.03%, respectively, for DSO-1 dataset. The proposed method reached the performance improvement of 24.49%, 8.92%, 6.72%, 4.17%, 0.25%, 0.13%, 0.06%, and 0.06% in comparison to the existing methods, such as Kee and Farid's, shape from shading (SFS), random guess, Bo Peng et al., neural network, FOA-SVNN, CNN-based MBK, and Manoj Kumar et al., respectively, in terms of accuracy.

The Taylor-ROA is developed by integrating the Taylor series in rider optimization algorithm (ROA) for optimally tuning the DeepCNN.

This paper aims to propose a new upper limb movement classification with two phases like pre-processing and classification. Investigation of human limb movements is a significant topic in biomedical engineering, particularly for treating patients. Usually, the limb movement is examined by analyzing the signals that occurred by the movements. However, only few attempts were made to explore the correlations among the movements that are recognized by the human brain.

The initial process is the pre-processing that is performed for detecting and removing noisy channels. The artifacts are marked by band-pass filtering that discovers the values below and above thresholds of 200 and –200 µV, correspondingly. It also discovers the trials with unusual joint probabilities, and the trials with unusual kurtosis are also determined using this method. After this, the pre-processed signals are subjected to a classification process, where the neural network (NN) model is used. The model finally classifies six movements like “elbow extension, elbow flexion, forearm pronation, forearm supination, hand open, and hand close,” respectively. To make the classification more accurate, this paper intends to optimize the weights of NN by a new hybrid algorithm known as bypass integrated jaya algorithm (BI-JA) that hybrids the concept of rider optimization algorithm (ROA) and JA. Finally, the performance of the proposed model is proved over other conventional models concerning certain measures like accuracy, sensitivity, specificity, and precision, false positive rate, false negative rate, false discovery rate, F₁-score and Matthews correlation coefficient.

From the analysis, the adopted BI-JA-NN model in terms of accuracy was high at 80th population size was 7.85%, 3.66%, 7.53%, 2.09% and 0.52% better than Levenberg–Marquardt (LM)-NN, firefly (FF)-NN, JA-NN, whale optimization algorithm (WOA)-NN and ROA-NN algorithms. On considering sensitivity, the proposed method was 2%, 0.2%, 5.01%, 0.29% and 0.3% better than LM-NN, FF-NN, JA-NN, WOA-NN and ROA-NN algorithms at 50th population size. Also, the specificity of the implemented BI-JA-NN model at 80th population size was 7.47%, 4%, 7.05%, 2.1% and 0.5% better than LM-NN, FF-NN, JA-NN, WOA-NN and ROA-NN algorithms. Thus, the betterment of the presented scheme was proved.

This paper adopts the latest optimization algorithm called BI-JA to introduce a new upper limb movement classification with two phases like pre-processing and classification. This is the first work that uses BI-JA based optimization for improving the upper limb movement detection using electroencephalography signals.

In a wireless sensor network (WSN), the sensor nodes are distributed in the network, and in general, they are linked through wireless intermediate to assemble physical data. The nodes drop their energy after a specific duration because they are battery-powered, which also reduces network lifetime. In addition, the routing process and cluster head (CH) selection process is the most significant one in WSN. Enhancing network lifetime through balancing path reliability is more challenging in WSN. This paper aims to devise a multihop routing technique with developed IIWEHO technique.

In this method, WSN nodes are simulated originally, and it is fed to the clustering process. Meanwhile, the CH is selected with low energy-based adaptive clustering model with hierarchy (LEACH) model. After CH selection, multipath routing is performed by developed improved invasive weed-based elephant herd optimization (IIWEHO) algorithm. In addition, the multipath routing is selected based on certain fitness functions like delay, energy, link quality and distance. However, the developed IIWEHO technique is the combination of IIWO method and EHO algorithm.

The performance of developed optimization method is estimated with different metrics, like distance, energy, delay and throughput and achieved improved performance for the proposed method.

This paper presents an effectual multihop routing method, named IIWEHO technique in WSN. The developed IIWEHO algorithm is newly devised by incorporating EHO and IIWO approaches. The fitness measures, which include intra- and inter-distance, delay, link quality, delay and consumption of energy, are considered in this model. The proposed model simulates the WSN nodes, and CH selection is done by the LEACH protocol. The suitable CH is chosen for transmitting data through base station from the source to destination. Here, the routing system is devised by a developed optimization technique. The selection of multipath routing is carried out using the developed IIWEHO technique. The developed optimization approach selects the multipath depending on various multi-objective functions.

Affective states in learning have gained immense attention in education. The precise affective-states prediction can increase the learning gain by adapting targeted interventions that can adjust the changes in individual affective states of students. Several techniques are devised for predicting the affective states considering audio, video and biosensors. Still, the system that relies on analyzing audio and video cannot certify anonymity and is subjected to privacy problems.

A new strategy, termed rider squirrel search algorithm-based deep long short-term memory (RiderSSA-based deep LSTM) is devised for affective-state prediction. The deep LSTM training is done by the proposed RiderSSA. Here, RiderSSA-based deep LSTM effectively predicts the affective states like confusion, engagement, frustration, anger, happiness, disgust, boredom, surprise and so on. In addition, the learning styles are predicted based on the extracted features using rider neural network (RideNN), for which the Felder–Silverman learning-style model (FSLSM) is considered. Here, the RideNN classifies the learners. Finally, the course ID, student ID, affective state, learning style, exam score and course completion are taken as output data to determine the correlative study.

The proposed RiderSSA-based deep LSTM provided enhanced efficiency with elevated accuracy of 0.962 and the highest correlation of 0.406.

The proposed method based on affective prediction obtained maximal accuracy and the highest correlation. Thus, the method can be applied to the course recommendation system based on affect prediction.

Gene selection is considered as the fundamental process in the bioinformatics field. The existing methodologies pertain to cancer classification are mostly clinical basis, and its diagnosis capability is limited. Nowadays, the significant problems of cancer diagnosis are solved by the utilization of gene expression data. The researchers have been introducing many possibilities to diagnose cancer appropriately and effectively. This paper aims to develop the cancer data classification using gene expression data.

The proposed classification model involves three main phases: “(1) Feature extraction, (2) Optimal Feature Selection and (3) Classification”. Initially, five benchmark gene expression datasets are collected. From the collected gene expression data, the feature extraction is performed. To diminish the length of the feature vectors, optimal feature selection is performed, for which a new meta-heuristic algorithm termed as quantum-inspired immune clone optimization algorithm (QICO) is used. Once the relevant features are selected, the classification is performed by a deep learning model called recurrent neural network (RNN). Finally, the experimental analysis reveals that the proposed QICO-based feature selection model outperforms the other heuristic-based feature selection and optimized RNN outperforms the other machine learning methods.

The proposed QICO-RNN is acquiring the best outcomes at any learning percentage. On considering the learning percentage 85, the accuracy of the proposed QICO-RNN was 3.2% excellent than RNN, 4.3% excellent than RF, 3.8% excellent than NB and 2.1% excellent than KNN for Dataset 1. For Dataset 2, at learning percentage 35, the accuracy of the proposed QICO-RNN was 13.3% exclusive than RNN, 8.9% exclusive than RF and 14.8% exclusive than NB and KNN. Hence, the developed QICO algorithm is performing well in classifying the cancer data using gene expression data accurately.

This paper introduces a new optimal feature selection model using QICO and QICO-based RNN for effective classification of cancer data using gene expression data. This is the first work that utilizes an optimal feature selection model using QICO and QICO-RNN for effective classification of cancer data using gene expression data.