From 918a7b4180d8114c9fbe4c5fd19d5af871b00bf6 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ricardo=20Montan=CC=83ana?= Date: Wed, 16 Aug 2023 12:36:38 +0200 Subject: [PATCH] Remove unneeded output --- src/BayesNet/BayesMetrics.cc | 1 - src/BayesNet/TAN.cc | 2 -- 2 files changed, 3 deletions(-) diff --git a/src/BayesNet/BayesMetrics.cc b/src/BayesNet/BayesMetrics.cc index 7d249ee..a0b46f1 100644 --- a/src/BayesNet/BayesMetrics.cc +++ b/src/BayesNet/BayesMetrics.cc @@ -45,7 +45,6 @@ namespace bayesnet { auto mask = samples.index({ -1, "..." }) == value; margin[value] = mask.sum().item() / samples.size(1); } - cout << "Margin: " << margin; for (auto [first, second] : combinations) { int index_first = find(features.begin(), features.end(), first) - features.begin(); int index_second = find(features.begin(), features.end(), second) - features.begin(); diff --git a/src/BayesNet/TAN.cc b/src/BayesNet/TAN.cc index 3bdfa8e..f0728be 100644 --- a/src/BayesNet/TAN.cc +++ b/src/BayesNet/TAN.cc @@ -22,8 +22,6 @@ namespace bayesnet { auto root = mi[mi.size() - 1].first; // 2. Compute mutual information between each feature and the class auto weights_matrix = metrics.conditionalEdge(weights); - cout << "*** Weights matrix ***\n"; - cout << weights_matrix << "\n"; // 3. Compute the maximum spanning tree auto mst = metrics.maximumSpanningTree(features, weights_matrix, root); // 4. Add edges from the maximum spanning tree to the model