forpy
2
|
This is the complete list of members for forpy::ClassificationTree, including all inherited members.
cereal::access class | forpy::ClassificationTree | friend |
ClassificationTree(const std::string &filename) | forpy::ClassificationTree | inline |
ClassificationTree(const uint &max_depth=std::numeric_limits< uint >::max(), const uint &min_samples_at_leaf=1, const uint &min_samples_at_node=2, const uint &n_valid_features_to_use=0, const bool &autoscale_valid_features=false, const uint &random_seed=1, const size_t &n_thresholds=0, const float &gain_threshold=1E-7f) | forpy::ClassificationTree | |
combine_leaf_results(const std::vector< Data< Mat >> &leaf_results, const Vec< float > &weights=Vec< float >(), const bool &predict_proba=false) const | forpy::Tree | inline |
DFS(const IDataProvider *data_provider, const ECompletionLevel &completion, Desk *d) | forpy::Tree | |
DFS_and_store(Desk *d, TodoMark &mark, const IDataProvider *dprov, const ECompletionLevel &comp) | forpy::Tree | |
disable_fast_prediction() | forpy::Tree | inline |
DISALLOW_COPY_AND_ASSIGN(ClassificationTree) | forpy::ClassificationTree | private |
enable_fast_prediction() | forpy::Tree | |
fit(const Data< MatCRef > &data_v, const Data< MatCRef > &annotation_v, const size_t &n_threads, const bool &complete_dfs=true, const std::vector< float > &weights=std::vector< float >()) | forpy::Tree | |
fit_dprov(std::shared_ptr< IDataProvider > data_provider, const bool &complete_dfs=true) | forpy::Tree | |
get_decider() const | forpy::Tree | inline |
get_depth() const | forpy::Tree | |
get_input_data_dimensions() const | forpy::Tree | inline |
get_leaf_manager() const | forpy::Tree | inline |
get_n_nodes() const | forpy::Tree | inline |
get_params(const bool &=false) const | forpy::ClassificationTree | inline |
get_samples_stored() const | forpy::Tree | inline |
get_tree() const | forpy::Tree | inline |
get_weight() const | forpy::Tree | inline |
is_initialized() const | forpy::Tree | inline |
make_node(const IDataProvider *data_provider, Desk *d) | forpy::Tree | |
operator<<(std::ostream &stream, const ClassificationTree &self) | forpy::ClassificationTree | friend |
operator==(Tree const &rhs) const | forpy::Tree | |
parallel_DFS(Desk *d, TodoMark &mark, IDataProvider *data_provider, const bool &finalize=true) | forpy::Tree | |
params | forpy::ClassificationTree | private |
predict(const Data< MatCRef > &data_v, const int &num_threads=1, const bool &use_fast_prediction_if_available=true, const bool &predict_proba=false, const bool &for_forest=false) | forpy::Tree | |
predict_leaf(const Data< MatCRef > &data, const id_t &start_node=0, const std::function< void(void *)> &dptf=nullptr) const | forpy::Tree | |
predict_leaf_result(const Data< MatCRef > &data, const id_t &start_node=0, const std::function< void(void *)> &dptf=nullptr) const | forpy::Tree | inline |
predict_proba(const Data< MatCRef > &data_v, const int &num_threads=1, const bool &use_fast_prediction_if_available=true) | forpy::Tree | |
save(const std::string &filename) const | forpy::Tree | |
serialize(Archive &ar, const uint &) | forpy::ClassificationTree | inlineprivate |
set_params(const std::unordered_map< std::string, mu::variant< uint, size_t, float, bool >> ¶ms) | forpy::ClassificationTree | inline |
set_weight(const float &new_weight) | forpy::Tree | inline |
Tree(const uint &max_depth=std::numeric_limits< uint >::max(), const uint &min_samples_at_leaf=1, const uint &min_samples_at_node=2, const std::shared_ptr< IDecider > &decider=nullptr, const std::shared_ptr< ILeaf > &leaf_manager=nullptr, const uint &random_seed=1) | forpy::Tree | |
Tree(std::string filename) | forpy::Tree |