When Does Greedy Learning of Relevant Attributes Succeed?

Jan Arpe, RĂ¼diger Reischuk. When Does Greedy Learning of Relevant Attributes Succeed?. In Guohui Lin, editor, Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings. Volume 4598 of Lecture Notes in Computer Science, pages 296-306, Springer, 2007. [doi]

@inproceedings{ArpeR07:0,
  title = {When Does Greedy Learning of Relevant Attributes Succeed?},
  author = {Jan Arpe and RĂ¼diger Reischuk},
  year = {2007},
  doi = {10.1007/978-3-540-73545-8_30},
  url = {http://dx.doi.org/10.1007/978-3-540-73545-8_30},
  researchr = {https://researchr.org/publication/ArpeR07%3A0},
  cites = {0},
  citedby = {0},
  pages = {296-306},
  booktitle = {Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings},
  editor = {Guohui Lin},
  volume = {4598},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-73544-1},
}