Abstract
Numerous diagnostic decisions are made every day by healthcare professionals. Bayesian networks can provide a useful aid to the process, but learning their structure from data generally requires the absence of missing data, a common problem in medical data. We have studied missing data imputation using a step-wise nearest neighbors' algorithm, which we recommended given its limited impact on the assessed validity of structure learning Bayesian network classifiers for Obstructive Sleep Apnea diagnosis. © 2018 European Federation for Medical Informatics (EFMI) and IOS Press.

Abstract
Exceptional preferences mining (EPM) is a crossover between two subfields of data mining: local pattern mining and preference learning. EPM can be seen as a local pattern mining task that finds subsets of observations where some preference relations between labels significantly deviate from the norm. It is a variant of subgroup discovery, with rankings of labels as the target concept. We employ several quality measures that highlight subgroups featuring exceptional preferences, where the focus of what constitutes exceptional' varies with the quality measure: two measures look for exceptional overall ranking behavior, one measure indicates whether a particular label stands out from the rest, and a fourth measure highlights subgroups with unusual pairwise label ranking behavior. We explore a few datasets and compare with existing techniques. The results confirm that the new task EPM can deliver interesting knowledge.

Abstract
The problem of joint estimation of parameters and state of continuous time systems using discrete time observations is addressed. The plant parameters are assumed to be modeled by a Wiener process. The a priori probability density function (pdf) of an extended state that comprises the plant state variables and the parameters is propagated in time using an approximate solution of the Fokker-Planck equation that relies on Trotter's formula for semigroup decomposition. The a posteriori (i. e., given the observations) pdf is then computed at the observation instants using Bayes law.

Abstract
Modern cities are subject to a lot of periodic or unexpected critical events, which may have different monitoring and control requirements according to the expected impacts on people safety and urban mobility. When multiple monitoring and automation systems are deployed, adaptive wireless sensor networks may adjust sensing and transmission configurations according to the detected events, optimizing the network overall operation. In this context, mobile sinks come as an effective way to enhance monitoring performance in smart city environments. However, practical issues related to the available roads and traffic load should be considered, allowing the computation of the best final positions and movement paths for each sink. Therefore, this paper proposes algorithms to compute dynamic sinks movement in reactive wireless sensor networks, supporting efficient adaptation to event-based monitoring in smart cities.

Abstract

Abstract