ICCBR is the annual meeting of the CBR community and the leading conference on this topic. Started in 1993 as the European Conference on CBR and 1995 as ICCBR, the two conferences alternated biennially until their merger in 2010. The main conference track featured 19 research paper presentations, 16 posters, and two invited speakers. The papers and posters reflected the state of the art of case-based reasoning, dealing both with open problems at the core of casebased reasoning (especially in similarity assessment, case adaptation, and case-based maintenance), as well as trending applications of CBR. Minor, Goethe University, Germany, and Emmanuel The first invited speaker, Tony Veale from University Nauer, LORIA, France.

We propose an approach that allows a robot to evaluate its trustworthiness and adapt its behavior accordingly. The The addition of a robot to a team can be difficult if trust estimate, which we refer to as an inverse trust estimate, the human teammates do not trust the robot. This differs from traditional computational trust metrics in that it can result in underutilization or disuse of the robot, measures how much trust other agents have in the robot rather even if the robot has skills or abilities that are necessary than how much trust the robot has in other agents. Since the to achieve team goals or reduce risk. To robot can only use observable information and not information help a robot integrate itself with a human team, we that is internal to the teammates' reasoning, the inverse present an agent algorithm that allows a robot to estimate trust estimate relies on evaluating the standard interactions its trustworthiness and adapt its behavior accordingly.

While most natural language understanding systems rely on a pipeline-based architecture, certain human text interpretation methods are based on a cyclic process between the whole text and its parts: the hermeneutic circle. In the task of automatically identifying characters and their narrative roles, we propose a feedback-loop-based approach where the output of later modules of the pipeline is fed back to earlier ones. We analyze this approach using a corpus of 21 Russian folktales. Initial results show that feeding back high-level narrative information improves the performance of some NLP tasks.

We present a computational framework for chord invention based on a cognitive-theoretic perspective on conceptual blending. The framework builds on algebraic specifications, and solves two musicological problems. It automatically finds transitions between chord progressions of different keys or idioms, and it substitutes chords in a chord progression by other chords of a similar function, as a means to create novel variations. The approach is demonstrated with several examples where jazz cadences are invented by blending chords in cadences from earlier idioms, and where novel chord progressions are generated by inventing transition chords.

We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their nonparametric generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the L1-distance between estimated power spectral densities (PSDs) as a measure of dissimilarity, are analyzed. The first algorithm, termed nearest neighbor process clustering (NNPC), to the best of our knowledge, is new and relies on partitioning the nearest neighbor graph of the observations via spectral clustering. The second algorithm, simply referred to as k-means (KM), consists of a single k-means iteration with farthest point initialization and was considered before in the literature, albeit with a different measure of dissimilarity and with asymptotic performance results only. We show that both NNPC and KM succeed with high probability under noise and even when the generative process PSDs overlap significantly, all provided that the observation length is sufficiently large. Our results quantify the tradeoff between the overlap of the generative process PSDs, the noise variance, and the observation length. Finally, we present numerical performance results for synthetic and real data.

The performance of trust models highly depend on the characteristics of the environments where they are applied. Thus, it becomes challenging to choose a suitable trust model for a given e-marketplace environment, especially when ground truth about the agent (buyer and seller) behavior is unknown (called unknown environment). We propose a case-based reasoning framework to choose suitable trust models for unknown environments, based on the intuition that if a trust model performs well in one environment, it will do so in another similar environment. Firstly, we build a case base with a number of simulated environments (with known ground truth) along with the trust models most suitable for each of them. Given an unknown environment, case-based retrieval algorithms retrieve the most similar case(s), and the trust model of the most similar case(s) is chosen as the most suitable model for the unknown environment. Evaluation results confirm the effectiveness of our framework in choosing suitable trust models for different e-marketplace environments.

We present the Bayesian Case Model (BCM), a general framework for Bayesian case-based reasoning (CBR) and prototype classification and clustering. BCM brings the intuitive power of CBR to a Bayesian generative framework. The BCM learns prototypes, the "quintessential" observations that best represent clusters in a dataset, by performing joint inference on cluster labels, prototypes and important features. Simultaneously, BCM pursues sparsity by learning subspaces, the sets of features that play important roles in the characterization of the prototypes. The prototype and subspace representation provides quantitative benefits in interpretability while preserving classification accuracy. Human subject experiments verify statistically significant improvements to participants' understanding when using explanations produced by BCM, compared to those given by prior art.

Buildings make a city’s landscape and are home to its people. The demand for smart buildings and housing is growing by the need for cities to make their buildings more efficient, green and livable. This emergent intelligence is underpinned by the use of Information and Communications Technology (ICT) linked by Pervasive Sensing and real-time data analytics. In a typical growth of smart buildings, Smart Campuses are going to be amazing community hubs which will be more sustainable, efficient and supportive of its inhabitants. In this regard, huge amount of useful and real-time generated data are being analyzed to help people and machines infer instant decisions in relation to energy efficiency. However, because of different terminologies used by different players, structural, representational and semantic heterogeneity constrain the interoperability between applications and misleads to adaptive and context-aware control behavior. In this paper, the focus is to alleviate the current problem by designing a semantic framework that represents the smart campus data and activities in an ontological model. Also, the framework is deepened by an Artificial Intelligent (AI) method using Weighted Case Based Reasoning (WCBR) for enabling context awareness. An illustration will be the elaboration of an adaptive and autonomous control of HVAC (Heating Ventilation and Air Conditioning) system, in this example the WCBR is discussed and case representation, case adaptation, and similarity computation are sketched in detail.

In either view, typical examples are closer where (only) positive examples ought to exceptional cases, case memory, analogy, to the prototype, and atypical examples and be.

In this short note, we discuss several aspects of "dimensions" and the related construct of "factors". We concentrate on those aspects that are relevant to articles in this special issue, especially those dealing with the analysis of the wild animal cases discussed in Berman and Hafner's 1993 ICAIL article. We review the basic ideas about dimensions, as used in HYPO, and point out differences with factors, as used in subsequent systems like CATO. Our goal is to correct certain misconceptions that have arisen over the years.