HomeSort by relevance Sort by last modified time
    Searched refs:CvDTreeNode (Results 1 - 4 of 4) sorted by null

  /external/opencv/ml/include/
ml.h 671 struct CvDTreeNode
677 CvDTreeNode* parent;
678 CvDTreeNode* left;
679 CvDTreeNode* right;
759 virtual CvDTreeNode* subsample_data( const CvMat* _subsample_idx );
771 virtual int* get_class_labels( CvDTreeNode* n );
772 virtual float* get_ord_responses( CvDTreeNode* n );
773 virtual int* get_labels( CvDTreeNode* n );
774 virtual int* get_cat_var_data( CvDTreeNode* n, int vi );
775 virtual CvPair32s32f* get_ord_var_data( CvDTreeNode* n, int vi )
    [all...]
  /external/opencv/ml/src/
mltree.cpp 274 tree_block_size = MAX((int)sizeof(CvDTreeNode)*8, max_split_size);
277 CV_CALL( node_heap = cvCreateSet( 0, sizeof(*node_heap), sizeof(CvDTreeNode), tree_storage ));
546 CvDTreeNode* CvDTreeTrainData::subsample_data( const CvMat* _subsample_idx )
548 CvDTreeNode* root = 0;
565 CvDTreeNode temp;
801 CvDTreeNode* CvDTreeTrainData::new_node( CvDTreeNode* parent, int count,
804 CvDTreeNode* node = (CvDTreeNode*)cvSetNew( node_heap );
875 void CvDTreeTrainData::free_node( CvDTreeNode* node
    [all...]
mlboost.cpp 135 CvDTreeNode* node = root;
140 CvDTreeNode* parent;
162 CvBoostTree::try_split_node( CvDTreeNode* node )
182 CvBoostTree::calc_node_dir( CvDTreeNode* node )
244 CvBoostTree::find_split_ord_class( CvDTreeNode* node, int vi )
331 CvBoostTree::find_split_cat_class( CvDTreeNode* node, int vi )
440 CvBoostTree::find_split_ord_reg( CvDTreeNode* node, int vi )
488 CvBoostTree::find_split_cat_reg( CvDTreeNode* node, int vi )
571 CvBoostTree::find_surrogate_split_ord( CvDTreeNode* node, int vi )
637 CvBoostTree::find_surrogate_split_cat( CvDTreeNode* node, int vi
    [all...]
mlrtrees.cpp 96 CvDTreeSplit* CvForestTree::find_best_split( CvDTreeNode* node )
384 CvDTreeNode* predicted_node = 0;
551 CvDTreeNode* predicted_node = trees[k]->predict( sample, missing );

Completed in 21 milliseconds