Home
last modified time | relevance | path

Searched refs:n_trees (Results 1 – 25 of 90) sorted by relevance

1234

/dports/biology/phyml/phyml-3.3.20200621/src/
H A Dmain.c96 else io->n_trees = 1; in main()
98 if(io->n_trees == 0 && io->in_tree == 2) in main()
104 if((io->n_data_sets > 1) && (io->n_trees > 1)) in main()
106 io->n_data_sets = MIN(io->n_trees,io->n_data_sets); in main()
107 io->n_trees = MIN(io->n_trees,io->n_data_sets); in main()
128 for(num_tree=(io->n_trees == 1)?(0):(num_data_set);num_tree < io->n_trees;num_tree++) in main()
132 if(orig_random_input_tree == YES && io->n_trees > 1) in main()
366 if(io->n_trees > 1 && io->n_data_sets > 1) break; in main()
H A Dtiporder.h43 void TIPO_Minimize_Tip_Order_Score(int n_trees, t_tree **list_tree, t_tree *ref_tree);
48 int TIPO_Untangle_Tree_List(int n_trees, t_tree **list_tree, t_tree *ref_tree);
H A Dmixt.c1233 int n_trees; in MIXT_Record_All_Mixtures() local
1237 n_trees = 0; in MIXT_Record_All_Mixtures()
1245 n_trees++; in MIXT_Record_All_Mixtures()
1310 int n_trees; in MIXT_Reconnect_All_Mixtures() local
1315 n_trees = 0; in MIXT_Reconnect_All_Mixtures()
1320 n_trees++; in MIXT_Reconnect_All_Mixtures()
1335 int n_trees; in MIXT_Record_Has_Invariants() local
1339 n_trees = 0; in MIXT_Record_Has_Invariants()
1345 n_trees++; in MIXT_Record_Has_Invariants()
1359 int n_trees; in MIXT_Reset_Has_Invariants() local
[all …]
H A Dm4.c60 else io->n_trees = 1; in M4_main()
63 if((io->n_data_sets > 1) && (io->n_trees > 1)) in M4_main()
65 io->n_data_sets = MIN(io->n_trees,io->n_data_sets); in M4_main()
66 io->n_trees = MIN(io->n_trees,io->n_data_sets); in M4_main()
92 for(num_tree=(io->n_trees == 1)?(0):(num_data_set);num_tree < io->n_trees;num_tree++) in M4_main()
239 if(io->n_trees > 1 && io->n_data_sets > 1) break; in M4_main()
/dports/math/py-optuna/optuna-2.10.0/optuna/importance/_fanova/
H A D_evaluator.py63 self, *, n_trees: int = 64, max_depth: int = 64, seed: Optional[int] = None
66 n_trees=n_trees,
H A D_fanova.py42 n_trees: int,
51 n_estimators=n_trees,
/dports/math/cgal/CGAL-5.3/include/CGAL/Classification/ETHZ/internal/random-forest/
H A Dcommon-libraries.hpp86 size_t n_trees; member
95 n_trees(100), in ForestParams()
108 ar & BOOST_SERIALIZATION_NVP(n_trees); in serialize()
121 I_Binary_write_size_t_into_uinteger32 (os, n_trees); in write()
133 I_Binary_read_size_t_from_uinteger32 (is, n_trees); in read()
H A Dforest.hpp160 for (std::size_t i_tree = nb_trees; i_tree < nb_trees + params.n_trees; ++ i_tree) in train()
172 tbb::parallel_for(tbb::blocked_range<size_t>(nb_trees, nb_trees + params.n_trees), f); in train()
177 for (size_t i_tree = nb_trees; i_tree < nb_trees + params.n_trees; ++i_tree) in train()
180 …tf("Training tree %zu/%zu, max depth %zu\n", i_tree+1, nb_trees + params.n_trees, params.max_depth… in train()
/dports/math/py-pynndescent/pynndescent-0.5.4/pynndescent/
H A Dpynndescent_.py645 n_trees=None, argument
662 if n_trees is None:
663 n_trees = 5 + int(round((data.shape[0]) ** 0.25))
664 n_trees = min(32, n_trees) # Only so many trees are useful
668 self.n_trees = n_trees
759 n_trees,
1626 self.n_trees = int(np.round(self.n_trees / 3))
1630 self.n_trees,
1814 n_trees=None, argument
1833 self.n_trees = n_trees
[all …]
/dports/science/py-scikit-learn/scikit-learn-1.0.2/examples/neighbors/
H A Dapproximate_nearest_neighbors.py121 def __init__(self, n_neighbors=5, metric="euclidean", n_trees=10, search_k=-1): argument
123 self.n_trees = n_trees
132 self.annoy_.build(self.n_trees)
/dports/math/py-pynndescent/pynndescent-0.5.4/pynndescent/tests/
H A Dtest_pynndescent_.py246 n_trees=20,
268 n_trees=20,
299 n_trees=5,
317 n_trees=5,
335 n_trees=5,
352 n_trees=5,
/dports/math/py-optuna/optuna-2.10.0/optuna/importance/
H A D_mean_decrease_impurity.py44 self, *, n_trees: int = 64, max_depth: int = 64, seed: Optional[int] = None
49 n_estimators=n_trees,
/dports/misc/py-xgboost/xgboost-1.5.1/demo/c-api/basic/
H A Dc-api-demo.c55 int n_trees = 10; in main() local
58 for (int i = 0; i < n_trees; ++i) { in main()
/dports/misc/xgboost/xgboost-1.5.1/demo/c-api/basic/
H A Dc-api-demo.c55 int n_trees = 10; in main() local
58 for (int i = 0; i < n_trees; ++i) { in main()
/dports/misc/py-xgboost/xgboost-1.5.1/src/tree/
H A Dupdater_quantile_hist.h199 explicit Builder(const size_t n_trees, const TrainParam &param, in Builder()
201 : n_trees_(n_trees), param_(param), pruner_(std::move(pruner)), in Builder()
311 void SetBuilder(const size_t n_trees, std::unique_ptr<Builder<GradientSumT>>*, DMatrix *dmat);
H A Dupdater_quantile_hist.cc51 void QuantileHistMaker::SetBuilder(const size_t n_trees, in SetBuilder() argument
55 new Builder<GradientSumT>(n_trees, param_, std::move(pruner_), dmat)); in SetBuilder()
89 const size_t n_trees = trees.size(); in Update() local
92 this->SetBuilder(n_trees, &float_builder_, dmat); in Update()
97 SetBuilder(n_trees, &double_builder_, dmat); in Update()
/dports/misc/xgboost/xgboost-1.5.1/src/tree/
H A Dupdater_quantile_hist.h199 explicit Builder(const size_t n_trees, const TrainParam &param, in Builder()
201 : n_trees_(n_trees), param_(param), pruner_(std::move(pruner)), in Builder()
311 void SetBuilder(const size_t n_trees, std::unique_ptr<Builder<GradientSumT>>*, DMatrix *dmat);
H A Dupdater_quantile_hist.cc51 void QuantileHistMaker::SetBuilder(const size_t n_trees, in SetBuilder() argument
55 new Builder<GradientSumT>(n_trees, param_, std::move(pruner_), dmat)); in SetBuilder()
89 const size_t n_trees = trees.size(); in Update() local
92 this->SetBuilder(n_trees, &float_builder_, dmat); in Update()
97 SetBuilder(n_trees, &double_builder_, dmat); in Update()
/dports/dns/knot3/knot-3.1.5/src/knot/updates/
H A Dchangesets.c69 ch_it->trees[ch_it->n_trees++] = t; in changeset_iter_init()
74 assert(ch_it->n_trees); in changeset_iter_init()
508 if (--it->n_trees > 0) { in changeset_iter_next()
509 for (size_t i = 0; i < it->n_trees; i++) { in changeset_iter_next()
H A Dchangesets.h46 size_t n_trees; /*!< Their count. */ member
/dports/dns/knot3-lib/knot-3.1.5/src/knot/updates/
H A Dchangesets.c69 ch_it->trees[ch_it->n_trees++] = t; in changeset_iter_init()
74 assert(ch_it->n_trees); in changeset_iter_init()
508 if (--it->n_trees > 0) { in changeset_iter_next()
509 for (size_t i = 0; i < it->n_trees; i++) { in changeset_iter_next()
H A Dchangesets.h46 size_t n_trees; /*!< Their count. */ member
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/ensemble/_hist_gradient_boosting/
H A Dgradient_boosting.py792 n_trees = len(predictors_of_ith_iteration)
800 if n_trees == 1:
801 log_msg += "{} tree, {} leaves, ".format(n_trees, n_leaves)
803 log_msg += "{} trees, {} leaves ".format(n_trees, n_leaves)
804 log_msg += "({} on avg), ".format(int(n_leaves / n_trees))
/dports/math/py-openTSNE/openTSNE-0.6.1/openTSNE/
H A Dnearest_neighbors.py493 n_trees = 5 + int(round((data.shape[0]) ** 0.5 / 20))
512 n_trees=n_trees,
/dports/devel/pytype/pytype-2021.9.9/pytype/typeshed/stubs/annoy/annoy/
H A D__init__.pyi37 def build(self, n_trees: int, n_jobs: int = ...) -> Literal[True]: ...

1234