A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks

DOI10.1016/j.amc.2022.127041OpenAlexW3080715299MaRDI QIDQ2139749

Wai-Ki Ching, Guiyun Xiao, Zheng-Jian Bai

Publication date: 19 May 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.09767

zbMATH Keywords

inverse problemsparseprobabilistic Boolean networkmodified orthogonal matching pursuit

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical linear algebra (65Fxx) Communication, information (94Axx)

Cites Work

• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• Sparse probabilistic Boolean network problems: a partial proximal-type operator splitting method
• On modeling credit defaults: A probabilistic Boolean network approach
• Greed is Good: Algorithmic Results for Sparse Approximation
• Orthogonal least squares methods and their application to non-linear system identification
• Sparse Approximate Solutions to Linear Systems
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
• Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach
• On Construction of Sparse Probabilistic Boolean Networks
• Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks

This page was built for publication: A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks