• Home
• io.github.cmu-phil
• tetrad-lib
• 7.6.5
• source code
• cpcs.html

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

docs.javahelp.manual.boxes.search.cpcs.html Maven / Gradle / Ivy

    
    



    

    

        
Search Algorithms: CPC-Stable 
    
    



The CPC-Stable algorithm (add references) modifies CPC (see) in the same way that
    PC-Stable modifies PC. The adjacency search is modified so for depth i > 0, the
    graph obtained for for depth i is used to judge adjacencies for nodes. As a result,
    for instance, it is readily parallelizable, since the independence judgments within
    each depth are independent of each other. Also, it has been shown to reduce error
    for large searches.