Name
Abstract | ||
|---|---|---|
We present a generalized indiscernibility reduction model(GIRM) and a concept of the granular structure in GIRM.We prove that GIRM is compatible with three typical reduction models.We present a generalized attribute reduction algorithm and a generalized positive region computing algorithm based on GIRM.We present acceleration policies on two generalized algorithms and fast positive region computing approaches for three typical reduction models. The efficiency of attribute reduction is one of the important challenges being faced in the field of Big Data processing. Although many quick attribute reduction algorithms have been proposed, they are tightly coupled with their corresponding indiscernibility relations, and it is difficult to extend specific acceleration policies to other reduction models. In this paper, we propose a generalized indiscernibility reduction model(GIRM) and a concept of the granular structure in GIRM, which is a quantitative measurement induced from multiple indiscernibility relations and which can be used to represent the computation cost of varied models. Then, we prove that our GIRM is compatible with three typical reduction models. Based on the proposed GIRM, we present a generalized attribute reduction algorithm and a generalized positive region computing algorithm. We perform a quantitative analysis of the computation complexities of two algorithms using the granular structure. For the generalized attribute reduction, we present systematic acceleration policies that can reduce the computational domain and optimize the computation of the positive region. Based on the granular structure, we propose acceleration policies for the computation of the generalized positive region, and we also propose fast positive region computation approaches for three typical reduction models. Experimental results for various datasets prove the efficiency of our acceleration policies in those three typical reduction models. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ins.2017.02.032 | Inf. Sci. |
Keywords | Field | DocType |
Generalized indiscernibility relation,Attribute reduction,Granular structure,Acceleration policy | Big data processing,Discrete mathematics,Algorithm,Acceleration,Artificial intelligence,Machine learning,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
397 | C | 0020-0255 |
Citations | PageRank | References |
6 | 0.40 | 39 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| jing fan | 1 | 264 | 46.24 |
| Yunliang Jiang | 2 | 134 | 22.20 |
| Yong Liu | 3 | 213 | 45.82 |