DocumentCode
572935
Title
Algorithms and analyses of logical difference of graded lower and upper approximation operators
Author
Zhang, Xianyong ; Miao, Duoqian
Author_Institution
Dept. of Comput. Sci. & Technol., Tongji Univ., Shanghai, China
fYear
2012
fDate
24-26 Aug. 2012
Firstpage
855
Lastpage
858
Abstract
Grade serves as a fundamental quantitative index, and the graded rough set model is a basic model. Thus, this paper aims to investigate an original logical difference in the graded rough set model. According to the specific logical requirement on the grade index, the logical difference is put forward based on the graded lower and upper approximation operators; the new concept has the practical logical quantitative meaning. Then, both the macroscopic essence and microscopic fundamental structure are obtained for the new concept. For calculation, two algorithms, the conventional and microscopic algorithms are proposed and analyzed emphatically, and we conclude that the microscopic algorithm has more advantages in time and space complexity. Finally, the logical difference and its algorithms are both illustrated by an example.
Keywords
approximation theory; rough set theory; graded lower approximation operator; graded rough set model; graded upper approximation operator; logical difference; macroscopic essence; microscopic algorithm; microscopic fundamental structure; quantitative index; space complexity; time complexity; Approximation algorithms; Approximation methods; Complexity theory; Educational institutions; Indexes; Microscopy; approximation operator; artificial intelligence; graded rough set; rough set theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Processing (CSIP), 2012 International Conference on
Conference_Location
Xi´an, Shaanxi
Print_ISBN
978-1-4673-1410-7
Type
conf
DOI
10.1109/CSIP.2012.6308988
Filename
6308988
Link To Document