ML Anthology

Why Skewing Works: Learning Difficult Boolean Functions with Greedy Tree Learners

Bernard Rosell, Lisa Hellerstein, Soumya Ray, David Page
ICML 2005 pp. 728-735
doi:10.1145/1102351.1102443 /icml/2005/rosell2005icml-skewing/
ICML Semantic Scholar

Cite

Text

Rosell et al. "Why Skewing Works: Learning Difficult Boolean Functions with Greedy Tree Learners." International Conference on Machine Learning, 2005. doi:10.1145/1102351.1102443

Markdown

[Rosell et al. "Why Skewing Works: Learning Difficult Boolean Functions with Greedy Tree Learners." International Conference on Machine Learning, 2005.](https://mlanthology.org/icml/2005/rosell2005icml-skewing/) doi:10.1145/1102351.1102443

BibTeX

@inproceedings{rosell2005icml-skewing,
  title     = {{Why Skewing Works: Learning Difficult Boolean Functions with Greedy Tree Learners}},
  author    = {Rosell, Bernard and Hellerstein, Lisa and Ray, Soumya and Page, David},
  booktitle = {International Conference on Machine Learning},
  year      = {2005},
  pages     = {728-735},
  doi       = {10.1145/1102351.1102443},
  url       = {https://mlanthology.org/icml/2005/rosell2005icml-skewing/}
}