- Research Article
8
- 10.1016/j.asoc.2017.07.040
Semi-supervised matrixized least squares support vector machine
- Jul 25, 2017
- Applied Soft Computing
- Huimin Pei + 2 more +2
Semi-supervised matrixized least squares support vector machine
Semi-supervised learning (SSL), as a powerful tool to learn from a limited number of labeled data and a large number of unlabeled data, has been attracting increasing attention in the machine learning community. In particular, the manifold regularization framework has laid solid theoretical foundations for a large family of SSL algorithms, such as Laplacian support vector machine (LapSVM) and Laplacian regularized least squares (LapRLS). However, most of these algorithms are limited to small scale problems due to the high computational cost of the matrix inversion operation involved in the optimization problem. In this paper, we propose a novel framework called Laplacian embedded regression by introducing an intermediate decision variable into the manifold regularization framework. By using ∈-insensitive loss, we obtain the Laplacian embedded support vector regression (LapESVR) algorithm, which inherits the sparse solution from SVR. Also, we derive Laplacian embedded RLS (LapERLS) corresponding to RLS under the proposed framework. Both LapESVR and LapERLS possess a simpler form of a transformed kernel, which is the summation of the original kernel and a graph kernel that captures the manifold structure. The benefits of the transformed kernel are two-fold: (1) we can deal with the original kernel matrix and the graph Laplacian matrix in the graph kernel separately and (2) if the graph Laplacian matrix is sparse, we only need to perform the inverse operation for a sparse matrix, which is much more efficient when compared with that for a dense one. Inspired by kernel principal component analysis, we further propose to project the introduced decision variable into a subspace spanned by a few eigenvectors of the graph Laplacian matrix in order to better reflect the data manifold, as well as accelerate the calculation of the graph kernel, allowing our methods to efficiently and effectively cope with large scale SSL problems. Extensive experiments on both toy and real world data sets show the effectiveness and scalability of the proposed framework.
Semi-supervised matrixized least squares support vector machine
Semi-supervised matrixized least squares support vector machine
Semi-Supervised Broad Learning System Based on Manifold Regularization and Broad Network
Broad Learning System (BLS) are widely used in many fields because of its strong feature extraction ability and high computational efficiency. However, the BLS is mainly used in supervised learning, which greatly limits the applicability of the BLS. And the obtained data is less labeled data, but is a large number of unlabeled data. Therefore, the BLS is extended based on the semi-supervised learning of manifold regularization framework to propose a semi-supervised broad learning system (SS-BLS). Firstly, the features are extracted from labeled and unlabeled data by building feature nodes and enhancement nodes. Then the manifold regularization framework is used to construct Laplacian matrix. Next, the feature nodes, enhancement nodes and Laplacian matrix are combined to construct the objective function, which is effectively solved by ridge regression in order to obtain the output coefficients. Finally, the validity of the SS-BLS is verified by three different complex data of G50C, MNIST, and NORB, respectively. The experiment result show that the SS-BLS can achieve higher classification accuracy for different complex data, takes on fast operation speed and strong generalization ability.
Read moreLaplacian minimax probability machine
Laplacian minimax probability machine
Nonlinear Metric Learning for Semi-Supervised Learning via Coherent Point Drifting
In this paper, we propose a nonlinear metric learning framework to boost the performance of semi-supervised learning (SSL) algorithms. Constructed on top of Laplacian SVM (LapSVM), the proposed method learns a smooth nonlinear feature space transformation that makes the input data points more linearly separable. Coherent point drifting (CPD) is utilized as the geometric model with the consideration of its remarkable expressive power in generating sophisticated yet smooth deformations. Our framework has broad applicability, and it can be integrated with many other SSL classifiers than LapSVM. Experiments performed on synthetic and real world datasets show the effectiveness of our CPD-LapSVM over the state-of-the-art metric learning solutions in SSL.
Read moreSSC-EKE: Semi-supervised classification with extensive knowledge exploitation
SSC-EKE: Semi-supervised classification with extensive knowledge exploitation
User behaviour modelling by abstracting low-level window transition logs
This paper proposes a novel framework for modelling user behaviour from low-level computer usage logs aiming to find working patterns and behaviours of employees at work. The logs we analyse are recorded in individual computers for employees in a company, and include active window transitions on display. Our framework consists of three levels of abstraction: 1 modelling user behaviour patterns by hidden Markov models; 2 clustering user behaviour models by kernel principal component analysis with a graph kernel; 3 extracting common patterns from clusters. The experimental results show that our method reveals implicit user behaviour at a high level of abstraction, and allows us to understand individual user behaviour among groups, and over time.
Read moreSemi-supervised learning and condition fusion for fault diagnosis
Semi-supervised learning and condition fusion for fault diagnosis
Semi-supervised manifold learning with affinity regularization for Alzheimer's disease identification using positron emission tomography imaging.
Dementia, Alzheimer's disease (AD) in particular is a global problem and big threat to the aging population. An image based computer-aided dementia diagnosis method is needed to providing doctors help during medical image examination. Many machine learning based dementia classification methods using medical imaging have been proposed and most of them achieve accurate results. However, most of these methods make use of supervised learning requiring fully labeled image dataset, which usually is not practical in real clinical environment. Using large amount of unlabeled images can improve the dementia classification performance. In this study we propose a new semi-supervised dementia classification method based on random manifold learning with affinity regularization. Three groups of spatial features are extracted from positron emission tomography (PET) images to construct an unsupervised random forest which is then used to regularize the manifold learning objective function. The proposed method, stat-of-the-art Laplacian support vector machine (LapSVM) and supervised SVM are applied to classify AD and normal controls (NC). The experiment results show that learning with unlabeled images indeed improves the classification performance. And our method outperforms LapSVM on the same dataset.
Read moreClassification by semi-supervised discriminative regularization
Classification by semi-supervised discriminative regularization
Prototype Regularized Manifold Regularization Technique for Semi-Supervised Online Extreme Learning Machine.
Data streaming applications such as the Internet of Things (IoT) require processing or predicting from sequential data from various sensors. However, most of the data are unlabeled, making applying fully supervised learning algorithms impossible. The online manifold regularization approach allows sequential learning from partially labeled data, which is useful for sequential learning in environments with scarcely labeled data. Unfortunately, the manifold regularization technique does not work out of the box as it requires determining the radial basis function (RBF) kernel width parameter. The RBF kernel width parameter directly impacts the performance as it is used to inform the model to which class each piece of data most likely belongs. The width parameter is often determined off-line via hyperparameter search, where a vast amount of labeled data is required. Therefore, it limits its utility in applications where it is difficult to collect a great deal of labeled data, such as data stream mining. To address this issue, we proposed eliminating the RBF kernel from the manifold regularization technique altogether by combining the manifold regularization technique with a prototype learning method, which uses a finite set of prototypes to approximate the entire data set. Compared to other manifold regularization approaches, this approach instead queries the prototype-based learner to find the most similar samples for each sample instead of relying on the RBF kernel. Thus, it no longer necessitates the RBF kernel, which improves its practicality. The proposed approach can learn faster and achieve a higher classification performance than other manifold regularization techniques based on experiments on benchmark data sets. Results showed that the proposed approach can perform well even without using the RBF kernel, which improves the practicality of manifold regularization techniques for semi-supervised learning.
Read moreLeave-One-Out Cross-Validation Based Model Selection for Manifold Regularization
Classified labels are expensive by virtue of the utilization of field knowledge while the unlabeled data contains significant information, which can not be explored by supervised learning The Manifold Regularization (MR) based semi-supervised learning (SSL) could explores information from both labeled and unlabeled data Moreover, the model selection of MR seriously affects its predictive performance due to the inherent additional geometry regularizer of SSL In this paper, a leave-one-out cross-validation based PRESS criterion is first presented for model selection of MR to choose appropriate regularization coefficients and kernel parameters The Manifold regularization and model selection algorithm are employed to a real-life benchmark dataset The proposed approach, leveraged by effectively exploiting the embedded intrinsic geometric manifolds, outperforms the original MR and supervised learning approaches.
Read moreRobust Structure-Aware Graph-based Semi-Supervised Learning: Batch and Recursive Processing
Graph-based semi-supervised learning plays an important role in large scale image classification tasks. However, the problem becomes very challenging in the presence of noisy labels and outliers. Moreover, traditional robust semi-supervised learning solutions suffers from prohibitive computational burdens thus cannot be computed for streaming data. Motivated by that, we present a novel unified framework robust structure-aware semi-supervised learning called Unified RSSL (URSSL) for batch processing and recursive processing robust to both outliers and noisy labels. Particularly, URSSL applies joint semi-supervised dimensionality reduction with robust estimators and network sparse regularization simultaneously on the graph Laplacian matrix iteratively to preserve the intrinsic graph structure and ensure robustness to the compound noise. First, in order to relieve the influence from outliers, a novel semi-supervised robust dimensionality reduction is applied relying on robust estimators to suppress outliers. Meanwhile, to tackle noisy labels, the denoised graph similarity information is encoded into the network regularization. Moreover, by identifying strong relevance of dimensionality reduction and network regularization in the context of robust semi-supervised learning (RSSL), a two-step alternative optimization is derived to compute optimal solutions with guaranteed convergence. We further derive our framework to adapt to large scale semi-supervised learning particularly suitable for large scale image classification and demonstrate the model robustness under different adversarial attacks. For recursive processing, we rely on reparameterization to transform the formulation to unlock the challenging problem of robust streaming-based semi-supervised learning. Last but not least, we extend our solution into distributed solutions to resolve the challenging issue of distributed robust semi-supervised learning when images are captured by multiple cameras at different locations. Extensive experimental results demonstrate the promising performance of this framework when applied to multiple benchmark datasets with respect to state-of-the-art approaches for important applications in the areas of image classification and spam data analysis.
Read moreTime series modelling, NARX neural network and hybrid KPCA–SVR approach to forecast the foreign exchange market in Mauritius
PurposeThis study constructs time series model, artificial neural networks (ANNs) and statistical topologies to examine the volatility and forecast foreign exchange rates. The Mauritian forex market has been utilized as a case study, and daily data for nominal spot rate (during a time period of five years spanning from 2014 to 2018) for EUR/MUR, GBP/MUR, CAD/MUR and AUD/MUR have been applied for the predictions.Design/methodology/approachAutoregressive integrated moving average (ARIMA) and generalized autoregressive conditional heteroskedasticity (GARCH) models are used as a basis for time series modelling for the analysis, along with the non-linear autoregressive network with exogenous inputs (NARX) neural network backpropagation algorithm utilizing different training functions, namely, Levenberg–Marquardt (LM), Bayesian regularization and scaled conjugate gradient (SCG) algorithms. The study also features a hybrid kernel principal component analysis (KPCA) using the support vector regression (SVR) algorithm as an additional statistical tool to conduct financial market forecasting modelling. Mean squared error (MSE) and root mean square error (RMSE) are employed as indicators for the performance of the models.FindingsThe results demonstrated that the GARCH model performed better in terms of volatility clustering and prediction compared to the ARIMA model. On the other hand, the NARX model indicated that LM and Bayesian regularization training algorithms are the most appropriate method of forecasting the different currency exchange rates as the MSE and RMSE seemed to be the lowest error compared to the other training functions. Meanwhile, the results reported that NARX and KPCA–SVR topologies outperformed the linear time series models due to the theory based on the structural risk minimization principle. Finally, the comparison between the NARX model and KPCA–SVR illustrated that the NARX model outperformed the statistical prediction model. Overall, the study deduced that the NARX topology achieves better prediction performance results compared to time series and statistical parameters.Research limitations/implicationsThe foreign exchange market is considered to be instable owing to uncertainties in the economic environment of any country and thus, accurate forecasting of foreign exchange rates is crucial for any foreign exchange activity. The study has an important economic implication as it will help researchers, investors, traders, speculators and financial analysts, users of financial news in banking and financial institutions, money changers, non-banking financial companies and stock exchange institutions in Mauritius to take investment decisions in terms of international portfolios. Moreover, currency rates instability might raise transaction costs and diminish the returns in terms of international trade. Exchange rate volatility raises the need to implement a highly organized risk management measures so as to disclose future trend and movement of the foreign currencies which could act as an essential guidance for foreign exchange participants. By this way, they will be more alert before conducting any forex transactions including hedging, asset pricing or any speculation activity, take corrective actions, thus preventing them from making any potential losses in the future and gain more profit.Originality/valueThis is one of the first studies applying artificial intelligence (AI) while making use of time series modelling, the NARX neural network backpropagation algorithm and hybrid KPCA–SVR to predict forex using multiple currencies in the foreign exchange market in Mauritius.
Read moreAn ELM-Based Semi-Supervised Indoor Localization Technique With Clustering Analysis and Feature Extraction
In this article, a new indoor localization technique with extreme learning machine (ELM) is proposed where only a small number of received signal strength indicator (RSSI) measurements are labeled. In the off-line learning phase, the iterative self organizing data analysis techniques algorithm (ISODATA) is used to divide the RSSI measurements into some measurement data subsets. Then the multi-kernel ELM (MK-ELM) method is utilized to perform classification learning and obtain the RSSI measurement classification function. For each RSSI measurement subset, a two-stage feature extraction algorithm using the kernel principal component analysis, the deep learning network and ELM method is proposed for RSSI measurement feature extraction. At last, the position regression function of each subset is obtained by the semi-supervised regression learning. In the on-line position estimation phase, using the measurement classification and feature extraction of the received RSSI measurement, the position is estimated based on the corresponding position regression function. The field tests show that the proposed algorithm can obtain more accurate position estimation than other existing ELM based localization approaches do.
Read moreSemi-supervised classification for hyperspectral imagery based on spatial-spectral Label Propagation
Semi-supervised classification for hyperspectral imagery based on spatial-spectral Label Propagation