Abstract
Vehicular sensing is emerging as a powerful mean to collect information using the variety of sensors that equip modern vehicles. These sensors range from simple speedometers to complex video capturing systems capable of performing image recognition. The advent of connected vehicles makes such information accessible nearly in real-time and creates a sensing network with a massive reach, amplified by the inherent mobility of vehicles. In this paper we discuss several applications that rely on vehicular sensing, using sensors such as the GPS receiver, windshield cameras, or specific sensors in special vehicles, such as a taximeter in taxi cabs. We further discuss connectivity issues related to the mobility and limited wireless range of an infrastructure-less network based only on vehicular nodes. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Abstract
One of the major data mining tasks is to cluster similar data, because of its usefulness, providing means of summarizing large ammounts of raw data into handy information. Clustering data streams is particularly challenging, because of the constraints imposed when dealing with this kind of input. Here we report our work, in which it was investigated the use of WiSARD discriminators as primary data synthesizing units. An analysis of StreamWiSARD, a new sliding-window stream data clustering system, the benefits and the drawbacks of its use and a comparison to other approaches are all presented. © 2012 Springer-Verlag.

Abstract
This work presents an optimized version of XMuSer, an ILP based framework suitable to explore temporal patterns available in multi-relational databases. XMuSer's main idea consists of exploiting frequent sequence mining, an efficient method to learn temporal patterns in the form of sequences. XMuSer framework efficiency is grounded on a new coding methodology for temporal data and on the use of a predictive sequence miner. The frameworks selects and map the most interesting sequential patterns into a new table, the sequence relation. In the last step of our framework, we use an ILP algorithm to learn a classification theory on the enlarged relational database that consists of the original multi-relational database and the new sequence relation. We evaluate our framework by addressing three classification problems and map each one of three different types of sequential patterns: frequent, closed or maximal. The experiments show that our ILP based framework gains both from the descriptive power of the ILP algorithms and the efficiency of the sequential miners. © 2012 Springer-Verlag Berlin Heidelberg.

Abstract
This work addresses the problem of mining data stream generated in dynamic environments where the distribution underlying the observations may change over time. We present a system that monitors the evolution of the learning process. The system is able to self-diagnosis degradations of this process, using change detection mechanisms, and self-repairs the decision models. The system uses meta-learning techniques that characterize the domain of applicability of previously learned models. The meta-learns can detect re-occurrence of contexts, using unlabeled examples, and take pro-active actions by activating previously learned models.

Abstract
In recent years we witnessed an impressive advance in the social networks field, which became a "hot" topic and a focus of considerable attention. Also, the development of methods that focus on the analysis and understanding of the evolution of data are gaining momentum. In this paper we present an approach to visualize the evolution of dynamic social networks by using Tucker decomposition and the concept of trajectory. Our visualization strategy is based on trajectories of network's actors in a bidimensional space that preserves its structural properties. Furthermore, this approach can be used to identify similar actors by comparing the shape and position of the trajectories. To illustrate the proposed approach we conduct a case study using a set of temporal friendship networks.

Abstract
We present a framework designed to mine sequential temporal patterns from multi-relational databases. In order to exploit logic-relational information without using aggregation methodologies, we convert the multi-relational dataset into what we name a multi-sequence database. Each example in a multi-relational target table is coded into a sequence that combines intra-table and inter-table relational temporal information. This allows us to find heterogeneous temporal patterns through standard sequence miners. Our framework is grounded in the excellent results achieved by previous propositionalization strategies. We follow a pipelined approach, where we first use a sequence miner to find frequent sequences in the multi-sequence database. Next, we select the most interesting findings to augment the representational space of the examples. The most interesting sequence patterns are discriminative and class correlated. In the final step we build a classifier model by taking an enlarged target table as input to a classifier algorithm. We evaluate the performance of this work through a motivating application, the hepatitis multi-relational dataset. We prove the effectiveness of our methodology by addressing two problems of the hepatitis dataset.