PRIM algorithm to learn split at node in tree. Maximizes response mean after "boxing off" 90% of data. Args: data (np.ndarray): data of shape[n_samples, n_features] Data which node split will be based off of values (np.array): values
(self, inputs, values)
source not stored for this graph (policy: none)