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

Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids

Lab of Granular Computing, Minnan Normal University, Zhangzhou 363000, China

Received 22 May 2013; Accepted 31 December 2013; Published 11 February 2014

Academic Editor: Jin L. Kuang

Copyright © 2014 Aiping Huang and William Zhu. 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 · View at MathSciNet
  2. 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
  3. F. Min, H. He, Y. Qian, and W. Zhu, “Test-cost-sensitive attribute reduction,” Information Sciences, vol. 181, no. 22, pp. 4928–4942, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. L. Wei, H. R. Li, and W. X. Zhang, “Knowledge reduction based on the equivalence relations defined on attribute set and its power set,” Information Sciences, vol. 177, no. 15, pp. 3178–3185, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. 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
  6. Y. Ouyang, Z. Wang, and H. P. Zhang, “On fuzzy rough sets based on tolerance relations,” Information Sciences, vol. 180, no. 4, pp. 532–542, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. R. Slowinski and D. Vanderpooten, “A generalized definition of rough approximations based on similarity,” IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 2, pp. 331–336, 2000. View at Publisher · View at Google Scholar · View at Scopus
  8. G. Liu and W. Zhu, “The algebraic structures of generalized rough set theory,” Information Sciences, vol. 178, no. 21, pp. 4105–4113, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. 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
  10. 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
  11. K. Qin, Y. Gao, and Z. Pei, “On covering rough sets,” in Rough Set and Knowledge Technology, Lecture Notes in Computer Science, pp. 34–41.
  12. S. Wang, P. Zhu, and W. Zhu, “Structure of covering-based rough sets,” International Journal of Mathematical and Computer Sciences, vol. 6, pp. 147–150, 2010. View at Google Scholar
  13. S. Wang, Q. Zhu, W. Zhu, and F. Min, “Quantitative analysis for covering-based rough sets through the upper approximation number,” Information Sciences, vol. 220, pp. 483–491, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  14. P. Zhu, “Covering rough sets based on neighborhoods: an approach without using neighborhoods,” International Journal of Approximate Reasoning, vol. 52, no. 3, pp. 461–472, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. 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
  16. 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
  17. C. Wang, D. Chen, Q. He, and Q. Hu, “A comparative study of ordered and covering information systems,” Fundamenta Informaticae, vol. 123, no. 3, pp. 351–363, 2013. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. C. Wang, D. Chen, B. Sun, and Q. Hu, “Communication between information systems with covering based rough sets,” Information Sciences, vol. 216, pp. 17–33, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. A. A. Estaji, M. R. Hooshmandasl, and B. Davvaz, “Rough set theory applied to lattice theory,” Information Sciences, vol. 200, pp. 108–122, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. A. Huang and W. Zhu, “Geometric lattice structure of covering-based rough sets through matroids,” Journal of Applied Mathematics, vol. 2012, Article ID 236307, 25 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. L. Wang, X. Liu, and J. Cao, “A new algebraic structure for formal concept analysis,” Information Sciences, vol. 180, no. 24, pp. 4865–4876, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. R. Wille, “Restructuring lattice theory: an approach based on hierarchies of concepts,” in Ordered Sets, I. Rival, Ed., pp. 445–470, Reidel, Dordrecht, The Netherlands, 1982. View at Google Scholar
  23. Y. Y. Yao and Y. Chen, “Rough set approximations in formal concept analysis,” in Proceedings of the Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS '04), pp. 73–78, June 2004. View at Scopus
  24. G. Birhoff, Lattice Theory, American Mathematical Society, Providence, RI, USA, 1995.
  25. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, UK, 1990. View at MathSciNet
  26. H. Lai, Matroid Theory, Higher Education Press, Beijing, China, 2001. View at MathSciNet
  27. J. Oxley, Matroid Theory, vol. 21, Oxford University Press, New York, NY, USA, 1993. View at MathSciNet
  28. J. Edmonds, “Matroids and the greedy algorithm,” Mathematical Programming, vol. 1, pp. 127–136, 1971. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. E. Lawler, Combinatorial Optimization, Dover Publications, Mineola, NY, USA, 2001. View at MathSciNet
  30. A. Huang and W. Zhu, “Dependence space of matroids and its application to attribute reduction,” http://arxiv.org/abs/1312.4231.
  31. A. Huang, H. Zhao, and W. Zhu, “Nullity-based matroid of rough sets and its application to attribute reduction,” Information Sciences, 2013. View at Publisher · View at Google Scholar
  32. X. Li and S. Liu, “Matroidal approaches to rough sets via closure operators,” International Journal of Approximate Reasoning, vol. 53, no. 4, pp. 513–527, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  33. J. Tang, K. She, and W. Zhu, “Matroidal structure of rough sets from the viewpoint of graph theory,” Journal of Applied Mathematics, vol. 2012, Article ID 973920, 27 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. J. Tang, K. She, F. Min, and W. Zhu, “A matroidal approach to rough set theory,” Theoretical Computer Science, vol. 471, pp. 1–11, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  35. S. Wang, W. Zhu, and F. Min, “Transversal and function matroidal structures of covering-based rough sets,” in Rough Sets and Knowledge Technology, pp. 146–155.
  36. 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 Publisher · View at Google Scholar
  37. 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 Publisher · 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, no. 4, pp. 273–279, 2011. View at Publisher · View at Google Scholar
  39. W. Zhu and S. Wang, “Rough matroids based on relations,” Information Sciences, vol. 232, pp. 241–252, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  40. W. Zhang, Y. Liang, and W. Wu, Information Systems and Knowledge Discovery, Science Publishing Company, Beijing, China, 2003.