19,424 research outputs found
A Long Short-Term Memory Recurrent Neural Network Framework for Network Traffic Matrix Prediction
Network Traffic Matrix (TM) prediction is defined as the problem of
estimating future network traffic from the previous and achieved network
traffic data. It is widely used in network planning, resource management and
network security. Long Short-Term Memory (LSTM) is a specific recurrent neural
network (RNN) architecture that is well-suited to learn from experience to
classify, process and predict time series with time lags of unknown size. LSTMs
have been shown to model temporal sequences and their long-range dependencies
more accurately than conventional RNNs. In this paper, we propose a LSTM RNN
framework for predicting short and long term Traffic Matrix (TM) in large
networks. By validating our framework on real-world data from GEANT network, we
show that our LSTM models converge quickly and give state of the art TM
prediction performance for relatively small sized models.Comment: Submitted for peer review. arXiv admin note: text overlap with
arXiv:1402.1128 by other author
Short-term Demand Forecasting for Online Car-hailing Services using Recurrent Neural Networks
Short-term traffic flow prediction is one of the crucial issues in
intelligent transportation system, which is an important part of smart cities.
Accurate predictions can enable both the drivers and the passengers to make
better decisions about their travel route, departure time and travel origin
selection, which can be helpful in traffic management. Multiple models and
algorithms based on time series prediction and machine learning were applied to
this issue and achieved acceptable results. Recently, the availability of
sufficient data and computational power, motivates us to improve the prediction
accuracy via deep-learning approaches. Recurrent neural networks have become
one of the most popular methods for time series forecasting, however, due to
the variety of these networks, the question that which type is the most
appropriate one for this task remains unsolved. In this paper, we use three
kinds of recurrent neural networks including simple RNN units, GRU and LSTM
neural network to predict short-term traffic flow. The dataset from TAP30
Corporation is used for building the models and comparing RNNs with several
well-known models, such as DEMA, LASSO and XGBoost. The results show that all
three types of RNNs outperform the others, however, more simple RNNs such as
simple recurrent units and GRU perform work better than LSTM in terms of
accuracy and training time.Comment: arXiv admin note: text overlap with arXiv:1706.06279,
arXiv:1804.04176 by other author
Training recurrent neural networks robust to incomplete data: application to Alzheimer's disease progression modeling
Disease progression modeling (DPM) using longitudinal data is a challenging
machine learning task. Existing DPM algorithms neglect temporal dependencies
among measurements, make parametric assumptions about biomarker trajectories,
do not model multiple biomarkers jointly, and need an alignment of subjects'
trajectories. In this paper, recurrent neural networks (RNNs) are utilized to
address these issues. However, in many cases, longitudinal cohorts contain
incomplete data, which hinders the application of standard RNNs and requires a
pre-processing step such as imputation of the missing values. Instead, we
propose a generalized training rule for the most widely used RNN architecture,
long short-term memory (LSTM) networks, that can handle both missing predictor
and target values. The proposed LSTM algorithm is applied to model the
progression of Alzheimer's disease (AD) using six volumetric magnetic resonance
imaging (MRI) biomarkers, i.e., volumes of ventricles, hippocampus, whole
brain, fusiform, middle temporal gyrus, and entorhinal cortex, and it is
compared to standard LSTM networks with data imputation and a parametric,
regression-based DPM method. The results show that the proposed algorithm
achieves a significantly lower mean absolute error (MAE) than the alternatives
with p < 0.05 using Wilcoxon signed rank test in predicting values of almost
all of the MRI biomarkers. Moreover, a linear discriminant analysis (LDA)
classifier applied to the predicted biomarker values produces a significantly
larger AUC of 0.90 vs. at most 0.84 with p < 0.001 using McNemar's test for
clinical diagnosis of AD. Inspection of MAE curves as a function of the amount
of missing data reveals that the proposed LSTM algorithm achieves the best
performance up until more than 74% missing values. Finally, it is illustrated
how the method can successfully be applied to data with varying time intervals.Comment: arXiv admin note: substantial text overlap with arXiv:1808.0550
- …