The goals of this paper are twofold: we describe common features in data sets from motor vehicle insurance companies and we investigate a general strategy which exploits the knowledge of such features. The results of the strategy are a basis to develop insurance tariffs. The strategy is applied...

Today, most of the data in business applications is stored in relational databases. Relational database systems are so popular, because they offer solutions to many problems around data storage, such as efficiency, effectiveness, usability, security and multi-user support. To benefit from these...

Today, most of the data in business applications is stored in relational database systems or in data warehouses built on top of relational database systems. Often, for more data is available than can be processed by standard learning algorithms in reasonable time. This paper presents an...

Support Vector Machines (SVMs) have become a popular tool for learning with large amounts of high dimensional data. However, it may sometimes be preferable to learn incrementally from previousSVM results, as computing a SVM is very costly in terms of time and memory consumption or because the...

The paper brings together methods from two disciplines: machine learning theory and robust statistics. Robustness properties of machine learning methods based on convex risk minimization are investigated for the problem of pattern recognition. Assumptions are given for the existence of the...

The analysis of temporal data is an important issue of current research, because most real-world data either explicitly or implicitly contains some information about time. The key to successfully solving temporal learning tasks is to analyze the assumptions that can be made and prior knowledge...

Time series analysis is an important and complex problem in machine learning and statistics. Real-world applications can consist of very large and high dimensional time series data. Support Vector Machines (SVMs) are a popular tool for the analysis of such data sets. This paper presents some SVM...

The minimum number of misclassifications achievable with affine hyper_ planes on a given set of labeled points is a key quantity in both statistics and computational learning theory. However, determining this quantity exactly is essentially NP_hard_ cf_ Höfgen, Simon and van Horn (1995.) Hence,...

The best linear unbiased estimator BLUE (CXb) of a linear transform CX b in the general Gauss-Markov model (y, E (y) = X b Cov (y) =a2v) is the linear transform C BLUE (Xb) of the best linear unbiased estimator BLUE (Xb) of Xb. Similarly, for the ordinary least squares estimator OLSE (CXb) = C...