# frozen_string_literal: true require 'rumale/tree/extra_tree_regressor' require 'rumale/ensemble/random_forest_regressor' module Rumale module Ensemble # ExtraTreesRegressor is a class that implements extremely randomized trees for regression # The algorithm of extremely randomized trees is similar to random forest. # The features of the algorithm of extremely randomized trees are # not to apply the bagging procedure and to randomly select the threshold for splitting feature space. # # @example # estimator = # Rumale::Ensemble::ExtraTreesRegressor.new( # n_estimators: 10, criterion: 'mse', max_depth: 3, max_leaf_nodes: 10, min_samples_leaf: 5, random_seed: 1) # estimator.fit(training_samples, traininig_values) # results = estimator.predict(testing_samples) # # *Reference* # - P. Geurts, D. Ernst, and L. Wehenkel, "Extremely randomized trees," Machine Learning, vol. 63 (1), pp. 3--42, 2006. class ExtraTreesRegressor < RandomForestRegressor # Return the set of estimators. # @return [Array] attr_reader :estimators # Return the importance for each feature. # @return [Numo::DFloat] (size: n_features) attr_reader :feature_importances # Return the random generator for random selection of feature index. # @return [Random] attr_reader :rng # Create a new regressor with extremely randomized trees. # # @param n_estimators [Integer] The numeber of trees for contructing extremely randomized trees. # @param criterion [String] The function to evalue spliting point. Supported criteria are 'gini' and 'entropy'. # @param max_depth [Integer] The maximum depth of the tree. # If nil is given, extra tree grows without concern for depth. # @param max_leaf_nodes [Integer] The maximum number of leaves on extra tree. # If nil is given, number of leaves is not limited. # @param min_samples_leaf [Integer] The minimum number of samples at a leaf node. # @param max_features [Integer] The number of features to consider when searching optimal split point. # If nil is given, split process considers all features. # @param n_jobs [Integer] The number of jobs for running the fit and predict methods in parallel. # If nil is given, the methods do not execute in parallel. # If zero or less is given, it becomes equal to the number of processors. # This parameter is ignored if the Parallel gem is not loaded. # @param random_seed [Integer] The seed value using to initialize the random generator. # It is used to randomly determine the order of features when deciding spliting point. def initialize(n_estimators: 10, criterion: 'mse', max_depth: nil, max_leaf_nodes: nil, min_samples_leaf: 1, max_features: nil, n_jobs: nil, random_seed: nil) check_params_type_or_nil(Integer, max_depth: max_depth, max_leaf_nodes: max_leaf_nodes, max_features: max_features, n_jobs: n_jobs, random_seed: random_seed) check_params_integer(n_estimators: n_estimators, min_samples_leaf: min_samples_leaf) check_params_string(criterion: criterion) check_params_positive(n_estimators: n_estimators, max_depth: max_depth, max_leaf_nodes: max_leaf_nodes, min_samples_leaf: min_samples_leaf, max_features: max_features) super end # Fit the model with given training data. # # @param x [Numo::DFloat] (shape: [n_samples, n_features]) The training data to be used for fitting the model. # @param y [Numo::DFloat] (shape: [n_samples, n_outputs]) The target values to be used for fitting the model. # @return [ExtraTreesRegressor] The learned regressor itself. def fit(x, y) check_sample_array(x) check_tvalue_array(y) check_sample_tvalue_size(x, y) # Initialize some variables. n_features = x.shape[1] @params[:max_features] = Math.sqrt(n_features).to_i unless @params[:max_features].is_a?(Integer) @params[:max_features] = [[1, @params[:max_features]].max, n_features].min # Construct forest. rng_seeds = Array.new(@params[:n_estimators]) { @rng.rand(Rumale::Values.int_max) } @estimators = if enable_parallel? parallel_map(@params[:n_estimators]) { |n| plant_tree(rng_seeds[n]).fit(x, y) } else Array.new(@params[:n_estimators]) { |n| plant_tree(rng_seeds[n]).fit(x, y) } end @feature_importances = if enable_parallel? parallel_map(@params[:n_estimators]) { |n| @estimators[n].feature_importances }.reduce(&:+) else @estimators.map(&:feature_importances).reduce(&:+) end @feature_importances /= @feature_importances.sum self end # Predict values for samples. # # @param x [Numo::DFloat] (shape: [n_samples, n_features]) The samples to predict the values. # @return [Numo::DFloat] (shape: [n_samples, n_outputs]) Predicted value per sample. def predict(x) check_sample_array(x) super end # Return the index of the leaf that each sample reached. # # @param x [Numo::DFloat] (shape: [n_samples, n_features]) The samples to assign each leaf. # @return [Numo::Int32] (shape: [n_samples, n_estimators]) Leaf index for sample. def apply(x) check_sample_array(x) super end # Dump marshal data. # @return [Hash] The marshal data about ExtraTreesRegressor. def marshal_dump super end # Load marshal data. # @return [nil] def marshal_load(obj) super end private def plant_tree(rnd_seed) Tree::ExtraTreeRegressor.new( criterion: @params[:criterion], max_depth: @params[:max_depth], max_leaf_nodes: @params[:max_leaf_nodes], min_samples_leaf: @params[:min_samples_leaf], max_features: @params[:max_features], random_seed:rnd_seed ) end end end end