Search Results for author:
Found 4 papers, 0 papers with code
Stochastic Induction of Decision Trees with Application to Learning Haar Tree
Experimentally, the algorithm is compared with several other related state-of-the-art decision tree learning methods, including the baseline non-stochastic approach.
Synthetic Reduced Nearest Neighbor Model for Regression
This algorithm is comprised of two steps: (1) The assignment step, where assignments of the samples to each centroid is found and the target response (i. e., prediction) of each centroid is determined; and (2) the update/centroid step, where each centroid is updated such that the loss function of the entire model is minimized.
Adversarial Poisoning Attacks and Defense for General Multi-Class Models Based On Synthetic Reduced Nearest Neighbors
Through extensive experimental analysis, we demonstrate that (i) the proposed attack technique can deteriorate the accuracy of several models drastically, and (ii) under the proposed attack, the proposed defense technique significantly outperforms other conventional machine learning models in recovering the accuracy of the targeted model.
Alternating optimization of decision trees, with application to learning sparse oblique trees
Learning a decision tree from data is a difficult optimization problem.
