Class IcaLingD
java.lang.Object
edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithm
edu.cmu.tetrad.algcomparison.algorithm.continuous.dag.IcaLingD
- All Implemented Interfaces:
Algorithm, ReturnsBootstrapGraphs, HasParameters, TetradSerializable, Serializable
@Bootstrapping
public class IcaLingD
extends AbstractBootstrapAlgorithm
implements Algorithm, ReturnsBootstrapGraphs
ICA-LiNG-D, the former name of LiNG-D.
Backward compatibility only. This class is retained under its original name so that sessions saved by
Tetrad 7.6.10 and earlier, which refer to it by this class name, continue to load. Its registration annotations
are commented out, so it does not appear in the chooser; new work should use LingD.
Every method delegates to LingD, so a restored session runs the same search as the LiNG-D box.
- Version:
- $Id: $Id
- Author:
- josephramsey
- See Also:
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptiongetComparisonGraph(Graph graph) Returns that graph that the result should be compared to.Returns the data type that the search requires, whether continuous, discrete, or mixed.Returns a short, one-line description of this algorithm.Returns the list of parameter names that are used.Returns the B-Hat matrices of the stable graphs.Returns the stable graphs found by the most recent search.Returns the B-Hat matrices of the unstable graphs.Returns the unstable graphs found by the most recent search.runSearch(DataModel dataSet, Parameters parameters) Runs the search on the given data by delegating to the successor algorithm and returns the resulting graph.Methods inherited from class AbstractBootstrapAlgorithm
getBootstrapGraphs, searchMethods inherited from class Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface ReturnsBootstrapGraphs
getBootstrapGraphs
-
Constructor Details
-
IcaLingD
public IcaLingD()No-arg constructor. Used for reflection; do not delete.
-
-
Method Details
-
runSearch
Runs the search on the given data by delegating to the successor algorithm and returns the resulting graph.- Parameters:
dataSet- the data to search over.parameters- the parameters of the search.- Returns:
- the graph the successor returns.
- Throws:
InterruptedException- if the search is interrupted.
-
getComparisonGraph
Returns that graph that the result should be compared to.- Specified by:
getComparisonGraphin interfaceAlgorithm- Parameters:
graph- The true directed graph, if there is one.- Returns:
- The comparison graph.
-
getDescription
Returns a short, one-line description of this algorithm. This will be printed in the report.- Specified by:
getDescriptionin interfaceAlgorithm- Returns:
- This description.
-
getDataType
Returns the data type that the search requires, whether continuous, discrete, or mixed.- Specified by:
getDataTypein interfaceAlgorithm- Returns:
- This type.
-
getParameters
Returns the list of parameter names that are used. These are looked up in ParamMap, so if they're not- Specified by:
getParametersin interfaceHasParameters- Returns:
- Returns the list of parameter names that are used. These are looked up in ParamMap, so if they're not already defined they'll need to be defined there.
-
getStableGraphs
-
getUnstableGraphs
-
getStableBHats
-
getUnstableBHats
-