scispace - formally typeset
Open AccessPosted Content

Sample Adaptive Multiple Kernel Learning for Failure Prediction of Railway Points

TLDR
In this article, a robust multiple kernel learning algorithm was proposed to predict railway points failures in the Sydney Trains rail network, which is an extensive network of passenger and freight railways.
Abstract
Railway points are among the key components of railway infrastructure. As a part of signal equipment, points control the routes of trains at railway junctions, having a significant impact on the reliability, capacity, and punctuality of rail transport. Traditionally, maintenance of points is based on a fixed time interval or raised after the equipment failures. Instead, it would be of great value if we could forecast points' failures and take action beforehand, minimising any negative effect. To date, most of the existing prediction methods are either lab-based or relying on specially installed sensors which makes them infeasible for large-scale implementation. Besides, they often use data from only one source. We, therefore, explore a new way that integrates multi-source data which are ready to hand to fulfil this task. We conducted our case study based on Sydney Trains rail network which is an extensive network of passenger and freight railways. Unfortunately, the real-world data are usually incomplete due to various reasons, e.g., faults in the database, operational errors or transmission faults. Besides, railway points differ in their locations, types and some other properties, which means it is hard to use a unified model to predict their failures. Aiming at this challenging task, we firstly constructed a dataset from multiple sources and selected key features with the help of domain experts. In this paper, we formulate our prediction task as a multiple kernel learning problem with missing kernels. We present a robust multiple kernel learning algorithm for predicting points failures. Our model takes into account the missing pattern of data as well as the inherent variance on different sets of railway points. Extensive experiments demonstrate the superiority of our algorithm compared with other state-of-the-art methods.

read more

Citations
More filters
Posted Content

Potential Passenger Flow Prediction: A Novel Study for Urban Transportation Development

TL;DR: Wang et al. as discussed by the authors proposed a multi-view localized correlation learning method to predict the potential passenger flow (PPF) in urban areas by learning the passenger flow correlations between the target areas and their localized areas with adaptive weight.
Journal ArticleDOI

Group-based local adaptive deep multiple kernel learning with lp norm.

TL;DR: Experiments on UCI and Caltech 256 datasets demonstrate that the proposed GLDMKL method is more accurate in classification accuracy than other deep multiple kernel learning methods, especially for datasets with relatively complex data.
Journal ArticleDOI

Forecasting Fine-Grained Urban Flows Via Spatio-Temporal Contrastive Self-Supervision

TL;DR: Empirical results not only show the superiority of the model against other comparative models, but also demonstrate its effectiveness in the resource-limited environment.
Proceedings ArticleDOI

Traffic Flow Prediction Based on Spatio-temporal Attention Block

TL;DR: Wang et al. as mentioned in this paper proposed a model with spatio-temporal attention block (STA), which divides time into different scales and dynamically aggregates time features through multi-head attention in temporal attention block.
Book ChapterDOI

Predicting Abnormal Events in Urban Rail Transit Systems with Multivariate Point Process

TL;DR: A non-trivial method which categorizes event pairs based on their basic information, and then characterizes inter-event influence between event pairs via a multivariate Hawkes process overcomes the major hurdle of data sparsity in abnormal events, and retains its efficacy in capturing the underlying dynamics of event sequences.
References
More filters
Journal ArticleDOI

LIBSVM: A library for support vector machines

TL;DR: Issues such as solving SVM optimization problems theoretical convergence multiclass classification probability estimates and parameter selection are discussed in detail.
Journal Article

LIBLINEAR: A Library for Large Linear Classification

TL;DR: LIBLINEAR is an open source library for large-scale linear classification that supports logistic regression and linear support vector machines and provides easy-to-use command-line tools and library calls for users and developers.
Proceedings Article

Random Features for Large-Scale Kernel Machines

TL;DR: Two sets of random features are explored, provided convergence bounds on their ability to approximate various radial basis kernels, and it is shown that in large-scale classification and regression tasks linear machine learning algorithms applied to these features outperform state-of-the-art large- scale kernel machines.
Journal Article

Multiple Kernel Learning Algorithms

TL;DR: Overall, using multiple kernels instead of a single one is useful and it is believed that combining kernels in a nonlinear or data-dependent way seems more promising than linear combination in fusing information provided by simple linear kernels, whereas linear methods are more reasonable when combining complex Gaussian kernels.
BookDOI

The Schur complement and its applications

Fuzhen Zhang
TL;DR: Schur complements in statistics and probability have been used in Numerical Analysis as mentioned in this paper, where the Schur Complement has been applied in statistical and probability analysis. But their application is limited to statistical analysis.
Related Papers (5)