Dana Angluin

Statistical Learning Theory · 1987–2006

A researcher in the Science corpus: 7 papers; trusts 6 researchers and is trusted by 94 researchers here, as inferred from the citation graph.

Subfields

• Statistical Learning Theory — 8 citations into it

Whom Dana Angluin trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Leslie G. Valiant
2. Nick Littlestone
3. Michael Kearns
4. Sally A. Goldman
5. David Haussler
6. Ming Li
7. Anselm Blumer
8. Andrzej Ehrenfeucht

Who trusts Dana Angluin overall

1. Frank J. Balbach
2. Vitaly Feldman
3. Burr Settles
4. Xiaojin Zhu
5. Colin de la Higuera
6. Sanjoy Dasgupta
7. Xinyun Chen
8. Nicholas Kushmerick
9. Henrik Jacobsson
10. Michael L. Littman

Papers from Dana Angluin's perspective

Ordered by how strongly the researchers Dana Angluin trusts endorse each paper. Same corpus, a different order for every researcher.

1. Learning Regular Sets from Queries and Counterexamples
2. On the learnability of Boolean formulae
3. A theory of the learnable
4. A theory of the learnable
5. Learning Disjunction of Conjunctions
6. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
7. Teachers, learners and black boxes
8. Learning From Noisy Examples
9. Pattern classification and scene analysis
10. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities

Their papers

• Queries revisited (2001) — 241 citations
• Learning from Different Teachers (2003) — 29 citations
• The computational power of population protocols (2006) — 312 citations
• Teachers, learners and black boxes (1997)
• Learning From Noisy Examples (1988)
• Queries and concept learning (1988)
• Learning Regular Sets from Queries and Counterexamples (1987)