The aim of this position paper is to stress the need for considering an event-oriented perspective when modelling problem situations in Textual Case-Based Reasoning (TCBR). Therefore, we give several examples where events appear naturally on the text and can serve as basis for constructing features for cases. We also argue that the current, single-sided, object-oriented perspective is due to th...

In this paper we present a novel methodology for textual case-based reasoning. This technique is unique in that it automatically discovers case and similarity knowledge, is language independent, is scaleable and facilitates semantic similarity between cases to be carried out inherently without the need for domain knowledge. In addition it provides an insight into the thematical content of the c...

Textual-case based reasoning (TCBR) systems where the problem and solution are in free text form are hard to evaluate. In the absence of class information, domain experts are needed to evaluate solution quality, and provide relevance information. This approach is costly and time consuming. We propose three measures that can be used to compare alternate TCBR system configurations, in the absence...

In this paper, we argue that syntactic analysis is most likely to improve retrieval accuracy in textual case-based reasoning when the task of the system is well-defined and the relationship between queries and cases is specified in terms of this task. We illustrate this claim with an implemented system for syntax-based answer-indexed retrieval, RealDialog.

A walk on sunset boulevard can teach us about transcendental functions associated to Feynman diagrams. On this guided tour we will see multiple polylogarithms, differential equations and elliptic curves. A highlight of the tour will be the generalisation of the polylogarithms to the elliptic setting and the all-order solution for the sunset integral in the equal mass case.

This is the first paper on textual case-based reasoning to employ collective classification, a methodology for simultaneously classifying related cases that has consistently attained higher accuracies than standard classification approaches when cases are related. Thus far, case-based classifiers have not been examined for their use in collective classification. We introduce Case-Based Collecti...

Given a set S of n points in the unit square $[ 0,1 ]^d $, an optimal traveling salesman tour of S is a tour of S that is of minimum length. A worst-case point set for the traveling salesman problem in the unit square is a point set $S^{( n )} $ whose optimal traveling salesman tour achieves the maximum possible length among all point sets $S \subset [ 0,1 ]^d $, where $| S | = n$. An open prob...