The Minimum L-Complexity Algorithm and Its Applications to Learning Non-Parametric Rules

Cite

Text

Yamanishi. "The Minimum L-Complexity Algorithm and Its Applications to Learning Non-Parametric Rules." Annual Conference on Computational Learning Theory, 1994. doi:10.1145/180139.181096

Markdown

[Yamanishi. "The Minimum L-Complexity Algorithm and Its Applications to Learning Non-Parametric Rules." Annual Conference on Computational Learning Theory, 1994.](https://mlanthology.org/colt/1994/yamanishi1994colt-minimum/) doi:10.1145/180139.181096

BibTeX

@inproceedings{yamanishi1994colt-minimum,
  title     = {{The Minimum L-Complexity Algorithm and Its Applications to Learning Non-Parametric Rules}},
  author    = {Yamanishi, Kenji},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1994},
  pages     = {173-182},
  doi       = {10.1145/180139.181096},
  url       = {https://mlanthology.org/colt/1994/yamanishi1994colt-minimum/}
}