-
Optimal granularity selection based on minimum cost of extension domain change
- LI Min, YANG Ya-feng, LEI Yu, LI Li-hong
-
JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2021, 56(2):
17-27.
doi:10.6040/j.issn.1671-9352.0.2020.236
-
Abstract
(
765 )
PDF (881KB)
(
257
)
Save
-
References |
Related Articles |
Metrics
Aiming at the problem that the cost of dynamic change of decision domain is seldom involved in the current optimal granularity selection algorithm, the extension set method is introduced, and the optimal granularity selection model based on the minimum cost of change of extension domain is proposed by combining the three-way decision. Firstly, the index grade discretization data table is determined by extension evaluation method, and the weight is used as the particle to carry out granulation, and the granular space is constructed by using binary relation crossover operator. Secondly, three domains are divided by fusing three decisions, and five domains of extension set are determined based on the dynamic changes of the three domains. Then, the measurement method of extension domain change is studied, the cost matrix is constructed, and the optimal granular layer is determined by the minimum cost of extension domain change. The model considers both static and dynamic characteristics comprehensively, and provides a new way to choose the optimal granularity. Finally, taking the data of water resources carrying capacity in Heilongjiang Province as an example, the validity of the model is verified, and the sensitivity analysis is carried out by using classification and regression trees. The results show that the model has good generalization.
