Variable Precision Rough Set Approximations in Concept Lattice
Abstract
The notions of variable precision rough set and concept lattice are can be shared by a basic notion, which is the definability of a set of objects based on a set of properties. The two theories of rough set and concept lattice can be compared, combined and applied to each other based on definability. Based on introducing the definitions of variable precision rough set and concept lattice, this paper shows that any extension of a concept in concept lattice is an equivalence class of variable precision rough set. After that, we present a definition of lower and upper approximations in concept lattice and generate the lower and upper approximations concept of concept lattice. Afterwards, we discuss the properties of the new lower and upper approximations. Finally, an example is given to show the validity of the properties that the lower and upper approximations have.
Keywords
Full Text:
PDFReferences
Pawlak, Z. (1982). Rough sets. International Journal of Computer and Information Sciences, 11, 341- 356.
Ziarko, W. (1993). Variable precision rough set model. Journal of Computer and System Sciences, 46, 39-59.
Zhang, WX, Ma, JM and Fan, SQ. (2007). Variable threshold concept lattices. Information Sciences, 177, 4883 -4892.
Belohlavek, R. (2007). A note on variable threshold concept lattices: Threshold-based operators are reducible to classical concept-forming operators. Information Sciences, 177, 3186 3191.
Qiu, GF. (2010). Approaches to reasoning in decision making based on variable threshold concept lattices. Systems Engineering-Theory and Practice, 30( 6), 1092 -1098.
Ganter, B. and Wille, R. (1999). Formal concept analysis: Mathematical foundations, Springer-Verlag, Berlin, Heidelberg.
Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In Ivan R (Ed.), Ordered Sets(pp. 445470). Reidel, Dordrecht-Boston.
Ganter, B. Stumme, G. and Wille, R. (2005). Formal concept analysis: Foundations and applications, Springer-Verlag, Berlin Heidelberg.
Oosthuizen, GD. 1994. Rough sets and concept lattices. In Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery (RSKD93), Springer-Verlag, London, 2431.
Saquer, J. and Deogun, JS. (2001). Concept approximations based on rough sets and similarity measures. International Journal of Applied Mathematics and Computer Science, 11(3), 655674.
Dntsch, I. and Gediga, G. (1997). Algebraic aspects of attribute dependencies in information systems. Fundamental Infromaticae, 29(12), 119133.
Yao, YY. 2004. A comparative study of formal concept analysis and rough set theory in data analysis. In Proceedings of Fourth International Conference on Rough Sets and Current Trends in Computing (RSCTC 2004), Uppsala, Sweden, June 15, pp. 5968.
Qi, JJ, Wei, L and Li, ZZ. 2005. A partitional view of concept lattice. In Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, August 31September 3, vol. 3, Regina, Canada, pp. 7483.
Kent, RE. (1996). Rough concept analysis: a synthesis of rough sets and formal concept analysis. Fundamental Infromaticae, 27(2), 169181.
Belohlavek, R. (2004). Concept lattices and order in fuzzy logic. Annals of Pure and Applied Logic, 128(13), 277298.
Fan, SQ, Zhang, WX and Xu, W. (2006). Fuzzy inference based on fuzzy concept lattice. Fuzzy Sets and Systems, 157(24), 31773187.
Ma, JM, Zhang, WX and Cai, S. 2006. Variable threshold concept lattice and dependence space. In Proceedings of the Third International Conference on Fuzzy Systems and Knowledge Discovery, Xian, China, September 2428, pp. 109118.
Mohanty, D. (2012). Rough set on concept lattice. Computer Engineering and Intelligent Systems, 3(8), 46-54.
Yao, YY. 2004. A comparative study of formal concept analysis and rough set theory in data analysis. In Proceedings of 3rd International Conference on Rough Sets and Current Trends in Computing (RSCT 2004), 59-68.
Yao, YY. 2004. Concept lattices in rough set theory. In Proceedings of 23rd International Meeting of the North American Fuzzy information Processing Society (NAFIPS 2004), 796-801.
Yao, YY and Chen, YH. 2004. Rough set approximations in formal concept analysis. Department of Computer Science.
Hu, K, Sui, Y, Lu, Y, Wang, J and Shi, C. 2001. Concept approximation in concept lattice. In Proceedings of 5th Pacific-Asia Conference, Conference on Knowledge Discovery and Data Mining, (PAKDD 2001), 167-173.
Yang, HF and Zhang, JF. (2007). Rough concept lattice and construction arithmetic. Computer Engineering and Applications, 43( 24), 172-175.
XU, HS and Zhang, RL. (2013). Application of improved variable precision rough set in concept lattice construction. Computer Science, 40(3), 271-275.
Qiu, GF, Zhang, ZX and Zhang, W. (2014). A survey for study on concept lattice theory via rough set. Fuzzy Systems and Mathematics, 28(1), 168-177.
Dai, SP, He, T and Xie, XM. (2008). Study on concept lattice and rough sets. Computer Engineering and Design, 29(6), 1423-1425.
Ding, WP, Wang, JD and Zhu, H. (2010). Research and application of dynamical classification model for ensemble learning based on approximation concept lattice of roughness. Computer Science, 37(7), 174-179.
Song, XX, Zhang, WX and Li, H. (2010). Construction and properties of variable threshold object-oriented concept lattices. Computer Science, 37(12), 197-201.
Li, JJ, Li, KD and Wu, YH. (2013). The approximation concept of concept lattices. Journal of Nanjing University ( Natural Science), 49(2), 244-249.
Davey, BA and Priestley, HA. (2002). Introduction to Lattices and Order (Second edition). Cambridge University Press.
Ganter, B. and Wille, R. (1999). Formal Concept Analysis: Mathematical Foundations, New York: Springer Verlag.
Hu, XG, Xue, F, Zhang, YH and Zhang, J. (2009). Attribute reduction methods of decision table based on concept lattice. Pattern Recognition and Artificial Intelligence, 22(4), 624-629.
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Journal of Progressive Research in Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright © 2016 Journal of Progressive Research in Mathematics. All rights reserved.
ISSN: 2395-0218.
For any help/support contact us at editorial@scitecresearch.com, jprmeditor@scitecresearch.com.