Tag
This paper proposes a k-order relaxation of the faithfulness assumption for learning graphical Markov blankets, and introduces a proof-of-concept algorithm (kOMB) that can recover Markov blankets even under violations of faithfulness, such as parity-type relationships.