A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
We study the use of kernel subspace methods for learning low-dimensional representations for classification. We propose a kernel pooled local discriminant subspace method and com...
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...
One of the most successful applications of static analysis based bug finding tools is to search the source code for violations of system-specific rules. These rules may describe h...