Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians

This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of finite mixture models, conjugate families and factorization. Both the joint probability density of the variables and the likelihood function of the (objective or subjective) observation are approximated by a special mixture model, in such a way that any desired conditional distribution can be directly obtained without numerical integration. We have developed an extended version of the expectation maximization (EM) algorithm to estimate the parameters of mixture models from uncertain training examples (indirect observations). As a consequence, any piece of exact or uncertain information about both input and output values is consistently handled in the inference and learning stages. This ability, extremely useful in certain situations, is not found in most alternative methods. The proposed framework is formally justified from standard probabilistic principles and illustrative examples are provided in the fields of nonparametric pattern classification, nonlinear regression and pattern completion. Finally, experiments on a real application and comparative results over standard databases provide empirical evidence of the utility of the method in a wide range of applications

Grid Global Behavior Prediction

Complexity has always been one of the most important issues in distributed computing. From the first clusters to grid and now cloud computing, dealing correctly and efficiently with system complexity is the key to taking technology a step further. In this sense, global behavior modeling is an innovative methodology aimed at understanding the grid behavior. The main objective of this methodology is to synthesize the grid's vast, heterogeneous nature into a simple but powerful behavior model, represented in the form of a single, abstract entity, with a global state. Global behavior modeling has proved to be very useful in effectively managing grid complexity but, in many cases, deeper knowledge is needed. It generates a descriptive model that could be greatly improved if extended not only to explain behavior, but also to predict it. In this paper we present a prediction methodology whose objective is to define the techniques needed to create global behavior prediction models for grid systems. This global behavior prediction can benefit grid management, specially in areas such as fault tolerance or job scheduling. The paper presents experimental results obtained in real scenarios in order to validate this approach

Quality of experience aware network selection model for service provisioning in heterogeneous network

Heterogeneous wireless networks (HWNs) are capable of integrating the different radio access technologies that make it possible to connect mobile users based on the performance parameters. Further quality of service (QoS) is one of the major topics for HWNs, moreover existing radio access technology (RAT) methodology are designed to provide network QoS criteria. However, limited work has been carried out for the RAT selection mechanism considering user QoS preference and existing models are developed based on the multi-mode terminal under a given minimal density network. For overcoming research issues this paper present quality of experience (QoE) RAT (QOE-RAT) selection methodology, incorporating both network performance criteria and user preference considering multiple call and multi-mode HWNs environment. First, this paper presents fuzzy preference aware weight (FPAW) and multi-mode terminal preference aware TOPSIS (MMTPA-TOPSIS) for choosing the best RAT for gaining multi-services. Experiment outcomes show the QOE-RAT selection method achieves much superior packet transmission outcomes when compared with state-of-art Rat selection methodologies

Context-aware multi-attribute decision multi - attribute decision making for radio access technology selection in ultra dense network

Ultra Dense Network (UDN) is the extreme densification of heterogeneous Radio Access Technology (RAT) that is deployed closely in coordinated or uncoordinated manner. The densification of RAT forms an overlapping zone of signal coverage leading to the frequent service handovers among the RAT, thus degrading overall system performance. The current RAT selection approach is biased towards network-centric criteria pertaining to signal strength. However, the paradigm shift from network-centric to user-centric approach necessitates a multi-criteria selection process, with methodology relating to both network and user preferences in the context of future generation networks. Hence, an effective selection approach is required to avoid unnecessary handovers in RAT. The main aim of this study is to propose the Context-aware Multiattribute decision making for RAT (CMRAT) selection for investigating the need to choose a new RAT and further determine the best amongst the available methods. The CMRAT consists of two mechanisms, namely the Context-aware Analytical Hierarchy Process (CAHP) and Context-aware Technique for Order Preference by Similarity to an Ideal Solution (CTOPSIS). The CAHP mechanism measures the need to switch from the current RAT, while CTOPSIS aids in decision making to choose the best target RAT. A series of experimental studies were conducted to validate the effectiveness of CMRAT for achieving improved system performance. The investigation utilises shopping mall and urban dense network scenarios to evaluate the performance of RAT selection through simulation. The findings demonstrated that the CMRAT approach reduces delay and the number of handovers leading to an improvement of throughput and packet delivery ratio when compared to that of the commonly used A2A4-RSRQ approach. The CMRAT approach is effective in the RAT selection within UDN environment, thus supporting heterogeneous RAT deployment in future 5G networks. With context-aware selection, the user-centric feature is also emphasized

A Survey of Parallel Data Mining

With the fast, continuous increase in the number and size of databases, parallel data mining is a natural and cost-effective approach to tackle the problem of scalability in data mining. Recently there has been a considerable research on parallel data mining. However, most projects focus on the parallelization of a single kind of data mining algorithm/paradigm. This paper surveys parallel data mining with a broader perspective. More precisely, we discuss the parallelization of data mining algorithms of four knowledge discovery paradigms, namely rule induction, instance-based learning, genetic algorithms and neural networks. Using the lessons learned from this discussion, we also derive a set of heuristic principles for designing efficient parallel data mining algorithms

Byzantine Attack and Defense in Cognitive Radio Networks: A Survey

The Byzantine attack in cooperative spectrum sensing (CSS), also known as the spectrum sensing data falsification (SSDF) attack in the literature, is one of the key adversaries to the success of cognitive radio networks (CRNs). In the past couple of years, the research on the Byzantine attack and defense strategies has gained worldwide increasing attention. In this paper, we provide a comprehensive survey and tutorial on the recent advances in the Byzantine attack and defense for CSS in CRNs. Specifically, we first briefly present the preliminaries of CSS for general readers, including signal detection techniques, hypothesis testing, and data fusion. Second, we analyze the spear and shield relation between Byzantine attack and defense from three aspects: the vulnerability of CSS to attack, the obstacles in CSS to defense, and the games between attack and defense. Then, we propose a taxonomy of the existing Byzantine attack behaviors and elaborate on the corresponding attack parameters, which determine where, who, how, and when to launch attacks. Next, from the perspectives of homogeneous or heterogeneous scenarios, we classify the existing defense algorithms, and provide an in-depth tutorial on the state-of-the-art Byzantine defense schemes, commonly known as robust or secure CSS in the literature. Furthermore, we highlight the unsolved research challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral

Temporal and Relational Models for Causality: Representation and Learning

Discovering causal dependence is central to understanding the behavior of complex systems and to selecting actions that will achieve particular outcomes. The majority of work in this area has focused on propositional domains, where data instances are assumed to be independent and identically distributed (i.i.d.). However, many real-world domains are inherently relational, i.e., they consist of multiple types of entities that interact with each other, and temporal, i.e., they change over time. This thesis focuses on causal modeling for these more complex relational and temporal domains. This thesis provides an in-depth investigation of the properties of relational models and is extending their expressivity to include a temporal dimension. Specifically, we first investigate alternative ways to ground relational models, and we provide an in-depth analysis of the impact of alternative grounding semantics for feature construction, causal effect estimation, and model selection. Then, we extend relational models to represent discrete time. We generalize the theory of d-separation for this class of temporal and relational models. Finally, we provide a constraint-based algorithm, TRCD, to learn the structure of temporal relational models from data