Kernel association for classification and prediction: a survey

An approach to robust condition monitoring in industrial processes using pythagorean membership grades

In this paper, a robust approach to improve the performance of a condition monitoring process in industrial plants by using Pythagorean membership grades is presented. The FCM algorithm is modified by using Pythagorean fuzzy sets, to obtain a new variant of it called Pythagorean Fuzzy C-Means (PyFCM). In addition, a kernel version of PyFCM (KPyFCM) is obtained in order to achieve greater separability among classes, and reduce classification errors. The approach proposed is validated using experimental datasets and the Tennessee Eastman (TE) process benchmark. The results are compared with the results obtained with other algorithms that use standard and non-standard membership grades. The highest performance obtained by the approach proposed indicate its feasibility.

Criteria for optimizing kernel methods in fault monitoring process: A survey

Nowadays, how to select the kernel function and their parameters for ensuring high-performance indicators in fault diagnosis applications remains as two open research issues. This paper provides a comprehensive literature survey of kernel-preprocessing methods in condition monitoring tasks, with emphasis on the procedures for selecting their parameters. Accordingly, twenty kernel optimization criteria and sixteen kernel functions are analyzed. A kernel evaluation framework is further provided for helping in the selection and adjustment of kernel functions. The proposal is validated via a KPCA-based monitoring scheme and two well-known benchmark processes.

Predicting non-attendance in hospital outpatient appointments using deep learning approach

The hospital outpatient non-attendance imposes a substantial financial burden on hospitals and roots in multiple diverse reasons. This research aims to build an advanced predictive model for predicting non-attendance regarding the whole spectrum of probable contributing factors to non-attendance that could be collated from heterogeneous sources including electronic patients records and external non-hospital data. We proposed a new non-attendance prediction model based on deep neural networks and machine learning models. The proposed approach works upon sparse stacked denoising autoencoders (SDAEs) to learn the underlying manifold of data and thereby compacting information and providing a better representation that can be utilised afterwards by other learning models as well. The proposed approach is evaluated over real hospital data and compared with several well-known and scalable machine learning models. The evaluation results reveal the proposed approach with softmax layer and logistic regression outperforms other methods in practice.

Learning soft sensors using time difference-based multi-kernel relevance vector machine with applications for quality-relevant monitoring in wastewater treatment

Considering the time-varying, uncertain and non-linear properties of the wastewater treatment process (WWTPs), a novel multi-kernel relevance vector machine (MRVM) soft sensor based on time difference (TD) is proposed to predict the quality-relevant but difficult-to-measure variable. Firstly, a novel dimension reduction technique is introduced to reduce data dimension and model complexity. Secondly, the parameters of the kernel model are optimized by the intelligent optimization algorithm (PSO). Besides, the TD strategy is introduced to enhance the robustness of MRVM when exposing to dynamic environments. Finally, the proposed model was assessed through two simulation studies and a real WWTP with the results demonstrating the effectiveness of the proposed model. Graphical abstract Framework of Lasso-TD-MRVM soft sensor model.

Semisupervised classification of hyperspectral images with low-rank representation kernel

A semisupervised deformed kernel function, using low-rank representation with consideration of local geometrical structure of data, is presented for the classification of hyperspectral images. The proposed method incorporates the wealth of unlabeled information to deal with the limited labeled samples situation as a common case in HSIs applications. The proposed kernel needs to be computed before training the classifier, e.g., a support vector machine, and it relies on combining the standard radial basis function kernel based on labeled information and the low-rank representation kernel obtained using all available (labeled and unlabeled) information. The low-rank representation kernel can overcome the difficulties of clustering methods that are used to construct the kernels such as bagged kernel and multi-scale bagged kernel. The experimental results of two well-known HSIs data sets demonstrate the effectiveness of the proposed method in comparison with cluster kernels obtained using traditional clustering methods and graph learning methods.

Prediction of progression in idiopathic pulmonary fibrosis using CT scans at baseline: A quantum particle swarm optimization - Random forest approach

Idiopathic pulmonary fibrosis (IPF) is a fatal lung disease characterized by an unpredictable progressive decline in lung function. Natural history of IPF is unknown and the prediction of disease progression at the time of diagnosis is notoriously difficult. High resolution computed tomography (HRCT) has been used for the diagnosis of IPF, but not generally for monitoring purpose. The objective of this work is to develop a novel predictive model for the radiological progression pattern at voxel-wise level using only baseline HRCT scans. Mainly, there are two challenges: (a) obtaining a data set of features for region of interest (ROI) on baseline HRCT scans and their follow-up status; and (b) simultaneously selecting important features from high-dimensional space, and optimizing the prediction performance. We resolved the first challenge by implementing a study design and having an expert radiologist contour ROIs at baseline scans, depending on its progression status in follow-up visits. For the second challenge, we integrated the feature selection with prediction by developing an algorithm using a wrapper method that combines quantum particle swarm optimization to select a small number of features with random forest to classify early patterns of progression. We applied our proposed algorithm to analyze anonymized HRCT images from 50 IPF subjects from a multi-center clinical trial. We showed that it yields a parsimonious model with 81.8% sensitivity, 82.2% specificity and an overall accuracy rate of 82.1% at the ROI level. These results are superior to other popular feature selections and classification methods, in that our method produces higher accuracy in prediction of progression and more balanced sensitivity and specificity with a smaller number of selected features. Our work is the first approach to show that it is possible to use only baseline HRCT scans to predict progressive ROIs at 6 months to 1year follow-ups using artificial intelligence.

Spatio-Temporal Interpolated Echo State Network for Meteorological Series Prediction

Spatio-temporal series prediction has attracted increasing attention in the field of meteorology in recent years. The spatial and temporal joint effect makes predictions challenging. Most of the existing spatio-temporal prediction models are computationally complicated. To develop an accurate but easy-to-implement spatio-temporal prediction model, this paper designs a novel spatio-temporal prediction model based on echo state networks. For real-world observed meteorological data with randomness and large changes, we use a cubic spline method to bridge the gaps between the neighboring points, which results in a pleasingly smooth series. The interpolated series is later input into the spatio-temporal echo state networks, in which the spatial coefficients are computed by the elastic-net algorithm. This approach offers automatic selection and continuous shrinkage of the spatial variables. The proposed model provides an intuitive but effective approach to address the interaction of spatial and temporal effects. To demonstrate the practicality of the proposed model, we apply it to predict two real-world datasets: monthly precipitation series and daily air quality index series. Experimental results demonstrate that the proposed model achieves a normalized root-mean-square error of approximately 0.250 on both datasets. Similar results are achieved on the long short-term memory model, but the computation time of our proposed model is considerably shorter. It can be inferred that our proposed neural network model has advantages on predicting meteorological series over other models.

Organizational Data Classification Based on the Importance Concept of Complex Networks

Data classification is a common task, which can be performed by both computers and human beings. However, a fundamental difference between them can be observed: computer-based classification considers only physical features (e.g., similarity, distance, or distribution) of input data; by contrast, brain-based classification takes into account not only physical features, but also the organizational structure of data. In this paper, we figure out the data organizational structure for classification using complex networks constructed from training data. Specifically, an unlabeled instance is classified by the importance concept characterized by Google's PageRank measure of the underlying data networks. Before a test data instance is classified, a network is constructed from vector-based data set and the test instance is inserted into the network in a proper manner. To this end, we also propose a measure, called spatio-structural differential efficiency, to combine the physical and topological features of the input data. Such a method allows for the classification technique to capture a variety of data patterns using the unique importance measure. Extensive experiments demonstrate that the proposed technique has promising predictive performance on the detection of heart abnormalities.

Budget Online Learning Algorithm for Least Squares SVM

Batch-mode least squares support vector machine (LSSVM) is often associated with unbounded number of support vectors (SVs'), making it unsuitable for applications involving large-scale streaming data. Limited-scale LSSVM, which allows efficient updating, seems to be a good solution to tackle this issue. In this paper, to train the limited-scale LSSVM dynamically, we present a budget online LSSVM (BOLSSVM) algorithm. Methodologically, by setting a fixed budget for SVs', we are able to update the LSSVM model according to the updated SVs' set dynamically without retraining from scratch. In particular, when a new small chunk of SVs' substitute for the old ones, the proposed algorithm employs a low rank correction technology and the Sherman-Morrison-Woodbury formula to compute the inverse of saddle point matrix derived from the LSSVM's Karush-Kuhn-Tucker (KKT) system, which, in turn, updates the LSSVM model efficiently. In this way, the proposed BOLSSVM algorithm is especially useful for online prediction tasks. Another merit of the proposed BOLSSVM is that it can be used for k -fold cross validation. Specifically, compared with batch-mode learning methods, the computational complexity of the proposed BOLSSVM method is significantly reduced from O(n⁴) to O(n³) for leave-one-out cross validation with n training samples. The experimental results of classification and regression on benchmark data sets and real-world applications show the validity and effectiveness of the proposed BOLSSVM algorithm.