Recently, a significant way to diagnose the disease is using the model of medical data mining. The most challenging task in the healthcare field is to face a large amount of data during disease analyzes and prediction. Once the data are transformed into valuable data by means of data mining models then the actual prediction and decision making is easier. The existing studies met few shortcomings because of higher execution time, more computational complexities, less scalability, slow convergence, and lack of providing the solution. In this article, we have proposed an ensemble SVM‐based sample weighted random forests (eSVM‐swRF) with novel improved colliding body optimization (NICBO) algorithm to predict liver diseases. The extraction, loading, transformation, and analysis (ELTA) are used to pre‐process the patient data. The significant feature with a suitable model is generated depending upon the filter‐based method. Based on eSVM‐swRF, the parameter values such as penalty parameter (P), threshold (T), and mTry are optimized via a novel improved colliding boding optimization (NICBO) algorithm. The UCI dataset provides liver disease data for this study. The implementation platform of RapidMiner Studio version 7.6 with different evaluation measures is used to validate the performance of eSVM‐swRF with the NICBO method. Anyway, the proposed method yields outstanding performance than other existing methods such as Particle Swarm Optimization‐based Support Vector Machine (PSO‐SVM), fuzzy adaptive, and neighbor weighted k‐NN (FuzzyANWKNN), Naïve Bayes‐based Support Vector Machine (NB‐SVM), and Neural network.

No abstract

Attack detection is the major issue in healthcare‐based wireless sensor networks (H‐WSNs). Due to their low processing speed, very low storage space, poor attack detection rate, longer deployment time, poor communication range, and reduced energy, H‐WSNs are subjected to difficult implementation and have their own limitations. To tackle these issues, we have presented a hybrid deep learning model using convolutional neural network and long short term memory (HDMCL) for attack detection in H‐WSN. This research is divided into three steps: preprocessing, dimensionality reduction, and classification (attack detection). At first, the raw input data (patient's health data) is preprocessed using the one‐hot encoding method. Next, the modified Huber independent component analysis based squirrel search algorithm (MHICA‐SSA) effectively reduces the data dimensionality in which the MHICA‐SSA is the amalgamation of both modified Huber independent component analysis and squirrel search algorithm. The novel algorithm designed overcomes the complexities associated with existing techniques such as the curse of dimensionality problem, improves the parameter interpretation, minimizes the time and storage space, minimizes space complexity, and enhances the attack detection accuracy of the convolutional neural network‐based long short‐term memory (CNN‐LSTM). After that, the deep learning CNN‐LSTM model is utilized for normal, black hole, and gray hole attack detection. The NS2.34 network simulator implements the proposed work thereby the proposed work efficiency is validated using different performance measures such as packet delivery ratio, false alarm rate, network lifetime, energy consumption, throughput, attack detection time, and rate. The proposed work performance is evaluated using different existing methods such as fish swarm optimization based particle swarm optimization, intelligent opportunistic routing algorithm, Jensen‐Shannon divergence‐based independent component analysis, and radio frequency identification based WSN. The throughput of the proposed work is increased up to 3.2 times and the network lifetime is increased up to 4 times when compared to the existing techniques.

The virtual machine placement for the highly reliable cloud application is considered as one of the challenging and critical issues. To tackle such an issue, this article proposes the enhanced firefly algorithm based virtual machine placement model. But the migration time of the virtual machine placement is high and to reduce the migration time of the virtual machine placement, this article utilizes the K-means clustering algorithm. In addition, to obtain the optimal cluster for the virtual machine placement, the adaptive particle swarm optimization with the coyote optimization algorithm is employed. The experimental results are conducted for the proposed approach using various measures such as transmission overhead, total execution time, packet size, parallel applications numbers, and virtual machine numbers. The results demonstrate that the proposed method offers improved performance and an optimal virtual machine placement scheme with respect to the various constraint factors. The evaluation exposes that the proposed method offers less execution time when compared to other methods.

Wireless sensor networks (WSN) allude to gathering of spatially fragmented and committed sensors for observing and documenting various physical and climatic variables like temperature, moistness and, so on. WSN is quickly growing its work in different fields like clinical, enterprises, climate following and so on. However, the sensor nodes have restricted battery life and substitution or re-energizing of these batteries in the sensor nodes is exceptionally troublesome for the most parts. Energy effectiveness is the significant worry in the remote sensor networks as it is significant for keeping up its activity. In this paper, clustering algorithms based on sensor module energy states to strengthen the network longevity of wireless sensor networks is proposed (i.e. modified MPCT algorithm) in which cluster head determination depends on the every cluster power centroid as well as power of the sensor nodes. Correspondence between cluster leader and sink module employ a parameter distance edge for lessening energy utilization. The outcome got shows a normal increment of 60% in network lifetime compared to Low energy adaptive protocol, Energy efficient midpoint initialization algorithm (EECPK-means), Park K-means algorithm and Mobility path selection protocol.

No abstract

No abstract

A web service is a programmatically available application logic exposed over the internet and it has attracted much attention in recent years with the rapid development of e-commerce. Very few web services exist in the field of mathematics. The aim of this paper is to seamlessly provide user-centric mathematical web services to the service requester. In particular, this paper focuses on mathematical web services for prepositional logic and set theory which comes under discrete mathematics. A sophisticated user interface with virtual keyboard is created for accessing web services. Experimental results show that the web services and the created user interface are efficient and practical.