HybridBase<T>
Base Classes ยท AiDotNet.CausalDiscovery.Hybrid
Base class for hybrid causal discovery algorithms that combine constraint-based and score-based methods.
Inheritance: CausalDiscoveryBase<T> โ HybridBase<T>
Known derived types: GFCIAlgorithm<T>, H2PCAlgorithm<T>, MMHCAlgorithm<T>, PCNOTEARSAlgorithm<T>, RSMAX2Algorithm<T>
For Beginners
Hybrid algorithms get the best of both worlds. Constraint-based methods are good at ruling out edges quickly, while score-based methods are good at finding the best structure among remaining options. Combining them gives faster AND more accurate results.
How It Works
Hybrid methods first use constraint-based tests to restrict the search space (e.g., finding candidate parents via conditional independence tests), then use score-based search to find the optimal DAG within the restricted space.
Properties
| Property | Summary |
|---|---|
CausalDiscoveryCategory Category { get; } |