I-Equivalence Class Search

So far, we seen generic search methods…

• Can exploit the structure of our domain?

Idea:

• Search the space of I-equivalence classes

• Each I-equivalence class is represented by a PDAG (partially ordered graph) -- skeleton + v-structures

Benefits:

• The space of PDAGs has fewer local maxima and plateaus

• There are fewer PDAGs than DAGs

Previous slide

Next slide

Back to first slide

View graphic version