Mining frequent itemsets and association rules is a popular and well researched approach for discovering interesting relationships between variables in large databases. The R package arules presented in this paper provides a basic infrastructure for creating and manipulating input data sets and...

The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving...

We introduce a generic simulation framework suitable for agent-based simulations featuring the support of heterogeneous agents, hierarchical scheduling, and flexible specification of design parameters. One key aspect of this framework is the design specification: we use a format based on the...

Clustering streams of continuously arriving data has become an important application of data mining in recent years and efficient algorithms have been proposed by several researchers. However, clustering alone neglects the fact that data in a data stream is not only characterized by the...

In this paper a new class of tests for parameter stability, the moving-estimates (ME) test, is proposed. It is shown that in the standard situation the ME test asymptotically equivalent to the maximal likelihood ratio test under the alternative of a temporary parameter shift. It is also shown...

Understanding the determinants of aggregated corporate default probabilities (PDs) has attracted substantial research interest over the past decades. This study addresses two major difficulties in understanding the determinants of aggregate PDs: model uncertainty and multicollinearity among the...