Dana Angluin

Dana Angluin
Dana Angluin
Fields Computer Science
Institutions Yale University
Alma mater University of California, Berkeley
Doctoral advisor Manuel Blum
Known for L* Algorithm
Query Learning

Contents

Biography

Professor Angluin is interested in machine learning and computational learning theory. Algorithmic modeling and analysis of learning tasks gives insight into the phenomena of learning, and suggests avenues for the creation of tools to help people learn, and for the design of "smarter" software and artificial agents that flexibly adapt their behavior. Professor Angluin’s thesis was among the first work to apply complexity theory to the field of inductive inference. Her work on learning from positive data reversed a previous dismissal of that topic, and established a flourishing line of research. Her work on learning with queries established the models and the foundational results for learning with membership queries. Recently, her work has focused on the areas of coping with errors in the answers to queries, map-learning by mobile robots, and fundamental questions in modeling the interaction of a teacher and a learner.

Professor Angluin helped found the Computational Learning Theory conference, and has served on program committees for COLT and on the COLT Steering committee. She served as an area editor for Information and Computation from 1989-1992. She organized the Computer Science Department’s Perlis Symposium in April 2001: "From Statistics to Chat: Trends in Machine Learning." She is a member of the Association for Computing Machinery and the Association for Women in Mathematics.

Work

Representative Publications:

  • "Queries revisited," Proc. ALT 2001, 12-31,2001.
  • "Robot navigation with distance queries," with J. Westbrook and W. Zhu, SIAM Computing, 30:110-144, 2000.
  • "Learning regular sets from queries and counterexamples," Information and Computation, 75:87-106, 1989.
  • "Learning k-bounded context-free grammars," Re-search Report, 557, 1987.
  • "Finding patterns common to a set of strings," Journal of Computer and System Sciences, 21:46-62, 1980.
  • "Inductive inference of formal language from positive data," Information and Control 45:117-135, 1980.

See also

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Language identification in the limit — is a formal model for inductive inference. It was introduced by E. Mark Gold in his paper with the same title [http://www.isrl.uiuc.edu/ amag/langev/paper/gold67limit.html] . In this model, a learner is provided with presentation of some language …   Wikipedia

  • Covering graph — In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the vertex set of G. A covering map f is a surjection and a local isomorphism: the… …   Wikipedia

  • Manuel Blum — Born April 26, 1938 (1938 04 26) (age 73) Caracas, Venezuela Residence Pittsburgh …   Wikipedia

  • QED (text editor) — QED is a line oriented computer text editor that was designed by Butler Lampson and L. Peter Deutsch for the Berkeley Timesharing System running on the SDS 940. It was implemented by L. Peter Deutsch and Dana Angluin between 1965 and 1966. [cite… …   Wikipedia

  • Finite thickness — In formal language theory, a class of languages mathcal L has finite thickness if for every string s , there are only finite consistent languages in mathcal L. This condition was introduced by Dana Angluin in connection with learning, as a… …   Wikipedia

  • Autostabilisation — L autostabilisation, ou auto stabilisation, est la propriété d un système réparti, composé de plusieurs machines capables de communiquer entre elles, qui consiste, lorsque le système est mal initialisé ou perturbé, à retourner automatiquement à… …   Wikipédia en Français

  • Inquiry — For other uses, see Public inquiry and Enquiry character. An inquiry is any process that has the aim of augmenting knowledge, resolving doubt, or solving a problem. A theory of inquiry is an account of the various types of inquiry and a treatment …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”