Rough group, rough subgroup and their properties

Authors:
Duoqian Miao;Suqing Han;Daoguo Li;Lijun Sun
Affiliations:
Department of Computer Science and Technology, Tongji University, Shanghai, P.R.China;Institute of Automation, Chinese Academy of Sciences, Beijing, P.R.China;Department of Computer Science and Technology, Tongji University, Shanghai, P.R.China;Department of Computer Science and Technology, Tongji University, Shanghai, P.R.China
Venue:
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Year:
2005

Citing 4
Cited 3

Rough sets through algebraic logic

Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
On Generalizing Pawlak Approximation Operators

RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Algebras of Approximating Regions

Fundamenta Informaticae - Qualitative Spatial Reasoning

The impact of rough set research in China: in commemoration of professor Zdzisław Pawlak

Transactions on rough sets VI
Rough logic and its reasoning

Transactions on computational science II
Soft Nearness Approximation Spaces

Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of rough sets is an extension of the set theory, for the study of intelligent systems characterized by insufficient and incomplete information. Since proposed by Pawlak, rough sets have evoked a lot of research. Theoretic study has included algebra aspect of rough sets. In paper [1] the concept of rough group and rough subgroup was introduced, but with some deficiencies remaining. In this paper, we intend to make up for these shortages, improve definitions of rough group and rough subgroup, and prove their new properties.