Goto

Collaborating Authors

 Europe


Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis

Journal of Artificial Intelligence Research

We present a novel approach to the automatic acquisition of taxonomies or concept hierarchies from a text corpus. The approach is based on Formal Concept Analysis (FCA), a method mainly used for the analysis of data, i.e. for investigating and processing explicitly given information. We follow Harris' distributional hypothesis and model the context of a certain term as a vector representing syntactic dependencies which are automatically acquired from the text corpus with a linguistic parser. On the basis of this context information, FCA produces a lattice that we convert into a special kind of partial order constituting a concept hierarchy. The approach is evaluated by comparing the resulting concept hierarchies with hand-crafted taxonomies for two domains: tourism and finance. We also directly compare our approach with hierarchical agglomerative clustering as well as with Bi-Section-KMeans as an instance of a divisive clustering algorithm. Furthermore, we investigate the impact of using different measures weighting the contribution of each attribute as well as of applying a particular smoothing technique to cope with data sparseness.


Perseus: Randomized Point-based Value Iteration for POMDPs

Journal of Artificial Intelligence Research

Partially observable Markov decision processes (POMDPs) form an attractive and principled framework for agent planning under uncertainty. Point-based approximate techniques for POMDPs compute a policy based on a finite set of points collected in advance from the agent's belief space. We present a randomized point-based value iteration algorithm called Perseus. The algorithm performs approximate value backup stages, ensuring that in each backup stage the value of each point in the belief set is improved; the key observation is that a single backup may improve the value of many belief points. Contrary to other point-based methods, Perseus backs up only a (randomly selected) subset of points in the belief set, sufficient for improving the value of each belief point in the set. We show how the same idea can be extended to dealing with continuous action spaces. Experimental results show the potential of Perseus in large scale POMDP problems.


Learning Content Selection Rules for Generating Object Descriptions in Dialogue

Journal of Artificial Intelligence Research

A fundamental requirement of any task-oriented dialogue system is the ability to generate object descriptions that refer to objects in the task domain. The subproblem of content selection for object descriptions in task-oriented dialogue has been the focus of much previous work and a large number of models have been proposed. In this paper, we use the annotated COCONUT corpus of task-oriented design dialogues to develop feature sets based on Dale and Reiter's (1995) incremental model, Brennan and Clark's (1996) conceptual pact model, and Jordan's (2000b) intentional influences model, and use these feature sets in a machine learning experiment to automatically learn a model of content selection for object descriptions. Since Dale and Reiter's model requires a representation of discourse structure, the corpus annotations are used to derive a representation based on Grosz and Sidner's (1986) theory of the intentional structure of discourse, as well as two very simple representations of discourse structure based purely on recency. We then apply the rule-induction program RIPPER to train and test the content selection component of an object description generator on a set of 393 object descriptions from the corpus. To our knowledge, this is the first reported experiment of a trainable content selection component for object description generation in dialogue. Three separate content selection models that are based on the three theoretical models, all independently achieve accuracies significantly above the majority class baseline (17%) on unseen test data, with the intentional influences model (42.4%) performing significantly better than either the incremental model (30.4%) or the conceptual pact model (28.9%). But the best performing models combine all the feature sets, achieving accuracies near 60%. Surprisingly, a simple recency-based representation of discourse structure does as well as one based on intentional structure. To our knowledge, this is also the first empirical comparison of a representation of Grosz and Sidner's model of discourse structure with a simpler model for any generation task.


Solving Set Constraint Satisfaction Problems using ROBDDs

Journal of Artificial Intelligence Research

In this paper we present a new approach to modeling finite set domain constraint problems using Reduced Ordered Binary Decision Diagrams (ROBDDs). We show that it is possible to construct an efficient set domain propagator which compactly represents many set domains and set constraints using ROBDDs. We demonstrate that the ROBDD-based approach provides unprecedented flexibility in modeling constraint satisfaction problems, leading to performance improvements. We also show that the ROBDD-based modeling approach can be extended to the modeling of integer and multiset constraint problems in a straightforward manner. Since domain propagation is not always practical, we also show how to incorporate less strict consistency notions into the ROBDD framework, such as set bounds, cardinality bounds and lexicographic bounds consistency. Finally, we present experimental results that demonstrate the ROBDD-based solver performs better than various more conventional constraint solvers on several standard set constraint problems.


Risk-Sensitive Reinforcement Learning Applied to Control under Constraints

Journal of Artificial Intelligence Research

In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with respect to a policy as the probability of entering such a state when the policy is pursued. We consider the problem of finding good policies whose risk is smaller than some user-specified threshold, and formalize it as a constrained MDP with two criteria. The first criterion corresponds to the value function originally given. We will show that the risk can be formulated as a second criterion function based on a cumulative return, whose definition is independent of the original value function. We present a model free, heuristic reinforcement learning algorithm that aims at finding good deterministic policies. It is based on weighting the original value function and the risk. The weight parameter is adapted in order to find a feasible solution for the constrained problem that has a good performance with respect to the value function. The algorithm was successfully applied to the control of a feed tank with stochastic inflows that lies upstream of a distillation column. This control task was originally formulated as an optimal control problem with chance constraints, and it was solved under certain assumptions on the model to obtain an optimal solution. The power of our learning algorithm is that it can be used even when some of these restrictive assumptions are relaxed.


Calendar of Events

AI Magazine

(EDOC 2005). Moscow State University, Russia, King's Email: patrick.hung@uoit.ca In cooperation with the American Association for Artificial Intelligence General Chairs The 19th International FLAIRS Conference (FLAIRS 2006) will be held May 11-13 Philip Chan, Debasis Mitra 2006, in Melbourne Beach, Florida, USA. Coast" (centered around NASA's Kennedy Space Center), and has easy access to Florida Institute of Technology Orlando and the Disney World attractions. Submission of papers for presentation at the conference is now invited.


Description Logics and Planning

AI Magazine

This article surveys previous work on combining planning techniques with expressive representations of knowledge in description logics to reason about tasks, plans, and goals. Description logics can reason about the logical definition of a class and automatically infer class-subclass subsumption relations as well as classify instances into classes based on their definitions. Descriptions of actions, plans, and goals can be exploited during plan generation, plan recognition, or plan evaluation. These techniques should be of interest to planning practitioners working on knowledge-rich application domains. Another emerging use of these techniques is the semantic web, where current ontology languages based on description logics need to be extended to reason about goals and capabilities for web services and agents.


Embodied Communication in Humans and Machines

AI Magazine

Developed by the Bielefeld AI group, Max can imitate human gestures and exhibit humanlike synthetic speech and coverbal gesture while constructing an airplane from a construction kit in cooperation with a human partner. In an invitational bodily communication could be captured communication. Does a body need flesh highly acclaimed speakers from various Italy) who presented ongoing research and blood?, linguist Jens Allwood disciplines presented their perspectives on mode-specific lexicons, (University of Göteborg, Sweden) pertaining to conceptual issues such as "gestionaries," "gazeionaries" asked, or might wire and metal be of embodiment; the phylo-and and "touchionaries," as an equivalent sufficient, or a simulation in virtual ontogenesis of communication; bodily of dictionaries in spoken language. When apes can learn to control gestures; understanding and communicating How these ideas could be integrated a robot arm through an electrode intentions, emotions, in human-machine interaction was implanted in their brains, philosopher and symbols; and the role of bodily addressed by computer scientist Joëlle Proust (Institut Jean-action in language and speech. The Catherine Pelachaud (Université de Nicod, Paris, France) added, then talks were centered around the two Paris 8, Montreuil, France).


RoboCup 2004 Competitions and Symposium: A Small Kick for Robots, a Giant Score for Science

AI Magazine

RoboCup is an international initiative with the main goals of fostering research and education in artificial intelligence and robotics, as well as of promoting science and technology to world citizens. The idea behind RoboCup is to provide a standard problem for which a wide range of technologies can be integrated and examined, as well as being used for project-oriented education, and to organize annual events open to the general public, at which different solutions to the problem are compared. The eighth annual RoboCup -- RoboCup 2004 -- was held in Lisbon, Portugal, from 27 June to 5 July. In this article, a general description of RoboCup 2004 is presented, including summaries concerning teams, participants, distribution into leagues, main research advances, as well as detailed descriptions for each league.


Intelligent Technology for an Aging Population: The Use of AI to Assist Elders with Cognitive Impairment

AI Magazine

Today, approximately 10 percent of the world's population is over the age of 60; by 2050 this proportion will have more than doubled. Moreover, the greatest rate of increase is amongst the "oldest old," people aged 85 and over. While many older adults remain healthy and productive, overall this segment of the population is subject to physical and cognitive impairment at higher rates than younger people. This article surveys new technologies that incorporate artificial intelligence techniques to support older adults and help them cope with the changes of aging, in particular with cognitive decline.