Since the introduction of Dynamic Bayesian Networks (DBNs), their efficiency and effectiveness have increased through the development of three significant aspects: (i) modeling, (ii) learning and (iii) inference. However, no reviews of the literature have been found that chronicle their importance and development over time. The aim of this study is to provide a systematic review of the literature that details the evolution and advancement of DBNs, focusing in the period 1997–2019 that emphasize the aspects of modeling, learning and inference. While the literature presents temporal event networks, knowledge encapsulation, relational and time varying representations as the four predominant DBN modeling approaches, this work groups them as essential techniques within DBNs and help practitioners by associating each to various challenge that arise in pattern discovery and prediction in dynamic processes. Regarding learning, the predominant methods mainly focus on scoring with greedy search. Finally, our study suggests that the main methods used in DBN inference extend or adapt those used in static BNs, and are oriented to either optimize processing time or error rate.
22 October 2013 in Social Network Analysis and Mining
Regular data classification techniques are based mainly on two strong assumptions: (1) the existence of a reasonably large labeled set of data to be used in training; and (2) future input data instances conform to the distribution of the training set, i.e. data distribution is stationary along time. However, in the case of data stream classification, both of the aforementioned assumptions are difficult to satisfy. In this paper, we present a graph-based semi-supervised approach that extends the static classifier based on the K-associated Optimal Graph to perform online semi-supervised classification tasks. In order to learn from labeled and unlabeled patterns, here we adapt the optimal graph construction to simultaneously spread the labels in the training set. The sparse, disconnected nature of the proposed graph structure gives flexibility to cope with non-stationary classification. Experimental comparison between the proposed method and three state-of-the-art ensemble classification methods is provided and promising results have been obtained.
12 July 2012 in Journal of Computer Science and Technology