B. K. Tripathy
ABSTRACT
Approximations of classifications, introduced and studied by Grzymala Busse [4] is a notion different from the notion of approximations of sets (Pawlak [9]). In fact the equivalence classes of approximate classifications cannot be arbitrary sets. Busse [4] had established properties of approximations of classifications which were recently extended to necessary and sufficient type theorems by Tripathy et. al ([12]). Four types of covering based rough sets have been obtained as generalization of basic rough sets. Also another covering rough set from a topological point of view has been obtained (14, 15, 16, 17, 18, 19]. Attempts have been made in [13] to extend the above results to covering based rough sets. In this paper we carry out this study further by deriving results for all the five types of covering based rough sets. These results can be used to derive rules for information systems with domains of attributes values being covers instead of partitions.
- Bonikowski, Z., Bryniarski, E., Wybraniec, U.: Extensions and intensions in the rough set theory, Jour. of Information Sciences, 107 (1998), pp.149--167. Google Scholar
Digital Library
- Degang, C., Changzhong, W., Qinghua, H.: A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, Information Sciences, 177 (2007), pp.3500--3518. Google ScholarDigital Library
- Degang, C., Wenxiu, Z., Yeung, D., Tsang, E. C. C.: Rough Approximations on a complete completely distributive lattice with applications to generalized rough sets, Information Sciences, 176 (2006), pp.1829--1848. Google ScholarDigital Library
- Grzymala-Busse, J., "Knowledge acquisition under uncertainty - a rough set approach", Journal of Intelligent and Robotics Systems, 1(1988), pp. 3--16.Google ScholarCross Ref
- Novotny, M., Pawlak, Z.: Black Box Analysis and Rough Top Equality, Bull. Polish Acad. Sci. Math., 33, (1985), pp.105--113.Google Scholar
- Novotny, M., Pawlak, Z., "Characterization of Rough Top Equalities and Rough Bottom Equalities", Bulletin Polish Acad. Sci. Math., 33(1985), pp. 91--97.Google Scholar
- Novotny, M., Pawlak, Z., "On Rough Equalities", Polish Acad. Sci. Math., 33(1985), pp. 99--104.Google Scholar
- Pawlak, Z.: Rough Sets, Int. Jour. Inf. Comp. Sc. II (1982), pp. 341--356.Google ScholarCross Ref
- Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, (1991). Google ScholarDigital Library
- Pawlak, Z., Skowron, A.: Rough sets some extensions, Information Sciences, 177(1), (2007), pp.28--40.Google ScholarCross Ref
- Tripathy, B. K., Mohanty, D., Ojha, J.: On Rough Definability and Types of Approximation of Classification, IEEE-International conference, Thapper Engineering College, Patiala, March (2009), pp. 1254--59.Google Scholar
- Tripathy, B. K., Mohanty, D., Ojha, J.: On Rough Approximations of Classifications and Representation of Knowledge, Proc. 1st International Conference on Advanced Data Analysis, Business Analytics and Intelligence, IIM Ahmedabad, June (2009), pp. 125.Google Scholar
- Tripathy, B. K. and Panda, G. K.: On CB--Approximations of Classifications of Sets, Proc.22nd Int. conf. of Industrial, Engineering and other applications of Applied Intelligent Systems, IEA/AIE 2009, Tainan, Taiwan, June (2009), pp.777--786. Google ScholarDigital Library
- Zakowski, W.: Approximation in space (U, Π), Demonstratio Mathematica, 16 (1983), pp. 761--769.Google ScholarCross Ref
- Zhu, W., Wang, F. Y.: Reduction and Axiomization of Covering Generalized Rough sets, Information Sciences, 152, (2003), pp. 217--230. Google ScholarDigital Library
- Zhu, W., Wang, F. Y.: Relationships among Three Types of Covering Rough Sets, IEEE GrC 2006, May, (2006), pp. 43--48.Google ScholarCross Ref
- Zhu, W.: Basic Concepts in Covering-based Rough Sets, IEEE - Third International Conference on Natural Computation (ICNC 2007). Google ScholarDigital Library
- Zhu, W.: Topological Approaches to Covering Rough Sets, Information Sciences, 177, (2007), pp. 1499--1508. Google ScholarDigital Library
- Zhu, W.: On Three Types of Covering-Based Rough Sets, IEEE Transactions on Knowledge and Data Engineering, Volume 19(8), August 2007, pp. 1131--1143. Google ScholarDigital Library
- Zhu, W. and Wang, F. Y: A new type of covering Rough Set, In IEEE IS 2006, September (2006), pp. 444--449.Google ScholarCross Ref
- Zhu, W.: Properties of the Fourth Type of Covering--Based Rough Sets: In IEEE HIE 2006, April (2006). Google ScholarDigital Library
Index Terms
- On some properties of covering based approximations of classifications of sets
Recommendations
On Covering Based Approximations of Classifications of Sets
IEA/AIE '09: Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied IntelligenceApproximations of classifications, introduced and studied by Grzymala Busse [4], and approximations of sets are two different issues (Pawlak [9]) and the equivalence classes of approximate classifications can not be arbitrary sets. Busse [4] had ...
Approximations and reducts with covering generalized rough sets
The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should ...
On minimization of axiom sets characterizing covering-based approximation operators
Rough set theory was proposed by Pawlak to deal with the vagueness and granularity in information systems. The classical relation-based Pawlak rough set theory has been extended to covering-based generalized rough set theory. The rough set axiom system ...
Comments