Asymptotical lower limits on required number of examples for learning boolean networks

Date

2006-11-03

Author

Abul, Osman
Alhajj, Reda
Polat, Faruk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

198
views

0
downloads

This paper studies the asymptotical lower limits on the required number of samples for identifying Boolean Networks, which is given as Omega(logn) in the literature for fully random samples. It has also been found that; O(logn) samples are sufficient with high probability. Our main motivation is to provide tight lower asymptotical limits for samples obtained from time series experiments. Using the results from the literature on random boolean networks, lower limits on the required number of samples from time series experiments for various cases are analytically derived using information theoretic approach.

Subject Keywords

Bayesian network, Boolean function, Require number, Genetic network, Boolean network

URI

https://hdl.handle.net/11511/43272

DOI

https://doi.org/10.1007/11902140_18

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Robust background normalization method for one-channel microarrays AKAL, TÜLAY; Purutçuoğlu Gazi, Vilda; Weber, Gerhard-Wilhelm (Walter de Gruyter GmbH, 2017-04-01) Background: Microarray technology, aims to measure the amount of changes in transcripted messages for each gene by RNA via quantifying the colour intensity on the arrays. But due to the different experimental conditions, these measurements can include both systematic and random erroneous signals. For this reason, we present a novel gene expression index, called multi-RGX (Multiple-probe Robust Gene Expression Index) for one-channel microarrays.
Comparison of two inference approaches in Gaussian graphical models Purutçuoğlu Gazi, Vilda; Wit, Ernst (Walter de Gruyter GmbH, 2017-04-01) Introduction: The Gaussian Graphical Model (GGM) is one of the well-known probabilistic models which is based on the conditional independency of nodes in the biological system. Here, we compare the estimates of the GGM parameters by the graphical lasso (glasso) method and the threshold gradient descent (TGD) algorithm.
Markov Decision Processes Based Optimal Control Policies for Probabilistic Boolean Networks Abul, Osman; Alhajj, Reda; Polat, Faruk (2004-06-01) This paper addresses the control formulation process for probabilistic boolean genetic networks. It is a major problem that has not been investigated enough yet. We argue that a monitoring stage is necessary after the control stage for providing guidance about the evolution of the investigated state. For this purpose, we developed methods for generating optimal control policies for each of the following five cases: finite control, infinite control, finite control-infinite monitoring, finite control-finite m...
Multi-target tracking using passive doppler measurements Guldogan, Mehmet B.; Orguner, Umut; Gustafsson, Fredrik (2013-04-26) In this paper, we analyze the performance of the Gaussian mixture probability hypothesis density (GM-PHD) filter in tracking multiple non-cooperative targets using Doppler-only measurements in a passive sensor network. Clutter, missed detections and multi-static Doppler variances are incorporated into a realistic multi-target scenario. Simulation results show that the GM-PHD filter successfully tracks multiple targets using only Doppler shift measurements in a passive multi-static scenario.
Artificial-neural-network prediction of hexagonal lattice parameters for non-stoichiometric apatites Kockan, Umit; Ozturk, Fahrettin; Evis, Zafer (2014-01-01) In this study, hexagonal lattice parameters (a and c) and unit-cell volumes of non-stoichiometric apatites of M-10(TO4)(6)X-2 are predicted from their ionic radii with artificial neural networks. A multilayer-perceptron network is used for training. The results indicate that the Bayesian regularization method with four neurons in the hidden layer with a tansig activation function and one neuron in the output layer with a purelin function gives the best results. It is found that the errors for the predicted ...

Citation Formats

O. Abul, R. Alhajj, and F. Polat, “Asymptotical lower limits on required number of examples for learning boolean networks,” 2006, vol. 4263, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43272.