The Teachable Agents Project combines research from computer science, psychology, and education to develop computer-based learning environments. These environments utilize animated pedagogical agents to facilitate science learning and the development of self-regulated learning skills. The use of animated agents allows us to extend the cognitive scaffolding provided by various computer tools and representations (e.g., searchable text, simulations, concept maps, etc.) by embedding them in productive and motivating social-constructive interactions (e.g., peer teaching, collaboration, and assessment). Current projects include Betty's Brain, a learning-by-teaching environment for science learning; CTSiM, an environment for understanding science through a computational thinking framework; SimSelf, a relatively new project that focuses on teaching students about self-regulation and metacognition in the context of science learning; and C3STEM, a community-situated, challenge-based, collaborative STEM learning environment. Our learning environments also include extensive logging of students' interactions with the system and agents.

While machine learning originated as a subfield of artificial intelligence--the area of computer science dedicated to creating humanlike intelligence in computers--it's expanded beyond the boundaries of A.I. into data science and expert systems. But machine learning is fundamentally different from much of what we think of as programming. When we think of a computer program (or the algorithm a program implements), we generally think of a human engineer giving a set of instructions to a computer, telling it how to handle certain inputs that will generate certain outputs. The state maintained by the program changes over time--a Web browser keeps track of which pages it's displaying and responds to user input by (ideally) reacting in a determinate and predictable fashion--but the logic of the program is essentially described by the code written by the human. Machine learning, in many of its forms, is about building programs that themselves build programs.

A system being developed by Christopher Amato, a postdoc at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL), can perform security-camera analysis to identify potential terrorists or illegal entry more accurately and in a fraction of the time it would take a human camera operator. "You can't have a person staring at every single screen, and even if you did the person might not know exactly what to look for," Amato says. "For example, a person is not going to be very good at searching through pages and pages of faces to try to match [an intruder] with a known criminal or terrorist." Existing computer vision systems designed to carry out this task automatically tend to be fairly slow, Amato says. "Sometimes it's important to come up with an alarm immediately, even if you are not yet positive exactly what it is happening," he says.

"Mahout" is a Hindi term for a person who rides an elephant. The elephant, in this case, is Hadoop -- and Mahout is one of the many projects that can sit on top of Hadoop, although you do not always need MapReduce to run it. Mahout puts powerful mathematical tools in the hands of the mere mortal developers who write the InterWebs. It's a package of implementations of the most popular and important machine-learning algorithms, with the majority of the implementations designed specifically to use Hadoop to enable scalable processing of huge data sets. Some algorithms are available only in a nonparallelizable "serial" form due to the nature of the algorithm, but all can take advantage of HDFS for convenient access to data in your Hadoop processing pipeline.

Here is an excellent ILP reference, somewhat older but publicly available. The most recent issue of SIGKDD Explorations is a special issue devoted to multi-relational data mining.

Many and long were the conversations between Lord Byron and Shelley to which I was a devout and silent listener. During one of these, various philosophical doctrines were discussed, and among others the nature of the principle of life, and whether there was any probability of its ever being discovered and communicated. They talked of the experiments of Dr. Darwin (I speak not of what the doctor really did or said that he did, but, as more to my purpose, of what was then spoken of as having been done by him), who preserved a piece of vermicelli in a glass case till by some extraordinary means it began to move with a voluntary motion. Not thus, after all, would life be given. Perhaps a corpse would be reanimated; galvanism had given token of such things: perhaps the component parts of a creature might be manufactured, brought together, and endued with vital warmth (Butler 1998).

This page contains some information on research by David Poole and students on probabilistic reasoning and decision making. It is not intended to be an introduction to the vast literature on these topics, but only the incremental work done by me. For more different perspectives, see the pointers from the Uncertainty in AI (UAI) home page. Maybe someday I will write an online introduction. Probabilistic Horn abduction is a pragmatic combination of logic and probability.

Sam was a brilliant scientist and engineer whose work deeply influenced the fields of artificial intelligence, machine learning, applied mathematics, neural computation, and observational science. He was also a strong advocate for the use of machine learning and computational statistics for scientific data analysis and discovery. Sam T. Roweis was born on April 27, 1972. He graduated from secondary school as valedictorian of the University of Toronto Schools in 1990, and obtained a bachelor's degree with honours from the University of Toronto Engineering Science Program four years later. His first exposure to AI and neural computation occured when--as an exceptional undergraduate--he took the graduate-level Neural Network course taught by Geoffrey Hinton.

You may skip most of these readings if you have prior programming experience in Java.

This is a tutorial aimed at trying to build up the intuition behind solution procedures for partially observable Markov decision processes (POMDPs). It sacrifices completeness for clarity. It tries to present the main problems geometrically, rather than with a series of formulas. In fact, we avoid the actual formulas altogether, try to keep notation to a minimum and rely on pictures to build up the intuition.