Effective Web Service Classification Using a Hybrid of Ontology Generation and Machine Learning Algorithm

The number of web services on the Internet is increasing continuously. Determining a web service’s domain is very helpful for many issues like web service discovery, composition and semantic annotation. Based on predefined domains, we implemented semi-automatic web service classification with supervised machine learning technique in the paper. First we exploited the process of web service classification with choosing element from web service description document, preprocessing data, mapping to a digital vector and applying classifier. Then service classification accuracy of single element and multi-element based on four machine learning algorithms were tested. At last, experimental results showed that C4.5 classifier had a higher accuracy and efficiency in web service classification. In addition, multi-element classification did not perform better than single element.

Service oriented architecture is a glue that allows web applications to work in collaboration. It has become a driving force for the service-oriented computing (SOC) paradigm. In heterogeneous environments the SOC paradigm uses web services as the basic building block to support low costs as well as easy and rapid composition of distributed applications. A web service exposes its interfaces using the Web Service Description Language (WSDL). A central repository called universal description, discovery and integration (UDDI) is used by service providers to publish and register their web services. UDDI registries are used by web service consumers to locate the web services they require and metadata associated with them. Manually analyzing WSDL documents is the best approach, but also most expensive. Work has been done on employing various approaches to automate the classification of web services. However, previous research has focused on using a single technique for classification. This research paper focuses on the classification of web services using a majority vote based classifier ensemble technique. The ensemble model overcomes the limitations of conventional techniques by employing the ensemble of three heterogeneous classifiers: Naive Bayes, decision tree (J48), and Support Vector Machines. We applied tenfold cross-validation to test the efficiency of the model on a publicly available dataset consisting of 3738 real world web services categorized into 5 fields, which yielded an average accuracy of 92 %. The high accuracy is owed to two main factors, i.e., enhanced pre-processing with focused feature selection, and majority based ensemble classification.

In software technology, over the diversified environment, services can be rendered using an innovative mechanism of a novel paradigm called web services. In a business environment, rapid changes and requirements from various customers can be adapted using this service. For service management and discovery, the classification of Web services having the same functions is an efficient technique. However, there will be short lengthened Web services functional description documents, having less information, and sparse features. This makes difficulties in modelling short text in various topic models and leads to make an effect in the classification of Web services. A Mixed Wide and PSO-Bi-LSTM-CNN model (MW-PSO-Bi-LSTM-CNN) is proposed in this work for solving this issue. In this technique, the Web service category‟s breadth prediction is performed by combining Web services description document‟s discrete features, which exploits the wide learning model. In the next stage, the PSO-Bi-LSTM-CNN model is used for mining Web services description document word‟s context information and word order, for performing the Web service category‟s depth prediction. Here, particle swarm optimization (PSO) is integrated with the Bi-LSTM-CNN network for computing various hyper-parameters in an automatic manner. In third stage, Web service categories, results of depth, and breadth prediction are integrated using a linear regression model as final service classification result. At last, MW-PSO-Bi-LSTM-CNN, Wide&Bi-LSTM, and Wide&Deep web service classification techniques are compared and a better result with respect to web service classification accuracy is obtained using the proposed technique as shown in experimental results.

Co-attentive representation learning for web services classification

In brain–computer interfaces (BCIs), it is crucial to process brain signals to improve the accuracy of the classification of motor movements. Machine learning (ML) algorithms such as artificial neural networks (ANNs), linear discriminant analysis (LDA), decision tree (D.T.), K-nearest neighbor (KNN), naive Bayes (N.B.), and support vector machine (SVM) have made significant progress in classification issues. This paper aims to present a signal processing analysis of electroencephalographic (EEG) signals among different feature extraction techniques to train selected classification algorithms to classify signals related to motor movements. The motor movements considered are related to the left hand, right hand, both fists, feet, and relaxation, making this a multiclass problem. In this study, nine ML algorithms were trained with a dataset created by the feature extraction of EEG signals.The EEG signals of 30 Physionet subjects were used to create a dataset related to movement. We used electrodes C3, C1, CZ, C2, and C4 according to the standard 10-10 placement. Then, we extracted the epochs of the EEG signals and applied tone, amplitude levels, and statistical techniques to obtain the set of features. LabVIEW™2015 version custom applications were used for reading the EEG signals; for channel selection, noise filtering, band selection, and feature extraction operations; and for creating the dataset. MATLAB 2021a was used for training, testing, and evaluating the performance metrics of the ML algorithms. In this study, the model of Medium-ANN achieved the best performance, with an AUC average of 0.9998, Cohen’s Kappa coefficient of 0.9552, a Matthews correlation coefficient of 0.9819, and a loss of 0.0147. These findings suggest the applicability of our approach to different scenarios, such as implementing robotic prostheses, where the use of superficial features is an acceptable option when resources are limited, as in embedded systems or edge computing devices.

Automated service classification is the foundation for service discovery and service composition. Currently, many existing methods extracting features from functional description documents suffer the problem of data sparsity. However, beside functional description documents, the Web API ecosystem has accumulated a wealth of information that can be used to improve the accuracy of Web service (API) classification. At the moment, there is an absence of a unified way to combine functional description documents with other sources of information (e.g., attributes, interactions and external knowledge) accumulated in the Web API ecosystem for API classification. To address this issue, we present a dual-GCN framework that can effectively suppress the noise propagation of textual contents by distinguishing functional description documents and other sources of information (specifically Mashup-API co-invocation patterns by default in this paper) for API classification. This framework is extensible with the ability to include different sources of information accumulated in the Web API ecosystem. Comprehensive experiments on a real-world public dataset demonstrate that our proposed method can outperform various representative methods for API classification.

Advancements in the implementation of quantum hardware have enabled the acquisition of data that are intractable for emulation with classical computers. The integration of classical machine learning (ML) algorithms with these data holds potential for unveiling obscure patterns. Although this hybrid approach extends the class of efficiently solvable problems compared to using only classical computers, this approach has been only realized for solving restricted problems because of the prevalence of noise in current quantum computers. Here, we extend the applicability of the hybrid approach to problems of interest in many-body physics, such as predicting the properties of the ground state of a given Hamiltonian and classifying quantum phases. By performing experiments with various error-reducing procedures on superconducting quantum hardware with 127 qubits, we managed to acquire refined data from the quantum computer. This enabled us to demonstrate the successful implementation of theoretically suggested classical ML algorithms for systems with up to 44 qubits. Our results verify the scalability and effectiveness of the classical ML algorithms for processing quantum experimental data.

Despite the promise for performance and accuracy improvements of quantum inspired (QI) algorithms over classical machine learning (ML) algorithms, such gains have not been realized in practice. The quantum inspired algorithms can theoretically achieve significant speed up based on sampling assumptions and have thus far failed to outperform the existing classical ML models in practical applications. The speedup of quantum machine learning (QML) algorithms assume the access to data in quantum random access memory (QRAM) which is a strong assumption with current quantum architectures. QI algorithms assume sample and query (SQ) access to input vector and norms of matrices using a dynamic data structure. We explore the components of these models and the assumptions in this paper by surveying the recent works in QML and QI Machine learning (QIML) algorithms. We limit our study to QML and QIML models on achieving a speed up over classical ML techniques rather than individual proofs of these algorithms. This study highlights the assumptions being made that are currently not practical for QML and QIML algorithms in achieving performance advantage over classical ML algorithms.

The transition of the World Wide Web from a paradigm of static Web pages to one of dynamic Web services raises a new and challenging problem of locating desired web services. With the expected growth of the number of Web services available on the web, the need for mechanisms that enable the automatic categorization to organize this vast amount of data, becomes important. In this paper we propose Tensor space model for data representation and Rough Set based approach for the classification of Web services. The proposed tensor space model captures the information from internal structure of WSDL documents along with the corresponding text content. Rough sets are used here to combine information of the individual tensor components for providing classification results. Two step improvement on the existing classification results of web services has been shown here. In the first step we achieve better classification results over existing, by using proposed tensor space model. In the second step further improvement of the results has been obtained by using Rough set based ensemble classifier.

Machine learning algorithm can be applied for automating soil type classification. This paper compares several machine learning algorithms for classifying soil type. Algorithms that involve support vector machine (SVM), neural network, decision tree, and naive bayesian are proposed and assessed for this classification. Soil dataset is taken from the real data. Simulation is run by using RapidMiner Studio. The performance observed is the accuracy. The result shows that SVM, with the use of linear function kernel, outperforms the others algorithms. The SVM best accuracy is 82.35%.

In the realm of Internet of Things (IoT) security, malware classification is crucial for identifying, isolating, and mitigating the impacts of malicious software that exploits system vulnerabilities. Effective IoT malware classification employs various machine learning algorithms to enhance detection accuracy and system resilience. The most commonly used Machine Learning algorithms for Malware Classification are "Support Vector Machine (SVM), Random Forest (RF), Naive Bayes (NB), and Logistic Regression (LR)". Each of these algorithms has distinct advantages in identifying malware, but this study explores the creation of an Ensemble / Hybrid model by integrating the two most effective machine learning algorithms, which can lead to superior performance. The proposed model outperforms the simple models mentioned above and other related works discussed in the literature. Key performance metrics evaluated for this work includes Accuracy, Precision, Recall, F-Score. This advancement is vital for improving the security posture of IOT systems by providing a more reliable mechanism for early detection and effective response to emerging malware threats

Recent advances in machine learning techniques have significantly influenced the development of early diabetes detection systems. In this paper, different machine learning (ML) algorithms are employed for diabetes detection based on hand movement. The spatial and temporal information for horizontal and vertical hand movement deviations for both diabetic and non-diabetic subjects are obtained using a data acquisition system. A dataset is constructed based on the obtained hand movement information along with other related attributes such as age, gender, weight and vision health. Binary classification of diabetic and non-diabetic subjects is achieved using several machine learning algorithms. These algorithms include Naïve Bayes (NB), Logistic Regression (LR), Linear Discriminate Analysis (LDA), Classification and Regression Tree (CART), k-Nearest Neighbors (KNN), Support Vector Machine (SVM) and Multi-layer Perceptron (MLP). The considered ML algorithms are evaluated and ranked according to a set of key performance metrics that include accuracy, precision, recall and F-1 score. Algorithm ranking results demonstrate that LR, CART, KNN and MLP algorithms have achieved higher ranking positions as compared to other algorithms. The best ranked ML algorithms are then validated and thoroughly investigated to prove their ability to discriminate between diabetic and non-diabetic subjects. Validation results show that the best-ranked ML algorithms have achieved high classification accuracy, precision, recall and F-1 scores. Therefore, the considered machine learning algorithms can serve as efficient tools for diabetes detection based on the constructed dataset.

An intrusion detection system (IDS) is an important protection instrument for detecting complex network attacks. Various machine learning (ML) or deep learning (DL) algorithms have been proposed for implementing anomaly-based IDS (AIDS). Our review of the AIDS literature identifies some issues in related work, including the randomness of the selected algorithms, parameters, and testing criteria, the application of old datasets, or shallow analyses and validation of the results. This paper comprehensively reviews previous studies on AIDS by using a set of criteria with different datasets and types of attacks to set benchmarking outcomes that can reveal the suitable AIDS algorithms, parameters, and testing criteria. Specifically, this paper applies 10 popular supervised and unsupervised ML algorithms for identifying effective and efficient ML-AIDS of networks and computers. These supervised ML algorithms include the artificial neural network (ANN), decision tree (DT), k-nearest neighbor (k-NN), naive Bayes (NB), random forest (RF), support vector machine (SVM), and convolutional neural network (CNN) algorithms, whereas the unsupervised ML algorithms include the expectation-maximization (EM), k-means, and self-organizing maps (SOM) algorithms. Several models of these algorithms are introduced, and the turning and training parameters of each algorithm are examined to achieve an optimal classifier evaluation. Unlike previous studies, this study evaluates the performance of AIDS by measuring the true positive and negative rates, accuracy, precision, recall, and F-Score of 31 ML-AIDS models. The training and testing time for ML-AIDS models are also considered in measuring their performance efficiency given that time complexity is an important factor in AIDSs. The ML-AIDS models are tested by using a recent and highly unbalanced multiclass CICIDS2017 dataset that involves real-world network attacks. In general, the k-NN-AIDS, DT-AIDS, and NB-AIDS models obtain the best results and show a greater capability in detecting web attacks compared with other models that demonstrate irregular and inferior results.

6 - Machine learning and deep learning algorithms for fault diagnosis of photovoltaic systems

Phenomics is a technology-driven approach with promising future to obtain unbiased data of biological systems. Image acquisition is relatively simple. However data handling and analysis are not as developed compared to the sampling capacities. We present a system based on machine learning (ML) algorithms and computer vision intended to solve the automatic phenotype data analysis in plant material. We developed a growth-chamber able to accommodate species of various sizes. Night image acquisition requires near infrared lightning. For the ML process, we tested three different algorithms: k-nearest neighbour (kNN), Naive Bayes Classifier (NBC), and Support Vector Machine. Each ML algorithm was executed with different kernel functions and they were trained with raw data and two types of data normalisation. Different metrics were computed to determine the optimal configuration of the machine learning algorithms. We obtained a performance of 99.31% in kNN for RGB images and a 99.34% in SVM for NIR. Our results show that ML techniques can speed up phenomic data analysis. Furthermore, both RGB and NIR images can be segmented successfully but may require different ML algorithms for segmentation.