Personal information agents have emerged in the last decade to help users to cope with the increasing amount of information available on the Internet. These agents are intelligent assistants that perform several information-related tasks such as finding, filtering and monitoring relevant information on behalf of users or communities of users. In order to provide personalized assistance, personal agents rely on representations of user information interests and preferences contained in user profiles. In this paper, we present a summary of the state-of-the-art in user profiling in the context of intelligent information agents. Existing approaches and lines of research in the main dimensions of user profiling, such as acquisition, learning, adaptation and evaluation, are discussed.

This article presents a comprehensive overview of methods and techniques used for the evaluation of user-adaptive systems. It describes the methodologies derived both from the evaluation of human–computer interaction systems and from information retrieval and information filtering systems by giving examples of the application of these methodologies in the user-adaptive systems. The state of the art and the main results in the evaluation of these systems are reported. In particular, empirical evaluation and layered approaches are discussed in detail. Finally, focus on less explored methodologies, such as qualitative approaches (e.g. Grounded Theory), is proposed.

We are delighted to present this special issue of The Knowledge Engineering Review, as it marks a significant accomplishment of the case-based reasoning (CBR) community. Its 19 commentaries, written by 41 authors, represent a compendium on the state-of-the-art in CBR. These evolved from a 2003 workshop that was held at Waiheke Island and Queenstown, New Zealand and chaired by Alec Holt and Ian Watson. The workshop's delegates identified the primary topics of CBR research and application, selected representative influential publications for each topic, and were encouraged to co-author commentaries on each topic with other CBR experts who were unable to attend. These collaborations produced the articles you now see. While several reviews exist on CBR (e.g. Marir & Watson, 1994; López de Mántaras & Plaza, 1997; Lenz et al., 1998), few have been published recently or have similar historical and subject breadth.

This paper introduces the Special Issue of The Knowledge Engineering Review devoted to reports arising from selected Technical Forum Groups at the First and Second AgentLink III Agent Technical Forums, held in 2004 and 2005.

Considering the great number of agent-oriented methodologies that can be found in the literature, and the fact that each one defines its own concepts and system structure, one of the main challenges in agent-oriented software engineering (AOSE) research is how to make these methodologies interoperable. By defining concepts used in a specific domain in a non-ambiguous way, meta-modelling may represent a step towards such interoperability. Consequently the main objective of the AOSE TFG (Technical Forum Group) is to establish a strategy for identifying a common meta-model that could be widely adopted by the AOSE community. This paper sums up the approach used by this TFG which consists of (i) studying and comparing the meta-models related to some existing methodologies (ADELFE, Gaia, INGENIAS, PASSI, RICA and Tropos) in order to find commonalities and (ii) giving a clear and basic definition for the core concepts used in multi-agent systems for relating and positioning them in a unified MAS meta-model. The first proposal, set up by the working group, for this unified meta-model then concludes this paper.

It is a well-known fact that the data mining process can generate many hundreds and often thousands of patterns from data. The task for the data miner then becomes one of determining the most useful patterns from those that are trivial or are already well known to the organization. It is therefore necessary to filter out those patterns through the use of some measure of the patterns actual worth. This article presents a review of the available literature on the various measures devised for evaluating and ranking the discovered patterns produced by the data mining process. These so-called interestingness measures are generally divided into two categories: objective measures based on the statistical strengths or properties of the discovered patterns and subjective measures that are derived from the user's beliefs or expectations of their particular problem domain. We evaluate the strengths and weaknesses of the various interestingness measures with respect to the level of user integration within the discovery process.

A basic observation is that case-based reasoning has roots in different disciplines: cognitive science, knowledge representation and processing, machine learning and mathematics. As a consequence, there are foundational aspects from each of these areas. We briefly discuss them and comment on the relations between these types of foundations.

The terminology of Machine Learning and Data Mining methods does not always allow a simple match between practical problems and methods. While some problems look similar from the user's point of view, but require different methods to be solved, some others look very different, yet they can be solved by applying the same methods and tools. Choosing appropriate Machine Learning methods for problem solving in practice is therefore largely a matter of experience and it is not realistic to expect a simple look-up table with matches between problems and methods. However, some guidelines can be given and a collection that summarizes other people's experience can also be helpful. A small number of definitions characterize the tasks that are performed by a large proportion of methods. Most of the variation in methods is concerned with differences in data types and algorithmic aspects of methods. In this paper, we summarize the main task types and illustrate how a wide variety of practical problems are formulated in terms of these tasks. The match between problems and tasks is illustrated with a collection of example applications with the aim of helping to express new practical problems as Machine Learning tasks. Some tasks can be decomposed into subtasks, allowing a wider variety of matches between practical problems and (combinations of) methods. We review the main principles for choosing between alternatives and illustrate this with a large collection of applications. We believe that this provides some guidelines.

The scope of the Technical Forum Group (TFG) on Agents in Bioinformatics (BIOAGENTS) was to inspire collaboration between the agent and bioinformatics communities with the aim of creating an opportunity to propose a different (agent-based) approach to the development of computational frameworks both for data analysis in bioinformatics and for system modelling in computational biology. During the day, the participants examined the future of research on agents in bioinformatics primarily through 12 invited talks selected to cover the most relevant topics. From the discussions, it became clear that there are many perspectives to the field, ranging from bio-conceptual languages for agent-based simulation, to the definition of bio-ontology-based declarative languages for use by information agents, and to the use of Grid agents, each of which requires further exploration. The interactions between participants encouraged the development of applications that describe a way of creating agent-based simulation models of biological systems, starting from an hypothesis and inferring new knowledge (or relations) by mining and analysing the huge amount of public biological data. In this report we summarize and reflect on the presentations and discussions.

In this paper we survey the basics of reinforcement learning and (evolutionary) game theory, applied to the field of multi-agent systems. This paper contains three parts. We start with an overview on the fundamentals of reinforcement learning. Next we summarize the most important aspects of evolutionary game theory. Finally, we discuss the state-of-the-art of multi-agent reinforcement learning and the mathematical connection with evolutionary game theory.

A case in case-based reasoning is a contextualized piece of experience, which can be represented in various forms. Traditional approaches can be classified into three main categories: feature vector representations, structured representations, and textual representations. More sophisticated approaches make use of hierarchical representations or generalized cases. For particular tasks such as design and planning highly specific representations have been developed.

There is a growing awareness in the multiagent systems research community that the environment plays a prominent role in multiagent systems. Originating from research on behavior-based agent systems and situated multiagent systems, the importance of the environment is now gradually being accepted in the multiagent system community in general. In this paper, we put forward the environment as a first-order abstraction in multiagent systems. This position is motivated by the fact that several aspects of multiagent systems that conceptually do not belong to agents themselves should not be assigned to, or hosted inside the agents. Examples are infrastructure for communication, the topology of a spatial domain or support for the action model. These and other aspects should be considered explicitly. The environment is the natural candidate to encapsulate these aspects. We elaborate on environment engineering, and we illustrate how the environment plays a central role in a real-world multiagent system application.

Case-based reasoning (CBR) is an approach to problem solving that emphasizes the role of prior experience during future problem solving (i.e., new problems are solved by reusing and if necessary adapting the solutions to similar problems that were solved in the past). It has enjoyed considerable success in a wide variety of problem solving tasks and domains. Following a brief overview of the traditional problem-solving cycle in CBR, we examine the cognitive science foundations of CBR and its relationship to analogical reasoning. We then review a representative selection of CBR research in the past few decades on aspects of retrieval, reuse, revision and retention.

This commentary succinctly summarizes work in integrating case-based reasoning (CBR) with other reasoning modalities. Including CBR in mixed mode approaches promotes synergies and benefits beyond those achievable using CBR or other individual reasoning approaches alone. Numerous examples of hybrid systems, with pointers to significant references, are provided.

Resource allocation in multiagent systems is a central research issue in the AgentLink community. The aim of the Technical Forum Group on Multiagent Resource Allocation (TFG-MARA) is to provide a venue for the exchange of ideas in this area and to foster collaboration between different research groups. In this article we report on the first meeting of TFG-MARA, which was held as part of the Second AgentLink III Technical Forum in Ljubljana.

PROMAS (Programming Multi-Agent Systems) is an AgentLink technical forum that aims to bring together the researchers and practitioners from both academia and industry to discuss the problems related to the development of multi-agent systems and to evaluate the existing proposals and results. The specific focus of this technical forum is on agent-oriented programming languages and tools that can effectively and efficiently support the implementation of multi-agent systems. This paper provides an overview of the main contributions and conclusions derived from the first two editions of PROMAS technical forum.