Pages that link to "Item:Q5406887"
From MaRDI portal
The following pages link to Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach (Q5406887):
Displaying 6 items.
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression (Q2049105) (← links)
- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks (Q2139749) (← links)
- A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint (Q2149159) (← links)
- On Construction of Sparse Probabilistic Boolean Networks (Q5406906) (← links)
- On Generating Optimal Sparse Probabilistic Boolean Networks with Maximum Entropy from a Positive Stationary Distribution (Q5406930) (← links)
- Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks (Q5739731) (← links)
