most citedAsymmetric Impurity Functions, Class Weighting, and Optimal Splits for Binary Classification Trees

2 citations · 2 across the 3 of their papers we have counts for

collaborators

4 papers

cs.LG2019★ 2 cited

Asymmetric Impurity Functions, Class Weighting, and Optimal Splits for Binary Classification Trees

David Zimmermann

We investigate how asymmetrizing an impurity function affects the choice of optimal node splits when growing a decision tree for binary classification. In particular, we relax the…

math.FA2014

Elementary proof of logarithmic Sobolev inequalities for Gaussian convolutions on

David Zimmermann

In a 2013 paper, the author showed that the convolution of a compactly supported measure on the real line with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI).…

math.PR2014

Logarithmic Sobolev inequalities for mollified compactly supported measures

David Zimmermann

We show that the convolution of a compactly supported measure on with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). We use this result to give a…

math.FA2014

Random Matrices with Log-Range Correlations, and Log-Sobolev Inequalities

Todd Kemp, David Zimmermann

Let be a symmetric random matrix whose -scaled centered entries are uniformly square integrable. We prove that if the entries of can be partitione…