16 July 2014 in Transportmetrica A: Transport Science
Due to the increase in vehicle transit and congestion in road networks, providing information about the state of the traffic to commuters has become a critical issue for Advanced Traveller Information Systems. These systems should assist users in making pre-trip and en-route decisions and, for this purpose, delivering travel time information is very useful because it is very intuitive and easily understood by all travellers. The aim of this paper is to present a global view of the literature on the modelling of travel time, introducing essential concepts and giving a thorough classification of the existing techniques. Most of the attention will focus on travel time estimation and travel time prediction, which are two of the most relevant challenges in travel time modelling. The definition and goals of these two modelling tasks along with the methodologies used to carry them out will be further explored and categorised.Basque Government, Saiotek IT-609-13.\ud Spanish Ministry of Science and Innovation TIN2010-14931. \ud COMBIOMED network in computational biomedicine (Carlos III Health Institute). \ud Diputacion Foral de Gipuzkoa, 2011-CIEN-000060-01. \ud CRC-Biomarkers project (Diputacion Foral de Bizkaia), 6-12-TK-2011-014.\ud Fundacion Inaki Goenaga.\ud University of the Basque Country UPV/EHU
12 August 2020 in IEEE Transactions on Network and Service Management
The identification of network attacks which target information and communication systems has been a focus of the research community for years. Network intrusion detection is a complex problem which presents a diverse number of challenges. Many attacks currently remain undetected, while newer ones emerge due to the proliferation of connected devices and the evolution of communication technology. In this survey, we review the methods that have been applied to network data with the purpose of developing an intrusion detector, but contrary to previous reviews in the area, we analyze them from the perspective of the Knowledge Discovery in Databases (KDD) process. As such, we discuss the techniques used for the collecion, preprocessing and transformation of the data, as well as the data mining and evaluation methods. We also present the characteristics and motivations behind the use of each of these techniques and propose more adequate and up-to-date taxonomies and definitions for intrusion detectors based on the terminology used in the area of data mining and KDD. Special importance is given to the evaluation procedures followed to assess the detectors, discussing their applicability in current, real networks. Finally, as a result of this literature review, we investigate some open issues which will need to be considered for further research in the area of network security.
13 January 2012 in Progress in Artificial Intelligence
29 April 2013 in IEEE Transactions on Evolutionary Computation
The aim of this paper is two-fold. First, we introduce a novel general estimation of distribution algorithm to deal with permutation-based optimization problems. The algorithm is based on the use of a probabilistic model for permutations called the generalized Mallows model. In order to prove the potential of the proposed algorithm, our second aim is to solve the permutation flowshop scheduling problem. A hybrid approach consisting of the new estimation of distribution algorithm and a variable neighborhood search is proposed. Conducted experiments demonstrate that the proposed algorithm is able to outperform the state-of-the-art approaches. Moreover, from the 220 benchmark instances tested, the proposed hybrid approach obtains new best known results in 152 cases. An in-depth study of the results suggests that the successful performance of the introduced approach is due to the ability of the generalized Mallows estimation of distribution algorithm to discover promising regions in the search space.
20 November 2017 in IEEE Transactions on Neural Networks and Learning Systems
The problem of early classification of time series appears naturally in contexts where the data, of temporal nature, are collected over time, and early class predictions are interesting or even required. The objective is to classify the incoming sequence as soon as possible, while maintaining suitable levels of accuracy in the predictions. Thus, we can say that the problem of early classification consists of optimizing two objectives simultaneously: accuracy and earliness. In this context, we present a method for early classification based on combining a set of probabilistic classifiers together with a stopping rule (SR). This SR will act as a trigger and will tell us when to output a prediction or when to wait for more data, and its main novelty lies in the fact that it is built by explicitly optimizing a cost function based on accuracy and earliness. We have selected a large set of benchmark data sets and four other state-of-the-art early classification methods, and we have evaluated and compared our framework obtaining superior results in terms of both earliness and accuracy.
29 April 2016 in Data Mining and Knowledge Discovery