计算优势关系粗糙集中近似集的快速算法<sup>*</sup>

doi:10.16451/j.cnki.issn1003-6059.201702007

Abstract
Figure/Table
References
Related Citation (15)

Download: PDF (740 KB) HTML (1 KB)
Export: BibTeX | EndNote (RIS)

Abstract The classical rough set can not process preference-ordered data. Dominance-based rough set (DRST) overcomes this drawback. The data processing efficiency can be improved by reducing the time of computing approximations. A fast algorithm for computing approximations is presented. The approximations are acquired quickly while objects and attributes being added simultaneously in DRST. The definitions of parameters related to approximations are revised in the proposed fast algorithm and thus approximations can be calculated by parameters as few as possible. Consequently, the calculation is simplified and accelerated, and the memory consumption is reduced as well. The experimental results demonstrate that the proposed algorithm is faster than other algorithms and it is especially efficient with larger data sizeand data label.

Key words： Rough Set Dominance-Based Rough Set Approximations Fast Algorithm

Received: 15 May 2016

ZTFLH:

TP 18

Fund:Supported by National Natural Science Foundation of China(No.61573292)

About author:: (WANG Shu, born in 1978, Ph.D. candidate. His research interests include rough set, granular computing and big data.)(LI Tianrui(Corresponding author), born in 1969, Ph.D., professor. His research interests include big data, cloud computing, rough set and granular computing.)

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors
	WANG Shu
	LI Tianrui

Cite this article:

WANG Shu,LI Tianrui. Fast Algorithm for Computing Approximations in
Dominance-Based Rough Set[J]. , 2017, 30(2): 162-170.

URL:

http://manu46.magtech.com.cn/Jweb_prai/EN/10.16451/j.cnki.issn1003-6059.201702007 OR http://manu46.magtech.com.cn/Jweb_prai/EN/Y2017/V30/I2/162

[1] PAWLAK Z. Rough Sets. International Journal of Computer and Information Sciences, 1982, 11(5): 341-356.
[2] 张文修,吴伟志,梁吉业,等.粗糙集理论与方法.北京:科学出版社, 2001.
(ZHANG W X, WU W Z, LIANG J Y, et al. Theories and Methodologies of Rough Sets. Beijing, China: Science Press, 2001.)
[3] CHEN H M, LI T R, QIAO S J, et al. A Rough Set Based Dynamic Maintenance Approach for Approximations in Coarsening and Refining Attribute Values. International Journal of Intelligent Systems, 2010, 25(10): 1005-1026.
[4] CHEN H M, LI T R, LUO C, et al. A Rough Set-Based Method for Updating Decision Rules on Attribute Values′ Coarsening and Refining. IEEE Transaction on Knowledge and Data Engineering, 2014, 26(12): 2886-2899.
[5] CHEN H M, LI T R, RUAN D, et al. A Rough-Set-Based Incremental Approach for Updating Approximations under Dynamic Maintenance Environments. IEEE Transaction on Knowledge and Data Enginee-ring, 2013, 25(2): 274-284.
[6] CHEN H M, LI T R, RUAN D. Maintenance of Approximations in Incomplete Ordered Decision Systems While Attribute Values Coar-sening or Refining. Knowledge-Based Systems, 2012, 31: 140-161.
[7] LUO C, LI T R, ZHANG J B, et al. An Improved Parallel Method for Computing Rough Set Approximations // Proc of the 8th International Conference on Intelligent Systems and Knowledge Enginee-ring. Berlin, Germany: Springer, 2014: 25-34.
[8] LUO C, LI T R, CHEN H M. Dynamic Maintenance of Approximations in Set-Valued Ordered Decision Systems under the Attribute Gene-ralization. Information Sciences, 2014, 257: 210-228.
[9] LUO C, LI T R, CHEN H M, et al. Fast Algorithms for Computing Rough Approximations in Set-Valued Decision Systems While Updating Criteria Values. Information Sciences, 2015, 299: 221-242.
[10] LUO C, LI T R, CHEN H M, et al. Incremental Approaches for Updating Approximations in Set-Valued Ordered Information Systems. Knowledge-Based Systems, 2013, 50: 218-233.
[11] ZHANG J B, WONG J S, PAN Y, et al. A Parallel Matrix-Based Method for Computing Approximations in Incomplete Information Systems. IEEE Transaction on Knowledge and Data Engineering, 2015, 27(2): 326-339.
[12] ZHANG J B, LI T R, RUAN D, et al. A Parallel Method for Computing Rough Set Approximations. Information Sciences, 2012, 194: 209-223.
[13] GRECO S, MATARAZZO B, SLOWINSKI R. Rough Approximation by Dominance Relations. International Journal of Intelligent Systems, 2002, 17(2): 153-171.
[14] 李少勇.有序决策系统的知识更新理论及其高效算法.博士学位论文.成都:西南交通大学, 2014.
(LI S Y. Approaches and Algorithms for Efficiently Updating Knowledge in Preference-Ordered Decision Systems. Ph.D Dissertation. Chengdu, China: Southwest Jiaotong University, 2014.)
[15] LI S Y, LI T R, LIU D. Dynamic Maintenance of Approximations in Dominance-Based Rough Set Approach under the Variation of the Object Set. International Journal of Intelligent Systems, 2013, 28(8): 729-751.
[16] LI S Y, LI T R, LIU D. Incremental Updating Approximations in Dominance-Based Rough Sets Approach under the Variation of the Attribute Set. Knowledge-Based Systems, 2013, 40: 17-26.
[17] CHEN H M, LI T R, LUO C, et al. A Decision-Theoretic Rough Set Approach for Dynamic Data Mining. IEEE Transaction on Fuzzy Systems, 2015, 23(6): 1958-1970.

[18] KOTLOWSKI W, DEMBCZYN′SKI K, GRECO S, et al. Stochastic Dominance-Based Rough Set Model for Ordinal Classification. Information Sciences, 2008, 178(21): 4019-4037.