We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
An attribute-oriented rough set method for knowledgediscovery in databases is described. Themethodis based on information generalization, whichexaminesthe data at various levels o...
Ning Shan, Wojciech Ziarko, Howard J. Hamilton, Ni...
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Testing of database applications is of great importance. A significant issue in database application testing consists in the availability of representative data. In this paper we...
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...