Learning Hidden Graphs From Samples.

Several real-world problems, like molecular biology and chemical reactions, have hidden graphs, and we need to learn the hidden graph using edge-detecting samples. In this problem, the learner receives examples explaining whether a set of vertices induces an edge of the hidden graph. This article examines the learnability of this problem using the PAC and Agnostic PAC learning models. By computing the VC-dimension of hypothesis spaces of hidden graphs, hidden trees, hidden connected graphs, and hidden planar graphs through edge-detecting samples, we also find the sample complexity of learning these spaces. We study the learnability of this space of hidden graphs in two cases, namely for known and unknown vertex sets. We show that the class of hidden graphs is uniformly learnable when the vertex set is known. Furthermore, we prove that the family of hidden graphs is not uniformly learnable but is nonuniformly learnable when the vertex set is unknown.

Masked Autoencoder for Distribution Estimation on Small Structured Data Sets.

Autoregressive models are among the most successful neural network methods for estimating a distribution from a set of samples. However, these models, such as other neural methods, need large data sets to provide good estimations. We believe that knowing structural information about the data can improve their performance on small data sets. Masked autoencoder for distribution estimation (MADE) is a well-structured density estimator, which alters a simple autoencoder by setting a set of masks on its connections to satisfy the autoregressive condition. Nevertheless, this model does not benefit from extra information that we might know about the structure of the data. This information can especially be advantageous in case of training on small data sets. In this article, we propose two autoencoders for estimating the density of a small set of observations, where the data have a known Markov random field (MRF) structure. These methods modify the masking process of MADE, according to conditional dependencies inferred from the MRF structure, to reduce either the model complexity or the problem complexity. We compare the proposed methods with some related binary, discrete, and continuous density estimators on MNIST, binarized MNIST, OCR-letters, and two synthetic data sets.

A minimum data set of user profile or electronic health record for chemical warfare victims' recommender system.

BACKGROUND: There are many people who are suffering from a variety of physical and mental illnesses due to the chemical attacks. There are various technologies such as recommender systems that can identify the main concerns related to health and make efforts to address them. To design and develop a recommender system, preparation of data source of this system should be considered. The aim of this study was to determine the minimum data set for user profile or user's electronic health record in chemical warfare victims' recommender system. METHODS: This applied descriptive, cross-sectional study which was conducted in 2017. A questionnaire was developed by the authors from the data elements that were collected using the data extraction form from the studied sources. Content validity of the questionnaire was confirmed by using the experts. Test-retest method was used to determine the reliability of the questionnaire. The reliability of the questionnaire with Cronbach's alpha coefficient was confirmed as 84%. The questionnaire were submitted for related experts based on Delphi method by email or in person. Data resulting from the Delphi technique with descriptive statistics methods in SPSS software were analyzed. RESULTS: Forty-seven nonclinical data elements and 181 clinical data elements were classified. CONCLUSION: Determining minimum data set of user profile or electronic health record in the recommender system for chemical warfare victims helps the health authorities to implement the recommender system which demonstrates chemical warfare victims' needs.

The Shapley value for a fair division of group discounts for coordinating cooling loads.

We consider a demand response program in which a block of apartments receive a discount from their electricity supplier if they ensure that their aggregate load from air conditioning does not exceed a predetermined threshold. The goal of the participants is to obtain the discount, while ensuring that their individual temperature preferences are also satisfied. As such, the apartments need to collectively optimise their use of air conditioning so as to satisfy these constraints and minimise their costs. Given an optimal cooling profile that secures the discount, the problem that the apartments face then is to divide the total discounted cost in a fair way. To achieve this, we take a coalitional game approach and propose the use of the Shapley value from cooperative game theory, which is the normative payoff division mechanism that offers a unique set of desirable fairness properties. However, applying the Shapley value in this setting presents a novel computational challenge. This is because its calculation requires, as input, the cost of every subset of apartments, which means solving an exponential number of collective optimisations, each of which is a computationally intensive problem. To address this, we propose solving the optimisation problem of each subset suboptimally, to allow for acceptable solutions that require less computation. We show that, due to the linearity property of the Shapley value, if suboptimal costs are used rather than optimal ones, the division of the discount will be fair in the following sense: each apartment is fairly "rewarded" for its contribution to the optimal cost and, at the same time, is fairly "penalised" for its contribution to the discrepancy between the suboptimal and the optimal costs. Importantly, this is achieved without requiring the optimal solutions.

Scalable Architecture for Telemonitoring Chronic Diseases in Order to Support the CDSSs in a Common Platform.

INTRODUCTION: In recent years, a variety of clinical decision-support systems (CDSS) have been developed to monitor the health of patients with chronic disease from far away. These systems are effective in overcoming human resource limitation and analyzing information generated by Tele-monitoring systems. These systems, however, are limited to monitoring a particular disease, which allows them to be used only in one specific disease. In reuses of these systems to monitor other diseases, we need to re-establish a new system with a new knowledge base. However, this type of healthcare system faces many challenges, including low scalability for change, so that, if we want to modify a health monitoring system designed for a specific disease to be used for another disease, these changes will be very substantial, meaning that, most components of that system should be changed. The lack of scalability in these systems has led to the creation of multiple health monitoring systems, while many of these systems share a common structure. AIM: In this paper, to solve the scalability problem, architecture has been presented that allows a set of CDSSs to be placed on a common platform for Tele-monitoring. MATERIAL AND METHODS: In order to provide the proposed architecture in this study, we extracted the related concepts from the literature. The anatomical concepts used in these studies are as follow: users, transmitted data, patient data storage databases, data transfer network, and medical setting and the work is done in this setting. Finally, to design the proposed architecture, UML has been used. RESULTS: The innovation of this research is to provide a scalable and flexible architecture, which as a platform, is able to monitor multiple diseases with a common infrastructure. In this architecture, all components are commonly used simultaneously without the interference of several CDSSs. CONCLUSION: Utilizing the proposed model in this paper, while reducing the setup costs and speeding up the launch of various remote monitoring systems, many rework in the implementation of these systems is also reduced.

Quantitative EEG features selection in the classification of attention and response control in the children and adolescents with attention deficit hyperactivity disorder.

AIM: Quantitative EEG gives valuable information in the clinical evaluation of psychological disorders. The purpose of the present study is to identify the most prominent features of quantitative electroencephalography (QEEG) that affect attention and response control parameters in children with attention deficit hyperactivity disorder. METHODS: The QEEG features and the Integrated Visual and Auditory-Continuous Performance Test ( IVA-CPT) of 95 attention deficit hyperactivity disorder subjects were preprocessed by Independent Evaluation Criterion for Binary Classification. Then, the importance of selected features in the classification of desired outputs was evaluated using the artificial neural network. RESULTS: Findings uncovered the highest rank of QEEG features in each IVA-CPT parameters related to attention and response control. CONCLUSION: Using the designed model could help therapists to determine the existence or absence of defects in attention and response control relying on QEEG.

Expectation propagation for large scale Bayesian inference of non-linear molecular networks from perturbation data.

Inferring the structure of molecular networks from time series protein or gene expression data provides valuable information about the complex biological processes of the cell. Causal network structure inference has been approached using different methods in the past. Most causal network inference techniques, such as Dynamic Bayesian Networks and ordinary differential equations, are limited by their computational complexity and thus make large scale inference infeasible. This is specifically true if a Bayesian framework is applied in order to deal with the unavoidable uncertainty about the correct model. We devise a novel Bayesian network reverse engineering approach using ordinary differential equations with the ability to include non-linearity. Besides modeling arbitrary, possibly combinatorial and time dependent perturbations with unknown targets, one of our main contributions is the use of Expectation Propagation, an algorithm for approximate Bayesian inference over large scale network structures in short computation time. We further explore the possibility of integrating prior knowledge into network inference. We evaluate the proposed model on DREAM4 and DREAM8 data and find it competitive against several state-of-the-art existing network inference methods.

Expertise finding in bibliographic network: topic dominance learning approach.

Expert finding problem in bibliographic networks has received increased interest in recent years. This problem concerns finding relevant researchers for a given topic. Motivated by the observation that rarely do all coauthors contribute to a paper equally, in this paper, we propose two discriminative methods for realizing leading authors contributing in a scientific publication. Specifically, we cast the problem of expert finding in a bibliographic network to find leading experts in a research group, which is easier to solve. We recognize three feature groups that can discriminate relevant experts from other authors of a document. Experimental results on a real dataset, and a synthetic one that is gathered from a Microsoft academic search engine, show that the proposed model significantly improves the performance of expert finding in terms of all common information retrieval evaluation metrics.

Cellular learning automata with multiple learning automata in each cell and its applications.

The cellular learning automaton (CLA), which is a combination of cellular automaton (CA) and learning automaton (LA), is introduced recently. This model is superior to CA because of its ability to learn and is also superior to single LA because it is a collection of LAs which can interact with each other. The basic idea of CLA is to use LA to adjust the state transition probability of stochastic CA. Recently, various types of CLA such as synchronous, asynchronous, and open CLAs have been introduced. In some applications such as cellular networks, we need to have a model of CLA for which multiple LAs reside in each cell. In this paper, we study a CLA model for which each cell has several LAs. It is shown that, for a class of rules called commutative rules, the CLA model converges to a stable and compatible configuration. Two applications of this new model such as channel assignment in cellular mobile networks and function optimization are also given. For both applications, it has been shown through computer simulations that CLA-based solutions produce better results.