Abstract
The rise of online social networks has reshaped the way information is published and spread. Users can now post in an effortless way and in any location, making this medium ideal for searching breaking news and journalistic relevant content. However, due to the overwhelming number of posts published every second, such content is hard to trace. Thus, it is important to develop methods able to detect and analyze whether a certain text contains journalistic relevant information. Furthermore, it is also important that this detection system can provide additional information towards a better comprehension of the prediction made. In this work, we overview our system, based on an ensemble classifier that is able to predict if a certain post is relevant from a journalistic perspective which outperforms the previous relevant systems in their original datasets. In addition, we describe REMINDS: a web platform built on top of our relevance system that is able to provide users with the visualization of the system's features as well as additional information on the text, ultimately leading to a better comprehension of the system's prediction capabilities. (C) 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0) Peer-review under responsibility of the scientific committee of the CENTERIS -International Conference on ENTERprise Information Systems / ProjMAN - International Conference on Project MANagement / HCist - International Conference on Health and Social Care Information Systems and Technologies.

Abstract
For Programming teachers it is of utter most importance to understand the factors that impact on students' motivation to improve their ability to become good computer programmers. To understand a problem, to develop an algorithm for its solution, and to write the corresponding program is a challenging and arduous task, demanding time and self-confidence. In previous work we studied computer based technics to engage students in the learning activity; visualization, animation, automatic program assessment were some approaches that we combined. To support that work we studied carefully students' motivation and complemented that study with an inquiry to a group of students of Algorithm and Programming course of the first year of an Engineering degree. In this paper we show how Association Rules can be used to mine the data gathered in the inquiry to discover relationships among factors influencing extrinsic motivation.

Abstract

Abstract
Preferential sampling in time occurs when there is stochastic dependence between the process being modeled and the times of the observations. Examples occur in fisheries if the data are observed when the resource is available, in sensoring when sensors keep only some records in order to save memory and in clinical studies, when a worse clinical condition leads to more frequent observations of the patient. In all such situations the observation times are informative on the underlying process. To make inference in time series observed under Preferential Sampling we propose, in this work, a numerical method based on a Laplace approach to optimize the likelihood and to approximate the underlying process we adopt a technique based on stochastic partial differential equation. Numerical studies with simulated and real data sets are performed to illustrate the benefits of the proposed approach. © 2019 SEIO

Abstract
A new first-order integer-valued moving average, INMA(1), model based on the negative binomial thinning operation defined by Ristic et al. [21] is proposed and characterized. It is shown that this model has negative binomial (NB) marginal distribution when the innovations follow an NB distribution and therefore it can be used in situations where the data present overdispersion. Additionally, this model is extended to the bivariate context. The Generalized Method of Moments (GMM) is used to estimate the unknown parameters of the proposed models and the results of a simulation study that intends to investigate the performance of the method show that, in general, the estimates are consistent and symmetric. Finally, the proposed model is fitted to a real dataset and the quality of the adjustment is evaluated. © 2019, Springer Nature Switzerland AG.

Abstract
This work investigates outlier detection and modelling in non-Gaussian autoregressive time series models with margins in the class of a convolution closed parametric family. This framework allows for a wide variety of models for count and positive data types. The article investigates additive outliers which do not enter the dynamics of the process but whose presence may adversely influence statistical inference based on the data. The Bayesian approach proposed here allows one to estimate, at each time point, the probability of an outlier occurrence and its corresponding size thus identifying the observations that require further investigation. The methodology is illustrated using simulated and observed data sets.