Paper Titles

Heuristic for Three Machines Flow Shop Scheduling Problem to Minimize the Weighted Mean Flow Time
p.714

3D Guidance Law with INS/IR Integration for Increasing Penetration Force
p.719

Analysis of Dump Truck Unloading Condition Based on ANSYS
p.724

The Use of Adaptive Algorithms on Smart Antenna Device
p.730

Model of Covering Rough Sets in the Machine Intelligence
p.735

A Combinatorial Classifier for Error-Data in Joining Processes with Diverse-Granular Computing
p.740

Multi-Response Surface Optimisation with Different Priorities for Ramp Process Parameter Design
p.744

Research on On-Line Surface Defect Detection for Steel Strip Based on Sparse Coding
p.749

Data Integrity Check and Repair in Design and Manufacture of Distributed Storage Network
p.753

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 548Model of Covering Rough Sets in the Machine...

Model of Covering Rough Sets in the Machine Intelligence

Article Preview

Abstract:

Rough set theory has been proposed by Pawlak as a useful tool for dealing with the vagueness and granularity in information systems. Classical rough set theory is based on equivalence relation. The covering rough sets are an improvement of Pawlak rough set to deal with complex practical problems which the latter one can not handle. This paper studies covering-based generalized rough sets. In this setting, we investigate common properties of classical lower and upper approximation operations hold for the covering-based lower and upper approximation operations and relationships among some type of covering rough sets.

You might also be interested in these eBooks

Material and Manufacturing Technology III

Info:

Periodical:

Advanced Materials Research (Volume 548)

Pages:

735-739

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.548.735

Citation:

Cite this paper

Online since:

July 2012

Authors:

Hong Mei Nie, Jia Qing Zhou

Keywords:

Covering, Granular Computing, Lower Approximation, Rough Set (RS), Upper Approximation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Z. Pawlak. Rough sets. Internat. J. Comput. Inform. Sci. 11, 1982, p.341–356.

[2] Z. Pawlak. Rough sets: Theoretical aspects of reasoning about dat. Kluwer Academic Publishers, Boston, (1991).

[3] Z. Bonikowski,E. Bryniaski,U. WybraniecSkardowska. Extensions and Intensions in The Rough Set Theory. Information Sciences, Vol. 107, 1998, pp.149-167.

DOI: 10.1016/s0020-0255(97)10046-9

[4] R. Slowinski, D. Vanderpooten. A generalized definition of rough approximations based on similarity. IEEE Trans. On Knowledge and Data Engineering 12(2), 2000, p.331–336.

DOI: 10.1109/69.842271

[5] E. Tsang, D. Cheng, J. Lee, D. Yeung. On the upper approximations of covering generalized rough sets. In Proc. 3rd International Conf. Machine Learning and Cybernetics, 2004, p.4200–4203.

DOI: 10.1109/icmlc.2004.1384576

[6] F. Zhu. On covering generalized rough sets. Master's thesis, The University of Arizona, Tucson, Arizona, USA, May, (2002).

[7] J. T. Yao , Y. Y. Yao. Induction of classification rules by granular computing. In Rough Sets and Current Trends in Computing, 2002, p.331–338.

DOI: 10.1007/3-540-45813-1_43

[8] L. A. Zadeh. Fuzzy sets. Information and Control, 8, 1965, p.338–353.

[9] L.A. Zadeh. The concept of a linguistic variable and its application to approximate reasoning-I. Information Sciences 8, 1975, p.199–249.

DOI: 10.1016/0020-0255(75)90036-5

[10] William Zhu , Fei-Yue Wang. Reduction and axiomization of covering generalized rough sets. Information Sciences 152, 2003, p.217–230.

DOI: 10.1016/s0020-0255(03)00056-2

[11] William Zhu, Fei-Yue Wang,. A new type of covering rough sets. In IEEE IS 2006, London, 4-6 September, 2006, p.444–449.

[12] William Zhu, Fei-Yue Wang. Relationships among three types of covering rough sets. In IEEE GrC, 2006, p.43–48.

DOI: 10.1109/grc.2006.1635755

[13] William Zhu, Fei-Yue Wang. Three types of covering rough sets. to appear in Transactions on Knowledge and Data Engineering, 19, 2007, p.1131–1144.

DOI: 10.1109/tkde.2007.1044

[14] William Zhu, Fei-Yue Wang. Properties of the First Type of Covering-Based Rough Sets. in ICDM 2006 Workshop on Foundations of Data Mining and Novel Techniques in High Dimensional Structural and Unstructured Data, Hongkong, China, 18-22 December, 2006, pp.407-411.

DOI: 10.1109/icdmw.2006.136

[15] William Zhu. Properties of the Second Type of Covering-Based Rough Sets. in ICWI 2006 Workshop on GrC & BI, Hongkong, China , 18-22 December, 2006, pp.494-497.

[16] William Zhu, Fei-Yue Wang. Properties of the Third Type of Covering-Based Rough Sets. in ICMLC 2007, Hong Kong, China , 19-22 August, 2007, pp.3746-3751.

[17] William Zhu. Properties of the Fourth Type of Covering-Based Rough Sets. in HIS 2006, AUT Technology Park, Auckland, New Zealand, 13-15 December, 2006, pp.43-43.

[18] Mingfen WU, Xianwei WU, Ting SHEN, Cungen CAO. A New Type of Covering Approximation Operators. International Conf. Electronic Computer Technology, 2009, pp.334-338.

DOI: 10.1109/icect.2009.42

[19] Jiao Liu and Zuhua Liao. The Sixth Type of Covering-Based Rough Sets. IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, VOLS 1 AND 2, 2008, pp.438-441.

DOI: 10.1109/grc.2008.4664650

[20] Hu Jun, Wang Guo-Yin, Hierarchical model of covering granular space, JOURNAL OF NANJ IN G UNIVERSITY (NA TURAL SCIENCES), Vol. 44 , No. 5, Sept, 2008, pp.551-558.