ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > GREEDY ALGORITHMS:
Reports tagged with greedy algorithms:
TR06-065 | 24th May 2006
Jan Arpe, RĂ¼diger Reischuk

When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---

Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that seem to perform reasonably well in practice if a sufficiently large random subset of examples of the target concept is provided. Introducing a new ... more >>>



ISSN 1433-8092 | Imprint