Abstract. This paper presents an approach of case mining to automatically discover case bases from large datasets in order to improve both the speed and the quality of case based r...
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new a...