We introduce a semi-supervised support vector machine (S3yM) method. Given a training set of labeled data and a working set of unlabeled data, S3YM constructs a support vector machine using boththe training and working sets. We use S3 YM to solve the transduction problem using overall risk minimization (ORM) posed by Yapnik. The transduction problem is to estimate the value of a classification function at the given points in the working set. This contrasts with the standard inductive learning problem of estimating the classification function at all possible values and then using the fixed function to deduce the classes of the working set data.

All regular members is available by writing to ncai@aaai.

Calendar of upcoming AI meetings, conferences, and other events.

In a complex, dynamic multiagent setting, coherent team actions are often jeopardized by conflicts in agents' beliefs, plans, and actions. Despite the considerable progress in teamwork research, the challenge of intrateam conflict resolution has remained largely unaddressed. This article presents CONSA, a system we are developing to resolve conflicts using argumentation-based negotiations. CONSA focuses on exploiting the benefits of argumentation in a team setting. Thus, CONSA casts conflict resolution as a team problem, so that the recent advances in teamwork can be brought to bear during conflict resolution to improve argumentation flexibility. Furthermore, because teamwork conflicts sometimes involve past teamwork, teamwork models can be exploited to provide agents with reusable argumentation knowledge. Additionally, CONSA also includes argumentation strategies geared toward benefiting the team, rather than the individual, and techniques to reduce argumentation overhead.

Students interested in attending the National Conference on Artificial Intelligence in Austin, July 30-August 3, 2000, should consult the AAAI web site for further information about the Student Abstract program and the Doctoral Consortium. Details about these programs have also been mailed to all AAAI members. The Scholarship Program provides partial travel support and a complimentary technical program registration for students who (1) are full-time undergraduate or graduate students at colleges and universities; (2) are members of AAAI; (3) submit papers to the technical program or letters of recommendation from their faculty adviser; and (4) submit scholarship applications to AAAI by April 15, 2000. In addition, repeat scholarship applicants must have fulfilled the volunteer and reporting requirements for previous awards. In the event that scholarship applications AAAI President David Waltz presented The 1999 AAAI Classic Paper Award to exceed available funds, preference John McDermott for R1: An Expert in the Computer Systems Domain.

Human intelligence is shaped by what is most important to us -- the things that cause ecstasy, despair, pleasure, pain, and other intense emotions. The ability to separate the important from the unimportant underlies such faculties as attention, focusing, situation and outcome assessment, priority setting, judgment, taste, goal selection, credit assignment, the selection of relevant memories and precedents, and learning from experience. AI has for the most part focused on logic and reasoning in artificial situations where only relevant variables and operators are specified and has paid insufficient attention to processes of reducing the richness and disorganization of the real world to a form where logical reasoning can be applied. This article discusses the role of importance judgment in intelligence; provides some examples of research that make use of importance judgments; and offers suggestions for new mechanisms, architectures, applications, and research directions for AI.

Calendar of upcoming AI meetings, conferences, and other events.

There are two distinct approaches to solving reinforcement learning problems, namely, searching in value function space and searching in policy space. Temporal difference methods and evolutionary algorithms are well-known examples of these approaches. Kaelbling, Littman and Moore recently provided an informative survey of temporal difference methods. This article focuses on the application of evolutionary algorithms to the reinforcement learning problem, emphasizing alternative policy representations, credit assignment methods, and problem-specific genetic operators. Strengths and weaknesses of the evolutionary approach to reinforcement learning are presented, along with a survey of representative applications.

Calendar of upcoming AI meetings, conferences, and other events.

The last few years have seen a surge in interest in the use of techniques from Bayesian decision theory to address problems in AI. Decision theory provides a normative framework for representing and reasoning about decision problems under uncertainty. Within the context of this framework, researchers in uncertainty in the AI community have been developing computational techniques for building rational agents and representations suited to engineering their knowledge bases. This special issue reviews recent research in Bayesian problem-solving techniques. The articles cover the topics of inference in Bayesian networks, decision-theoretic planning, and qualitative decision theory. Here, I provide a brief introduction to Bayesian networks and then cover applications of Bayesian problem-solving techniques, knowledge-based model construction and structured representations, and the learning of graphic probability models.