In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Database appliances offer fully integrated hardware, storage, operating system, database, and related software in a single package. Database appliances have a relatively long hist...
Background: Visualization of DNA microarray data in two or three dimensional spaces is an important exploratory analysis step in order to detect quality issues or to generate new ...
Christoph Bartenhagen, Hans-Ulrich Klein, Christia...
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
An important problem that arises during the data mining process in many new emerging application domains is mining data with temporal dependencies. One such application domain is a...