(F,ε)-parallel reducts in a series of decision subsystems

3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice

Volumn 2, Issue , 2010, Pages 372-376

  Deng, Dayong ^a  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

Author keywords

(F, ) parallel reducts; Dynamic reducts; Parallel reducts; Pawlak reducts; Rough sets

Indexed keywords

DECISION SUBSYSTEM; DECISION SYSTEMS; REDUCTS; ROUGH SET;

OPTIMIZATION;

ROUGH SET THEORY;

EID: 77956434756     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSO.2010.174     Document Type: Conference Paper

References (16)

1. Z. Pawlak, Rough Sets-Theoretical Aspect of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, 1991.
2. G.J. Bazan, A Comparison of Dynamic Non-dynamic Rough Set Methods for Extracting Laws from Decision Tables. In: L. Polkowski and A. Skowron (eds.), Rough Sets in Knowledge Discovery 1: Methodology and Applications, Physica-Verlag, Heidelberg, 1998, pp. 321-365.
3. G.J. Bazan, H. S. Nguyen, S. H. Nguyen, P. Synak, and J. Wroblewski, Rough Set Algorithms in Classification Problem. In: L.Polkowski, S.Tsumoto, T.Y.Lin(eds), Rough Set Methods and Applications, Physica-Verlag, 2000, pp.49-88.
4. Q. Liu, Rough Sets and Rough Reasoning. Science Press (in Chinese), 2001.
5. G. Wang, Calculation Methods for Core Attributes of Decision Table. Chinese Journal of Computers (in Chinese), Vol.26, No.5, 2003, pp.611-615.
6. Z. Liu, An Incremental Arithmetic for the Smallest Reduction of Attributes. Acta Electronica Sinica (in Chinese), Vol.27, No.11, 1999, pp.96-98.
7. J. Wang and J. Wang, Reduction algorithms based on discernibility matrix: The order attributes method. Journal of Computer Science and Technology, Vol.16, No.6, 2001, pp. 489-504.
8. Z. Zheng, G. Wang, and Y. Wu, A Rough Set and Rule Tree Based Incremental Knowledge Acquisition Algorithm. In: Proceedings of 9th International Conference of Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2003, pp.122-129.
9. D. Deng and H. Huang, A New Discernibility Matrix and Function. In: Proceeding of First International Conference on Rough Sets and Knowledge Technology (RSKT2006), LNAI4062, 2006, pp.114-121.
10. M. Kryszkiewicz and H. Rybinski, Finding Reducts in Composed Information Systems. In: Proceedings of International Workshop on Rough Sets and Knowledge Discovery (RSKD93), 1993, pp.259-268.
11. D. Deng, Research on Data Reduction Based on Rough Sets and Extension of Rough Set Models (Doctor Dissertation). Beijing Jiaotong University, 2007.
12. D. Deng, H. Huang, and X. Li, Comparison of Various Types of Reductions in Inconsistent Decision Systems. Acta Electronica Sinica, vol.35, No.2, 2007, pp.252-255.
13. D. Deng, Attribute Reduction among Decision Tables by Voting. In: Proceedings of 2008 IEEE International Conference of Granular Computing, 2008, pp183-187.
14. D. Deng, J. Wang, and X. Li, Parallel Reducts in a Series of Decision Subsystems. In: Proceedings of the Second International Joint Conference on Computational Sciences and Optimization(CSO2009), Sanya,Hainan,China, 2009, pp377-380.
15. D. Deng. Comparison of Parallel Reducts and Dynamic Reducts in Theory. Computer Science(in Chinese), 36(8A), 2009, 176-178.
16. D.Deng. Parallel Reducts and Its Properties. Proceedings of 2009 IEEE International Conference on Granular Computing, 2009, 121-125.