Mappings between probabilistic boolean networks

Authors:
Edward R. Dougherty;Ilya Shmulevich
Affiliations:
Department of Electrical Engineering, Texas A&M University, Houston, TX and Cancer Genomics Laboratory, Department of Pathology, The University of Texas M.D. Anderson Cancer Center, Box 85 1515, H ...;Cancer Genomics Laboratory, Department of Pathology, The University of Texas M.D. Anderson Cancer Center, Box 85 1515, Holcombe Blvd., Houston, TX
Venue:
Signal Processing - Special issue: Genomic signal processing
Year:
2003

Citing 2
Cited 6

Mathematical methods for artificial intelligence and autonomous systems

Mathematical methods for artificial intelligence and autonomous systems
Coefficient of determination in nonlinear signal processing

Signal Processing - Special section on signal processing technologies for short burst wireless communications

Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks

Signal Processing
Reduction mappings between probabilistic Boolean networks

EURASIP Journal on Applied Signal Processing
Serving Comparative Shopping Links Non-invasively

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Context-sensitive probabilistic Boolean networks: steady-state properties, reduction, and steady-state approximation

IEEE Transactions on Signal Processing
Selection policy-induced reduction mappings for Boolean networks

IEEE Transactions on Signal Processing
Towards improving the online shopping experience: A client-based platform for post-processing Web search results

Web Intelligence and Agent Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Feature selection is problematic when the number of potential features is very large. Absent distribution knowledge, to select a best feature set of a certain size requires that all feature sets of that size be examined. This paper considers the question ...