We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
When I run the example code for PC algorithm on my csv data file, I end up with a cyclic graph (with or without prior knowledge):
tetrad.getAlgorithmParameters(algoId = 'pc-all', testId = 'fisher-z-test') tetrad.run(algoId = 'pc-all', dfs = combined_small, testId = 'fisher-z-test', priorKnowledge = prior, fasRule = 2, depth = 2, conflictRule = 1, concurrentFAS = True, useMaxPOrientationHeuristic = True, verbose = True) tetrad.getNodes()
For example, I get the following edges: 'X2 --> X9', 'X9 --> X23', 'X23 --> X8', 'X8 --> X2'
Is this possible? Is there a way to restrict the program from generating cyclic graphs?
The text was updated successfully, but these errors were encountered:
No branches or pull requests
When I run the example code for PC algorithm on my csv data file, I end up with a cyclic graph (with or without prior knowledge):
For example, I get the following edges:
'X2 --> X9',
'X9 --> X23',
'X23 --> X8',
'X8 --> X2'
Is this possible? Is there a way to restrict the program from generating cyclic graphs?
The text was updated successfully, but these errors were encountered: