Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by LIAAD

2013

On recommending urban hotspots to find our next passenger

Authors
Moreira Matias, L; Fernandes, R; Gama, J; Ferreira, M; Mendes Moreira, J; Damas, L;

Publication
CEUR Workshop Proceedings

Abstract
The rising fuel costs is disallowing random cruising strategies for passenger finding. Hereby, a recommendation model to suggest the most passengerprofitable urban area/stand is presented. This framework is able to combine the 1) underlying historical patterns on passenger demand and the 2) current network status to decide which is the best zone to head to in each moment. The major contribution of this work is on how to combine well-known methods for learning from data streams (such as the historical GPS traces) as an approach to solve this particular problem. The results were promising: 395.361/506.873 of the services dispatched were correctly predicted. The experiments also highlighted that a fleet equipped with such framework surpassed a fleet that is not: they experienced an average waiting time to pick-up a passenger 5% lower than its competitor. © 2013 IJCAI.

2013

Real-time algorithm for changes detection in depth of anesthesia signals

Authors
Sebastiao, R; Silva, MM; Rabico, R; Gama, J; Mendonca, T;

Publication
Evolving Systems

Abstract
This paper presents a real-time algorithm for changes detection in depth of anesthesia signals. A Page-Hinkley test (PHT) with a forgetting mechanism (PHT-FM) was developed. The samples are weighted according to their "age" so that more importance is given to recent samples. This enables the detection of the changes with less time delay than if no forgetting factor was used. The performance of the PHT-FM was evaluated in a two-fold approach. First, the algorithm was run offline in depth of anesthesia (DoA) signals previously collected during general anesthesia, allowing the adjustment of the forgetting mechanism. Second, the PHT-FM was embedded in a real-time software and its performance was validated online in the surgery room. This was performed by asking the clinician to classify in real-time the changes as true positives, false positives or false negatives. The results show that 69 % of the changes were classified as true positives, 26 % as false positives, and 5 % as false negatives. The true positives were also synchronized with changes in the hypnotic or analgesic rates made by the clinician. The contribution of this work has a high impact in the clinical practice since the PHT-FM alerts the clinician for changes in the anesthetic state of the patient, allowing a more prompt action. The results encourage the inclusion of the proposed PHT-FM in a real-time decision support system for routine use in the clinical practice. © 2012 Springer-Verlag.

2013

Visualization of evolving social networks using actor-level and community-level trajectories

Authors
Oliveira, M; Gama, J;

Publication
EXPERT SYSTEMS

Abstract
Visualization of static social networks is a mature research field in information visualization. Conventional approaches rely on node-link diagrams that provide a representation of the network topology by representing nodes as points and links between them as lines. However, the increasing availability of longitudinal network data has spurred interest in visualization techniques that go beyond the static node-link representation of a network. In temporal settings, the focus is on the network dynamics at different levels of analysis (e.g. node, communities and whole network). Yet, the development of visualizations that are able to provide actionable insights into different types of changes occurring in the network and their impact on both the neighbourhood and the overall network structure is a challenging task. In such settings, traditional node-link representations can prove to be limited (Yi et al., 2010). Alternative methods, such as matrix graph representations, fail in tasks involving path finding (Ghoniem et al., 2005). This work attempts to overcome these issues by proposing a methodology for tracking the evolution of dynamic social networks, at both the node-level and the community-level, based on the concept of temporal trajectory. We resort to three-order tensors to represent evolving social networks, and we further decompose them using a Tucker3 model. The two most representative components of this model define the 2D space where the trajectories of social entities are projected. To illustrate the proposed methodology, we conduct a case study using a set of temporal self-reported friendship networks.

2013

WIPS: The WiSARD indoor positioning system

Authors
Cardoso, DO; Gama, J; De Gregorio, M; Franca, FMG; Giordano, M; Lima, PMV;

Publication
ESANN 2013 proceedings, 21st European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning

Abstract
In this paper, we present a WiSARD-based system facing the problem of Indoor Positioning (IP) by taking advantage of pervasively available infrastructures (WiFi Access Points -AP). The goal is to develop a system to be used to position users in indoor environments, such as: museums, malls, factories, offshore platforms etc. Based on the fingerprint approach, we show how the proposed weightless neural system provides very good results in terms of performance and positioning resolution. Both the approach to the problem and the system will be presented through two correlated experiments.

2013

Preface

Authors
Rodrigues, PP; Pechenizkiy, M; Gama, J; Correia, RC; Liu, J; Traina, A; Lucas, P; Soda, P;

Publication
Proceedings of CBMS 2013 - 26th IEEE International Symposium on Computer-Based Medical Systems

Abstract

2013

Evaluation Methodology for Multiclass Novelty Detection Algorithms

Authors
Faria, ER; Goncalves, IJCR; Gama, J; Carvalho, ACPLF;

Publication
2013 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS)

Abstract
Novelty detection is a useful ability for learning systems, especially in data stream scenarios, where new concepts can appear, known concepts can disappear and concepts can evolve over time. There are several studies in the literature investigating the use of machine learning classification techniques for novelty detection in data streams. However, there is no consensus regarding how to evaluate the performance of these techniques, particular for multiclass problems. In this study, we propose a new evaluation approach for multiclass data streams novelty detection problems. This approach is able to deal with: i) multiclass problems; ii) confusion matrix with a column representing the unknown examples; iii) confusion matrix that increases over time; iv) unsupervised learning, that generates novelties without an association with the problem classes and v) representation of the evaluation measures over time. We evaluate the performance of the proposed approach by known novelty detection algorithms with artificial and real data sets.

  • 280
  • 430