References

ON GRANULAR COMPUTING VIA COVERING: NEW DEFINITION AND RELATED COVERING ROUGH SET


[1] S. Dick, A. Schenker, W. Pedrycz and A. Kandel, Regranulation: A granular algorithm enabling communication between granular worlds, Information Sciences 177 (2007), 408-435.

[2] J. R. Hobbs, Granularity, in: Proc. of the 9th Int. Joint Conf. on Artificial Intelligence (1985), 432-435.

[3] T. Y. Lin, Granular computing, LNAI 2639 (2003), 16-24.

[4] T. Y. Lin, Generating concept hierarchies/networks: Mining additional semantics in relational data, Advances in Knowledge Discovery and Data Mining, in: Proc. of the 5th Pacific-Asia Conf., Lecture Notes on Artificial Intelligence 2035 (2001), 174-185.

[5] J. M. Ma, W. X. Zhang and T. J. Li, A covering model of granular computing, In: Proc. of the 2005 Int’l Conf. in Machine Learning and Cybernetics (2005), 1625-1630.

[6] J. M. Ma, W. X. Zhang, Y. Leung and X. X. Song, Granular computing and dual Galois connection, Information Sciences 177(23) (2007), 5365-5377.

[7] J. A. Pomykala, Approximation operations in approximation space, Bull. Pol. Acad. Sci. 35(9-10) (1987), 653-662.

[8] W. Pedrycz, Granular Computing: An Emerging Paradigm, Physica-Verlag, Heidelberg, 2001.

[9] Z. Pawlak, Rough sets, Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishers, Dordrecht, Boston, London, 1991.

[10] Z. Pawlak and A. Skowron, Rudiments of rough sets, Information Sciences 177 (2007), 3-27.

[11] Z. Pawlak, Rough sets, International Journal of Computer and Information Science 11 (1982), 341-356.

[12] Y. H. She and G. J. Wang, Covering model of granular computing, Journal of Software 21(11) (2010), 2782-2789.

[13] P. Wang, Computing with Words, John Wiley & Sons, Inc., 2011.

[14] Y. Y. Yao, A partition model of granular computing, Lecture Notes in Computer Science 3100 (2004), 232-253.

[15] Y. Y. Yao, Granular computing: Basic issues and possible solutions, Proceedings of the 5th Joint Conference on Information Sciences (2000), 186-189.

[16] Y. Y. Yao, Information granulation and rough set approximation, International Journal of Intelligent Systems 16 (2001), 87-104.

[17] Y. Y. Yao, C. J. Liau and N. Zhong, Granular computing based on rough sets, quotient space theory, and belief functions, LNAI 2871 (2003), 152-159.

[18] Y. Y. Yao, Neighborhood systems and approximate retrieval, Information Sciences 176 (2006), 3431-3452.

[19] J. T. Yao and Y. Y. Yao, Introduction of classification rules by granular computing, LNAI 2475 (2002), 331-338.

[20] Z. Bonikowski, E. Bryniarski and U. Wybraniec-Skardowska, Extensions and intentions in the rough set theory, Journal of Information Sciences 107 (1998), 149-167.

[21] W. Zhu, Properties of the second type of covering-based rough sets, in: Workshop Proceedings of GrC & BI 06, IEEE WI 06, Hong Kong, China (2006), 494-497.