edu.pitt.csb.mgm.ExploreIndepTests Maven / Gradle / Ivy
The newest version!
///////////////////////////////////////////////////////////////////////////////
// For information as to what this class does, see the Javadoc, below. //
// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, //
// 2007, 2008, 2009, 2010, 2014, 2015, 2022 by Peter Spirtes, Richard //
// Scheines, Joseph Ramsey, and Clark Glymour. //
// //
// This program is free software; you can redistribute it and/or modify //
// it under the terms of the GNU General Public License as published by //
// the Free Software Foundation; either version 2 of the License, or //
// (at your option) any later version. //
// //
// This program is distributed in the hope that it will be useful, //
// but WITHOUT ANY WARRANTY; without even the implied warranty of //
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the //
// GNU General Public License for more details. //
// //
// You should have received a copy of the GNU General Public License //
// along with this program; if not, write to the Free Software //
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA //
///////////////////////////////////////////////////////////////////////////////
package edu.pitt.csb.mgm;
import edu.cmu.tetrad.data.DataSet;
import edu.cmu.tetrad.graph.Graph;
import edu.cmu.tetrad.graph.GraphSaveLoadUtils;
import edu.cmu.tetrad.graph.GraphTransforms;
import edu.cmu.tetrad.search.Pc;
import edu.cmu.tetrad.search.work_in_progress.IndTestMultinomialLogisticRegression;
import edu.cmu.tetrad.util.MillisecondTimes;
import java.io.File;
/**
* Created by ajsedgewick on 9/10/15.
*
* @author josephramsey
* @version $Id: $Id
*/
public class ExploreIndepTests {
/**
* Private constructor to prevent instantiation.
*/
private ExploreIndepTests() {
}
/**
* main.
*
* @param args an array of {@link java.lang.String} objects
*/
public static void main(String[] args) {
try {
String path = ExampleMixedSearch.class.getResource("test_data").getPath();
Graph dag3 = GraphSaveLoadUtils.loadGraphTxt(new File(path, "DAG_0_graph.txt"));
Graph trueGraph = GraphTransforms.dagToCpdag(dag3);
DataSet ds = MixedUtils.loadDataSet(path, "DAG_0_data.txt");
IndTestMultinomialLogisticRegression indMix = new IndTestMultinomialLogisticRegression(ds, .05);
IndTestMultinomialLogisticRegressionWald indWalLin = new IndTestMultinomialLogisticRegressionWald(ds, .05, true);
IndTestMultinomialLogisticRegressionWald indWalLog = new IndTestMultinomialLogisticRegressionWald(ds, .05, false);
Pc s1 = new Pc(indMix);
Pc s2 = new Pc(indWalLin);
Pc s3 = new Pc(indWalLog);
s1.setStable(true);
s2.setStable(true);
s3.setStable(true);
long time = MillisecondTimes.timeMillis();
Graph dag2 = s1.search();
Graph g1 = GraphTransforms.dagToCpdag(dag2);
System.out.println("Mix Time " + ((MillisecondTimes.timeMillis() - time) / 1000.0));
time = MillisecondTimes.timeMillis();
Graph dag1 = s2.search();
Graph g2 = GraphTransforms.dagToCpdag(dag1);
System.out.println("Wald lin Time " + ((MillisecondTimes.timeMillis() - time) / 1000.0));
time = MillisecondTimes.timeMillis();
Graph dag = s3.search();
Graph g3 = GraphTransforms.dagToCpdag(dag);
System.out.println("Wald log Time " + ((MillisecondTimes.timeMillis() - time) / 1000.0));
System.out.println(MixedUtils.EdgeStatHeader);
System.out.println(MixedUtils.stringFrom2dArray(MixedUtils.allEdgeStats(trueGraph, g1)));
System.out.println(MixedUtils.stringFrom2dArray(MixedUtils.allEdgeStats(trueGraph, g2)));
System.out.println(MixedUtils.stringFrom2dArray(MixedUtils.allEdgeStats(trueGraph, g3)));
} catch (Throwable t) {
t.printStackTrace();
}
}
}