Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 519173, 7 pages
http://dx.doi.org/10.1155/2013/519173
Research Article

Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets

1School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
2Lab of Granular Computing, Minnan Normal University, Zhangzhou, Fujian 363000, China

Received 4 January 2013; Accepted 30 April 2013

Academic Editor: Hector Pomares

Copyright © 2013 Shiping Wang 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. T. B. Iwiński, “Algebraic approach to rough sets,” Bulletin of the Polish Academy of Sciences, vol. 35, no. 9-10, pp. 673–683, 1987. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. 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 · View at MathSciNet
  3. W. Żakowski, “Approximations in the space (u, π),” Demonstratio Mathematica, vol. 16, no. 3, pp. 761–769, 1983. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. W. Zhu, “Relationship among basic concepts in covering-based rough sets,” Information Sciences, vol. 179, no. 14, pp. 2478–2486, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. 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 · View at MathSciNet
  6. Y. Du, Q. Hu, P. Zhu, and P. Ma, “Rule learning for classification based on neighborhood covering reduction,” Information Sciences, vol. 181, no. 24, pp. 5457–5467, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  7. 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 Publisher · View at Google Scholar · View at Scopus
  8. F. Min, H. He, Y. Qian, and W. Zhu, “Test-cost-sensitive attribute reduction,” Information Sciences, vol. 181, pp. 4928–4942, 2011. View at Google Scholar
  9. T. Yang and Q. 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 · View at MathSciNet
  10. C. Bazgan, J. Monnot, V. Th. Paschos, and F. Serrière, “On the differential approximation of MIN SET COVER,” Theoretical Computer Science, vol. 332, no. 1–3, pp. 497–513, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. A. Skowron, J. Stepaniuk, and R. Swiniarski, “Modeling rough granular computing based on approximation spaces,” Information Sciences, vol. 184, pp. 20–43, 2012. View at Google Scholar
  12. Y. Yao and B. Yao, “Covering based rough set approximations,” Information Sciences, vol. 200, pp. 91–107, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. W. Zhu and F. Y. Wang, “On three types of covering-based rough sets,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 8, pp. 1131–1143, 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Wang, W. Zhu, Q. Zhu, and F. Min, “Covering base,” Journal of Information and Computational Science, vol. 9, pp. 1343–1355, 2012. View at Google Scholar
  15. P. Zhu, “An axiomatic approach to the roughness measure of rough sets,” Fundamenta Informaticae, vol. 109, no. 4, pp. 463–480, 2011. View at Google Scholar · View at MathSciNet
  16. 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 · View at MathSciNet
  17. 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 · View at MathSciNet
  18. T. Deng, Y. Chen, W. Xu, and Q. Dai, “A novel approach to fuzzy rough sets based on a fuzzy covering,” Information Sciences, vol. 177, no. 11, pp. 2308–2326, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. D. Dubois and H. Prade, “Rough fuzzy sets and fuzzy rough sets,” International Journal of General Systems, vol. 17, pp. 191–209, 1990. View at Google Scholar
  20. Q. He, C. Wu, D. Chen, and S. Zhao, “Fuzzy rough set based attribute reduction for information systems with fuzzy decisions,” Knowledge-Based Systems, vol. 24, no. 5, pp. 689–696, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. G. Liu, “Generalized rough sets over fuzzy lattices,” Information Sciences, vol. 178, no. 6, pp. 1651–1662, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. M. Kryszkiewicz, “Rules in incomplete information systems,” Information Sciences, vol. 113, no. 3-4, pp. 271–292, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. S. K. Pal, S. Mitra, and P. Mitra, “Rough-fuzzy MLP: modular evolution, rule generation, and evaluation,” IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 1, pp. 14–25, 2003. View at Publisher · View at Google Scholar · View at Scopus
  24. Q. Hu, J. Liu, and D. Yu, “Mixed feature selection based on granulation and approximation,” Knowledge-Based Systems, vol. 21, pp. 294–304, 2007. View at Google Scholar
  25. F. Min and Q. Liu, “A hierarchical model for test-cost-sensitive decision systems,” Information Sciences, vol. 179, no. 14, pp. 2442–2452, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. F. Min and W. Zhu, “Attribute reduction of data with error ranges and test costs,” Information Sciences, vol. 211, pp. 48–67, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. Y. Chen, D. Miao, R. Wang, and K. Wu, “A rough set approach to feature selection based on power set tree,” Knowledge-Based Systems, vol. 24, no. 2, pp. 275–281, 2011. View at Publisher · View at Google Scholar · View at Scopus
  28. Q. Hu, D. Yu, J. Liu, and C. Wu, “Neighborhood rough set based heterogeneous feature subset selection,” Information Sciences, vol. 178, no. 18, pp. 3577–3594, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. J. Dai, W. Wang, Q. Xu, and H. Tian, “Uncertainty measurement for interval-valued decision systems based on extended conditional entropy,” Knowledge-Based Systems, vol. 27, pp. 443–450, 2012. View at Google Scholar
  30. C. Wang, D. Chen, C. Wu, and Q. Hu, “Data compression with homomorphism in covering information systems,” International Journal of Approximate Reasoning, vol. 52, no. 4, pp. 519–525, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. S. Wang, Q. Zhu, W. Zhu, and F. Min, “Matroidal structure of rough sets and its characterization to attribute reduction,” Knowledge-Based Systems, vol. 36, pp. 155–161, 2012. View at Google Scholar
  32. Y. Yao, “The superiority of three-way decisions in probabilistic rough set models,” Information Sciences, vol. 181, no. 6, pp. 1080–1096, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  33. J. Chen, I. A. Kanj, and W. Jia, “Vertex cover: further observations and further improvements,” Journal of Algorithms, vol. 41, no. 2, pp. 280–301, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. F. Gömöry, “Improvement of the self-field critical current of a high-tc superconducting tape by the edge cover from soft ferromagnetic material,” Applied Physics Letters, vol. 89, no. 7, Article ID 072506, 2006. View at Publisher · View at Google Scholar · View at Scopus
  35. 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 · View at MathSciNet
  36. D. B. West, Introduction To Graph Theory, Pearson Education, 2002.
  37. S. Wang and W. Zhu, “Matroidal structure of covering-based rough sets through the upper approximation number,” International Journal of Granular Computing, Rough Sets and Intelligent Systems, vol. 2, pp. 141–148, 2011. View at Google Scholar
  38. W. Zhu and S. Wang, “Matroidal approaches to generalized rough sets based on relations,” International Journal of Machine Learning and Cybernetics, vol. 2, pp. 273–279, 2011. View at Google Scholar
  39. Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning About Data, Kluwer Academic Publishers, Boston, Mass, USA, 1991.