During the early stages of developing Case-Based Reasoning (CBR) systems the definition of similarity measures is challenging since this task requires to transfer implicit knowledge of domain experts into knowledge representations. While an entire CBR system is very explanatory, the similarity measure determines the ranking but do not necessarily show which features contribute to high (or low) rankings. In this paper we will present our work on opening the knowledge engineering process for similarity modelling. We will present how we transfer implicit knowledge from experts as well as a data-driven approach into case and similarity representations for CBR systems. The work present is a result of interdisciplinary research collaborations between AI and medical researchers developing e-Health applications. During this work, explainability and transparency of the development process is crucial to allow in-depth quality assurance of the by the domain experts.

This paper presents a case-based reasoning (CBR) application for discovering similar patients with non-specific musculoskeletal disorders (MSDs) and recommending treatment plans using previous experiences. From a medical perspective, MSD is a complex disorder as its cause is often bounded to a combination of physiological and psychological factors. Likewise, the features describing the condition and outcome measures vary throughout studies. However, healthcare professionals in the field work in an experience-based way, therefore we chose CBR as the core methodology for developing a decision support system for physiotherapists which would assist them in the process of their co-decision making and treatment planning. In this paper, we focus on case representation and similarity modeling for the non-specific MSD patient data as well as we conducted initial experiments on comparing patient profiles.

This paper presents a case-based reasoning (CBR) application for discovering similar patients with non-specific musculoskeletal disorders (MSDs) and recommending treatment plans using previous experiences. From a medical perspective, MSD is a complex disorder as its cause is often bounded to a combination of physiological and psychological factors. Likewise, the features describing the condition and outcome measures vary throughout studies. However, healthcare professionals in the field work in an experience-based way, therefore we chose CBR as the core methodology for developing a decision support system for physiotherapists which would assist them in the process of their co-decision making and treatment planning. In this paper, we focus on case representation and similarity modeling for the non-specific MSD patient data as well as we conducted initial experiments on comparing patient profiles.

Usually, a CBR process is composed of four steps, namely: retrieve (selection of one or several case(s) from the base); reuse (adaptation of the retrieved case(s) to solve the new problem); revise (presentation of the newly formed case to application domain experts and, as appropriate, corrections to it); and retain (addition of the revised case to the case base, if this addition is judged useful). CBR is an active field of ICCBR is not only an important venue for presenting research that is application-and theory-driven, and it CBRrelated research. It is also an important relates to both machine learning and knowledge representation. Generous funding from NTNU, the Norwegian Each day of the conference began with an invited Research Council, and our other sponsors allowed talk. On the first day, Henri Prade presented an introduction the conference to cover all the meals for the attendees to analogical proportions and analogical reasoning during the conference.

Badges are a common, and sometimes the only, method of incentivizing users to perform certain actions on on- line sites. However, due to many competing factors influencing user temporal dynamics, it is difficult to determine whether the badge had (or will have) the intended effect or not. In this paper, we introduce two complementary approaches for determining badge influence on users. In the first one, we cluster users’ temporal traces (represented with Poisson processes) and apply covariates (user features) to regularize results. In the second approach, we first classify users’ temporal traces with a novel statistical framework, and then we refine the classification results with a semi-supervised clustering of covariates. Outcomes obtained from an evaluation on synthetic datasets and experiments on two badges from a pop- ular Q&A platform confirm that it is possible to validate, characterize and to some extent predict users affected by the badge.

Background: Research results in artificial intelligence (AI) are criticized for not being reproducible. Objective: To quantify the state of reproducibility of empirical AI research using six reproducibility metrics measuring three different degrees of reproducibility. Hypotheses: 1) AI research is not documented well enough to reproduce the reported results. 2) Documentation practices have improved over time. Method: The literature is reviewed and a set of variables that should be documented to enable reproducibility are grouped into three factors: Experiment, Data and Method. The metrics describe how well the factors have been documented for a paper. A total of 400 research papers from the conference series IJCAI and AAAI have been surveyed using the metrics. Findings: None of the papers document all of the variables. The metrics show that between 20% and 30% of the variables for each factor are documented. One of the metrics show statistically significant increase over time while the others show no change. Interpretation: The reproducibility scores decrease with in- creased documentation requirements. Improvement over time is found. Conclusion: Both hypotheses are supported.

Brown clustering is an established technique, used in hundreds of computational linguistics papers each year, to group word types that have similar distributional information. It is unsupervised and can be used to create powerful word representations for machine learning. Despite its improbable success relative to more complex methods, few have investigated whether Brown clustering has really been applied optimally. In this paper, we present a subtle but profound generalisation of Brown clustering to improve the overall quality by decoupling the number of output classes from the computational active set size. Moreover, the generalisation permits a novel approach to feature selection from Brown clusters: We show that the standard approach of shearing the Brown clustering output tree at arbitrary bitlengths is lossy and that features should be chosen insead by rolling up Generalised Brown hierarchies. The generalisation and corresponding feature generation is more principled, challenging the way Brown clustering is currently understood and applied.

In this article we present DrillEdge -- a commercial and award winning software system that monitors oil-well drilling operations in order to reduce non-productive time (NPT). DrillEdge utilizes case-based reasoning with temporal representations on streaming real-time data, pattern matching and agent systems to predict problems and give advice on how to mitigate the problems. The methods utilized, the architecture, the GUI and development cost in addition to two case studies are documented.

In this article we present DrillEdge — a commercial and award winning software system that monitors oil-well drilling operations in order to reduce non-productive time (NPT). DrillEdge utilizes case-based reasoning with temporal representations on streaming real-time data, pattern matching and agent systems to predict problems and give advice on how to mitigate the problems. The methods utilized, the architecture, the GUI and development cost in addition to two case studies are documented.

We present an efficient random decision tree algorithm for case-based reasoning systems. We combine this algorithm with a simple similarity measure based on domain knowledge to create a stronger hybrid algorithm. This combination is based on our general approach for combining lazy and eager learning methods. We evaluate the resulting algorithms on a case base of patient records in a palliative care domain. Our hybrid algorithm consistently produces a lower average error than the base algorithms.