Goto

Collaborating Authors

 Industry


SMOTE: Synthetic Minority Over-sampling Technique

Journal of Artificial Intelligence Research

An approach to the construction of classifiers from imbalanced datasets is described. A dataset is imbalanced if the classification categories are not approximately equally represented. Often real-world data sets are predominately composed of ``normal'' examples with only a small percentage of ``abnormal'' or ``interesting'' examples. It is also the case that the cost of misclassifying an abnormal (interesting) example as a normal example is often much higher than the cost of the reverse error. Under-sampling of the majority (normal) class has been proposed as a good means of increasing the sensitivity of a classifier to the minority class. This paper shows that a combination of our method of over-sampling the minority (abnormal) class and under-sampling the majority (normal) class can achieve better classifier performance (in ROC space) than only under-sampling the majority class. This paper also shows that a combination of our method of over-sampling the minority class and under-sampling the majority class can achieve better classifier performance (in ROC space) than varying the loss ratios in Ripper or class priors in Naive Bayes. Our method of over-sampling the minority class involves creating synthetic minority class examples. Experiments are performed using C4.5, Ripper and a Naive Bayes classifier. The method is evaluated using the area under the Receiver Operating Characteristic curve (AUC) and the ROC convex hull strategy.


Efficient Reinforcement Learning Using Recursive Least-Squares Methods

Journal of Artificial Intelligence Research

The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is mainly due to its fast convergence speed, which is considered to be optimal in practice. In this paper, RLS methods are used to solve reinforcement learning problems, where two new reinforcement learning algorithms using linear value function approximators are proposed and analyzed. The two algorithms are called RLS-TD(lambda) and Fast-AHC (Fast Adaptive Heuristic Critic), respectively. RLS-TD(lambda) can be viewed as the extension of RLS-TD(0) from lambda=0 to general lambda within interval [0,1], so it is a multi-step temporal-difference (TD) learning algorithm using RLS methods. The convergence with probability one and the limit of convergence of RLS-TD(lambda) are proved for ergodic Markov chains. Compared to the existing LS-TD(lambda) algorithm, RLS-TD(lambda) has advantages in computation and is more suitable for online learning. The effectiveness of RLS-TD(lambda) is analyzed and verified by learning prediction experiments of Markov chains with a wide range of parameter settings. The Fast-AHC algorithm is derived by applying the proposed RLS-TD(lambda) algorithm in the critic network of the adaptive heuristic critic method. Unlike conventional AHC algorithm, Fast-AHC makes use of RLS methods to improve the learning-prediction efficiency in the critic. Learning control experiments of the cart-pole balancing and the acrobot swing-up problems are conducted to compare the data efficiency of Fast-AHC with conventional AHC. From the experimental results, it is shown that the data efficiency of learning control can also be improved by using RLS methods in the learning-prediction process of the critic. The performance of Fast-AHC is also compared with that of the AHC method using LS-TD(lambda). Furthermore, it is demonstrated in the experiments that different initial values of the variance matrix in RLS-TD(lambda) are required to get better performance not only in learning prediction but also in learning control. The experimental results are analyzed based on the existing theoretical work on the transient phase of forgetting factor RLS methods.


AAAI/RoboCup-2001 Urban Search and Rescue Events

AI Magazine

The RoboCup Rescue Physical Agent League Competition was held in the summer of 2001 in conjunction with the AAAI Mobile Robot Competition Urban Search and Rescue event, eerily preceding the September 11 World Trade Center (WTC) disaster. Four teams responded to the WTC disaster through the auspices of the Center for Robot-Assisted Search and Rescue (CRASAR), directed by John Blitch. Blitch, through his position as program manager for the Defense Advanced Research Projects Agency (DARPA) Tactical Mobile Robots Program, was a supporter of the competition; he also served as a member of the rules committee and a judge. USF participated by chairing the rules committee, judging, assisting with the logistics, providing commentary, and demonstrating tethered and wireless robots whenever entrants had to skip around during the competition.


AAAI Hosts the National Botball Tournament!

AI Magazine

Botball is a national program in which teams of middle and high school students design, build, and program small autonomous mobile robots to compete in a highly charged interactive (but nondestructive) tournament. Botball students learn to program in c, construct feedback and control loops, create electromechanical systems, and integrate it all together while they work on a team. Botball takes place in regional tournaments across the country and culminates in a National Botball Tournament traditionally hosted by the Association for the Advancement of Artificial Intelligence at its annual conference. This program puts reusable equipment into schools and, at the Botball Teacher Workshops, trains teachers in robotics and the integration of robotics into their curriculum.


Ten Years of the AAAI Mobile Robot Competition and Exhibition

AI Magazine

Summer 2001 marked the tenth AAAI Mobile Robot Competition and Exhibition. A decade of contests and exhibitions have inspired innovation and research in AI robotics. We also reflect on how the contest has served as an arena for important debates in the AI and robotics communities. The article closes with a speculative look forward to the next decade of AAAI robot competitions.


RoboCup-2001: The Fifth Robotic Soccer World Championships

AI Magazine

RoboCup-2001 was the Fifth International RoboCup Competition and Conference. It was held for the first time in the United States, following RoboCup-2000 in Melbourne, Australia; RoboCup-99 in Stockholm; RoboCup-98 in Paris; and RoboCup-97 in Osaka.


AAAI/RoboCup-2001 Robot Rescue

AI Magazine

The AAAI/RoboCup Robot Rescue event is designed to push researchers to design robotic systems for urban search and rescue. The rules were written to approximate a real rescue situation in a simulated environment constructed by the National Institute of Standards and Technology.


The Hors d'Oeuvres Event at the AAAI-2001 Mobile Robot Competition

AI Magazine

Serving hors d'oeuvres is not as easy as it might seem! You have to move carefully between people, gently and politely offer them hors d'oeuvres, make sure that you have not forgotten to serve someone in the room, and refill the serving tray when required. These are the challenges that robots have to face in the Hors d'Oeuvres, Anyone?


The AAAI-2001 Mobile Robot Exhibition

AI Magazine

The 2001 Association for the Advancement of Artificial Intelligence Mobile Robot Exhibition provided an opportunity for AI researchers to interact and share ideas. Despite some difficulties with environment and timing, the primary objective of disseminating information was achieved. A short summary of each robot demonstrates the variety in form and function among the exhibitions.


RoboCup-2001: The Fifth Robotic Soccer World Championships

AI Magazine

RoboCup-2001 was the Fifth International RoboCup Competition and Conference. It was held for the first time in the United States, following RoboCup-2000 in Melbourne, Australia; RoboCup-99 in Stockholm; RoboCup-98 in Paris; and RoboCup-97 in Osaka. This article discusses in detail each one of the events at RoboCup-2001, focusing on the competition leagues.