Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012 (2012), Article ID 970576, 13 pages
http://dx.doi.org/10.1155/2012/970576
Research Article

A Granular Reduction Algorithm Based on Covering Rough Sets

1College of Science, Central South University of Forestry and Technology, Changsha 410004, China
2College of Mathematics and Computer Science, Guangxi University for Nationalities, Nanning 530006, China
3School of Economics and Management, Changsha University of Science and Technology, Changsha 410004, China

Received 31 March 2012; Revised 12 July 2012; Accepted 16 July 2012

Academic Editor: Chong Lin

Copyright © 2012 Tian Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Z. Pawlak, “Rough sets,” International Journal of Computer and Information Sciences, vol. 11, no. 5, pp. 341–356, 1982. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Acedemic, Boston, Mass, USA, 1991.
  3. G. Dong, J. Han, J. Lam, J. Pei, K. Wang, and W. Zou, “Mining constrained gradients in large databases,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 8, pp. 922–938, 2004. View at Google Scholar
  4. S. Pal and P. Mitra, “Case generation using rough sets with fuzzy representation,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 3, pp. 292–300, 2004. View at Google Scholar
  5. L. Polkowski and A. Skowron, Rough Sets and Current Trends in Computing, vol. 1424, Springer, Berlin, Germany, 1998.
  6. L. Polkowski and A. Skowron, Eds., Rough Sets in Knowledge Discovery, vol. 1, Physica-Verlag, Berlin, Germany, 1998.
  7. L. Polkowski and A. Skowron, Eds., Rough Sets in Knowledge Discovery, vol. 2, Physica-Verlag, Berlin, Germany, 1998.
  8. N. Zhong, Y. Yao, and M. Ohshima, “Peculiarity oriented multidatabase mining,” IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 952–960, 2003. View at Google Scholar
  9. Z. Bonikowski, E. Bryniarski, and U. Wybraniec-Skardowska, “Extensions and intentions in the rough set theory,” Information Sciences, vol. 107, no. 1–4, pp. 149–167, 1998. View at Publisher · View at Google Scholar
  10. E. Bryniarski, “A calculus of rough sets of the first order,” Bulletin of the Polish Academy of Sciences, vol. 37, no. 1–6, pp. 71–78, 1989. View at Google Scholar · View at Zentralblatt MATH
  11. C. Degang, W. Changzhong, and H. Qinghua, “A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets,” Information Sciences, vol. 177, no. 17, pp. 3500–3518, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. C. Degang, Z. Wenxiu, D. Yeung, and E. C. C. Tsang, “Rough approximations on a complete completely distributive lattice with applications to generalized rough sets,” Information Sciences, vol. 176, no. 13, pp. 1829–1848, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. T.-J. Li, Y. Leung, and W.-X. Zhang, “Generalized fuzzy rough approximation operators based on fuzzy coverings,” International Journal of Approximate Reasoning, vol. 48, no. 3, pp. 836–856, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. T.-J. Li and W.-X. Zhang, “Rough fuzzy approximations on two universes of discourse,” Information Sciences, vol. 178, no. 3, pp. 892–906, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. E. C. C. Tsang, C. Degang, and D. S. Yeung, “Approximations and reducts with covering generalized rough sets,” Computers & Mathematics with Applications, vol. 56, no. 1, pp. 279–289, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  16. E. Tsang, D. Chen, J. Lee, and D. S. Yeung, “On the upper approximations of covering generalized rough sets,” in Proceedings of the 3rd International Conference on Machine Learning and Cybernetics, pp. 4200–4203, 2004.
  17. W. Zhu and F.-Y. Wang, “Reduction and axiomization of covering generalized rough sets,” Information Sciences, vol. 152, pp. 217–230, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. W. Zhu, “Topological approaches to covering rough sets,” Information Sciences, vol. 177, no. 6, pp. 1499–1508, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  19. W. Zhu, “Relationship between generalized rough sets based on binary relation and covering,” Information Sciences, vol. 179, no. 3, pp. 210–225, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. X. Y. Chen and Q. G. Li, “Construction of rough approximations in fuzzy setting,” Fuzzy Sets and Systems, vol. 158, no. 23, pp. 2641–2653, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. T. Y. Lin, “Topological and fuzzy rough sets,” in Intelligent Decision Support: Handbook of Applications and Advances of the Rough Set Theory, R. Slowinsk, Ed., pp. 287–304, Kluwer Acedemic, Boston, Mass, USA, 1992. View at Google Scholar
  22. A. Skowron and J. Stepaniuk, “Tolerance approximation spaces,” Fundamenta Informaticae, vol. 27, no. 2-3, pp. 245–253, 1996. View at Google Scholar · View at Zentralblatt MATH
  23. C. Wang, C. Wu, and D. Chen, “A systematic study on attribute reduction with rough sets based on general binary relations,” Information Sciences, vol. 178, no. 9, pp. 2237–2261, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  24. Y. Y. Yao, “On generalizing pawlak approximation operators,” in LNAI, vol. 1424, pp. 298–307, 1998. View at Google Scholar
  25. Y. Y. Yao, “Constructive and algebraic methods of the theory of rough sets,” Information Sciences, vol. 109, no. 1–4, pp. 21–47, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  26. Y. Y. Yao, “Relational interpretations of neighborhood operators and rough set approximation operators,” Information Sciences, vol. 111, no. 1–4, pp. 239–259, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  27. F. Hu, G. y. Wang, H. Huang et al., “Incremental attribute reduction based on elementary sets,” RSFDGrC, vol. 36, no. 41, pp. 185–193, 2005. View at Google Scholar
  28. R. Jensen and Q. Shen, “Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 12, pp. 1457–1471, 2004. View at Google Scholar
  29. A. Skowron and C. Rauszer, “The discernibility matrices and functions in information systems, intelligent decision suport,” in Handbook of Applications and Advances of the Rough Sets Theory, R. Slowinski, Ed., Kluwer Academic, Boston, Mass, USA, 1992. View at Google Scholar
  30. T. Yang and Q. G. Li, “Reduction about approximation spaces of covering generalized rough sets,” International Journal of Approximate Reasoning, vol. 51, no. 3, pp. 335–345, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  31. T. Yang, Q. G. Li, and B. L. Zhou, “Granular reducts from the topological view of covering rough sets,” in Proceedings of the 8th IEEE International Conference on Granular Computing, Zhejiang University, Hangzhou, China, August 2012.
  32. T. Yang, Q. G. Li, and B. L. Zhou, “Related family: a new method for attribute reduction of covering information systems,” Information Sciences. In press.
  33. S. K. M. Wong and W. Ziarko, “On optimal decision rules in decision tables,” Bulletin of the Polish Academy of Sciences, vol. 33, no. 11-12, pp. 693–696, 1985. View at Google Scholar · View at Zentralblatt MATH