omphc

MaRDI QIDQ7421167CRANFDO

Authors Michail Tsagris, Christos Adam

Last update 7 November 2026

Copyright license GNU General Public License, version 2.0, GNU General Public License, version 3.0

Software version identifier 1.0

Description

Bayesian network learning using the orthogonal matching pursuit to perform variable selection and then application of the Hill-Climbing greedy search or the TABU search to orient the edges. Some relevant papers are Tsagris M. and Adam C. (2026) <doi:10.13140/RG.2.2.26278.28489>, Tsagris M. (2021) <doi:10.1007/s10614-020-10065-7>, Tsagris M. (2022) <doi:10.3390/math10152604>, Tsagris et al. (2022) <doi:10.1109/TCBB.2020.3029952>, Tsamardinos I., Brown L.E. and Aliferis C.F. (2006) <doi:10.1007/s10994-006-6889-7>, Mallat S. G. and Zhang Z. (1993) <doi:10.1109/78.258082>.

Cites work

• A New Scalable Bayesian Network Learning Algorithm with Applications to Economics
• Matching pursuits with time-frequency dictionaries
• The FEDHC Bayesian Network Learning Algorithm
• The max-min hill-climbing Bayesian network structure learning algorithm
• The γ-OMP algorithm for feature selection with application to gene expression data

This page was built for software: omphc