Searched refs:SplitCandidate (Results 1 – 15 of 15) sorted by relevance
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| D | training_ops.cc | 28 struct SplitCandidate { struct
29 SplitCandidate() {} in SplitCandidate() argument
93 std::map<int32, SplitCandidate> best_splits; in Compute()
116 const SplitCandidate& candidate = split_entry.second; in Compute()
200 std::map<int32, SplitCandidate>* best_split_per_node) { in FindBestSplitsPerNode()
213 SplitCandidate candidate; in FindBestSplitsPerNode()
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/kernels/ |
| D | training_ops.cc | 40 struct SplitCandidate { struct
63 int32 partition_id, SplitCandidate* split, in UpdateBestSplit()
64 std::map<int32, SplitCandidate>* best_splits) { in UpdateBestSplit()
96 SplitCandidate& best_split = best_split_it->second; in UpdateBestSplit()
377 std::map<int32, SplitCandidate> best_splits; in Compute()
444 std::map<int32, SplitCandidate>* best_splits) { in FindBestSplitsPerPartitionNormal()
465 SplitCandidate split; in FindBestSplitsPerPartitionNormal()
480 std::map<int32, SplitCandidate>* best_splits) { in FindBestSplitOblivious()
496 SplitCandidate split; in FindBestSplitOblivious()
536 SplitCandidate& best_split = best_split_it->second; in FindBestSplitOblivious()
[all …]
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| D | graph_collection_operator.cc | 38 SplitCandidate* best, in BestSplit()
60 *best = SplitCandidate(); in BestSplit()
|
| D | grow_stats.h | 46 virtual bool BestSplit(SplitCandidate* best) const = 0;
129 bool BestSplit(SplitCandidate* best) const override { return false; } in BestSplit()
186 bool BestSplit(SplitCandidate* best) const override;
543 bool BestSplit(SplitCandidate* best) const override;
|
| D | graph_collection_operator.h | 62 bool BestSplit(int32 node_id, SplitCandidate* best,
|
| D | fertile-stats-resource.h | 82 bool BestSplit(int32 node_id, SplitCandidate* best, int32* depth);
|
| D | decision-tree-resource.h | 70 void SplitNode(int32 node_id, SplitCandidate* best,
|
| D | fertile-stats-resource.cc | 59 bool FertileStatsResource::BestSplit(int32 node_id, SplitCandidate* best, in BestSplit()
|
| D | split_collection_operators.h | 86 virtual bool BestSplit(int32 node_id, SplitCandidate* best,
|
| D | decision-tree-resource.cc | 53 void DecisionTreeResource::SplitNode(int32 node_id, SplitCandidate* best, in SplitNode()
|
| D | split_collection_operators.cc | 139 bool SplitCollectionOperator::BestSplit(int32 node_id, SplitCandidate* best, in BestSplit()
|
| D | grow_stats.cc | 379 bool ClassificationStats::BestSplit(SplitCandidate* best) const { in BestSplit()
908 bool LeastSquaresRegressionGrowStats::BestSplit(SplitCandidate* best) const { in BestSplit()
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/proto/ |
| D | fertile_stats.proto | 65 repeated SplitCandidate candidates = 1;
80 message SplitCandidate { message
|
| D | tensor_forest_params.proto | 18 // a SplitCandidate::LeafStat proto.
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/ |
| D | stats_ops.cc | 392 std::unique_ptr<SplitCandidate> best(new SplitCandidate); in Compute()
|