Test costs and misclassification costs are two most important types in cost-sensitive learning. In decision systems with both costs, there is a tradeoff between them while building a classifier. Generally, with more attributes selected and more information available, the test cost increases, and the misclassification cost decreases. We shall deliberately select an attribute subset such that the...

In this section, we present the classic quick sort algorithm and compute the expected running time of the algorithm. We assume that the elements of the set are all distinct. Below is the randomized quick sort algorithm. Algorithm RandQuickSort(S) Choose a pivot element xi u.a.r from S = {x1, x2, · · · , xn} Split the set S into two subsets S1 = {xj |xj < xi} and S2 = {xj |xj > xi} by comparing ...

As is well known, attribute reduction is one of the basic concepts in rough set theory. In this paper, a new algorithm for computing equivalence classes based on segment quick sort is provided and its time complexity is cut down to O(|C||U|) compared with traditional algorithms. Then a method for computing object number of positive region without computing positive region is given. On this basi...

This paper describes in detail the bitonic sort algorithm,and implements the bitonic sort algorithm based on cuda architecture.At the same time,we conduct two effective optimization of implementation details according to the characteristics of the GPU,which greatly improve the efficiency. Finally,we survey the optimized Bitonic sort algorithm on the GPU with the speedup of quick sort algorithm ...

We investigate the notion of an association reduct. Association reducts represent data-based functional dependencies between the sets of attributes, where it is preferred that possibly smallest sets determine possibly largest sets. We compare the notions of an association reduct to other types of reducts previously studied within the theory of rough sets. We focus particularly on modeling inexa...

A (distributive) p-algebra is an algebra 〈L;∨,∧, ∗, 0, 1〉 whose reduct 〈L;∨,∧, 0, 1〉 is a bounded (distributive) lattice and whose unary operation ∗ is characterized by x ≤ a if and only if a ∧ x = 0. If L is a p-algebra, B(L) = { x ∈ L : x = x } and D(L) = { x ∈ L : x = 1 } then 〈B(L);∪,∧, 0, 1〉 is a Boolean algebra when a ∪ b is defined to be (a∗ ∧ b∗)∗, for any a, b ∈ B(L), D∗(L) = { x ∨ x∗ ...

Here we study the principal left k-radicals of a semiring with semilattice additive reduct and characterize semirings which are disjoint union via −→ transitive closure l ∞ relation −→l on S, given by for a, b ∈ ⇔ bn Sa some n N.

Rough Set theory, proposed by Pawlak in 1982, is a mathematical tool for classification and analysis of imprecise, uncertain, incomplete or vague information and knowledge. Using various concepts in RST, classification of objects in various classes is done by removing irrelevant and redundant data by using attribute reduction algorithm. Attribute reduction using Rough set theory is one of the k...

This paper highlights the prediction of learning disabilities (LD) in school-age children using rough set theory (RST) with an emphasis on application of data mining. In rough sets, data analysis start from a data table called an information system, which contains data about objects of interest, characterized in terms of attributes. These attributes consist of the properties of learning disabil...

Cloud environment is a complex system which includes the matching between computation resources and data resources. Efficient predicting services execution time is a key component of successful tasks scheduling and resource allocation in cloud computing environment. In this paper, we propose a framework for supporting knowledge discovery application running in cloud environment as well as a hol...