Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 510167, 11 pages
http://dx.doi.org/10.1155/2013/510167
Research Article

Ant Colony Optimization with Three Stages for Independent Test Cost Attribute Reduction

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

Received 3 January 2013; Revised 1 May 2013; Accepted 23 May 2013

Academic Editor: Lu Zhen

Copyright © 2013 Zilong Xu 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. 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
  2. F. Min and W. Zhu, “Minimal cost attribute reduction through backtracking,” in Proceedings of the International Conference on Database Theory and Application, vol. 258 of FGIT-DTA/BSBT, pp. 100–107, CCIS, 2011.
  3. Y. Y. Yao and Y. Zhao, “Attribute reduction in decision-theoretic rough set models,” Information Sciences, vol. 178, no. 17, pp. 3356–3373, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. X. Jia, W. Liao, Z. Tang, and L. Shang, “Minimum cost attribute reduction in decision-theoretic rough set models,” Information Sciences, vol. 219, pp. 151–167, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  5. 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
  6. G. Pan, F. Min, and W. Zhu, “A genetic algorithm to the minimal test cost reduct problem,” in Proceedings of the IEEE International Conference on Granular Computing (GrC '11), pp. 539–544, Kaohsiung, Taiwan, November 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. 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
  8. W. X. Zhang, J. S. Mi, and W. Z. Wu, “Knowledge reductions in inconsistent information systems,” Chinese Journal of Computers, vol. 26, no. 1, pp. 12–18, 2003. View at Google Scholar · View at MathSciNet
  9. Q. Liu, L. Chen, J. Zhang, and F. Min, “Knowledge reduction in inconsistent decision tables,” in Proceedings of Advanced Data Mining and Applications, vol. 4093 of Lecture Notes in Computer Science, pp. 626–635, 2006. View at Google Scholar · View at Scopus
  10. W. Ziarko, “Variable precision rough set model,” Journal of Computer and System Sciences, vol. 46, no. 1, pp. 39–59, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. J. G. Bazan and A. Skowron, “Dynamic reducts as a tool for extracting laws from decision tables,” in Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems, pp. 346–355, 1994.
  12. D. Deng, “Parallel reduct and its properties,” in Proceedings of the International Conference on Granular Computing (GRC '09), pp. 121–125, Nanchang, China, August 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. D. Deng, J. Wang, and X. Li, “Parallel reducts in a series of decision subsystems,” in Proceedings of the International Joint Conference on Computational Sciences and Optimization (CSO '09), pp. 377–380, Hainan, China, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. F. Min, Z. Bai, M. He, and Q. Liu, “The reduct problem with specified attributes,” in Proceedings of the Rough Sets and Soft Computing in Intelligent Agent and Web Technology, International Workshop at WI-IAT, pp. 36–42, 2005.
  15. W. Zhu and F. Wang, “On three types of covering rough sets,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 8, pp. 1131–1144, 2007. View at Publisher · View at Google Scholar
  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. C. Aggarwal, “On density based transforms for uncertain data mining,” in Proceedings of the 23rd IEEE International Conference on Data Engineering, pp. 866–875, 2007.
  18. H. Zhao, F. Min, and W. Zhu, “Test-cost-sensitive attribute reduction of data with normal distribution measurement errors,” Mathematical Problems in Engineering, vol. 2013, Article ID 946070, 12 pages, 2013. View at Publisher · View at Google Scholar
  19. D. Ślęzak, “Approximate entropy reducts,” Fundamenta Informaticae, vol. 53, no. 3-4, pp. 365–390, 2002. View at Google Scholar · View at MathSciNet
  20. F. Min, X. Du, H. Qiu, and Q. Liu, “Minimal attribute space bias for attribute reduction,” in Proceedings of the Rough Set and Knowledge Technology, pp. 379–386, 2007.
  21. 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
  22. S. Greco, B. Matarazzo, R. Slowinski, and J. Stefanowski, “Variable consistency model of dominance-based rough sets approach,” in Proceedings of the Rough Sets and Current Trends in Computing, vol. 2005 of Lecture Notes in Computer Science, pp. 170–181, 2000. View at Google Scholar
  23. 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
  24. Y. Qian, J. Liang, W. Pedrycz, and C. Dang, “Positive approximation: an accelerator for attribute reduction in rough set theory,” Artificial Intelligence, vol. 174, no. 9-10, pp. 597–618, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. Wikipedia, “Genetic algorithm,” http://en.wikipedia.org/wiki/Geneticalgorithm.
  26. P. D. Turney, “Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm,” Journal of Artificial Intelligence Research, vol. 2, pp. 369–409, 1995. View at Google Scholar
  27. J. Liu, F. Min, S. Liao, and W. Zhu, “A genetic algorithm to attribute reduction with test cost constraint,” in Proceedings of the 6th IEEE International Conference on Computer Sciences and Convergence Information Technology (ICCIT '11), pp. 751–754, 2011.
  28. M. Dorigo and T. Stutzle, Eds., Ant Colony Optimization, MIT Press, Boston, Mass, USA, 2004.
  29. L. Gambardella and M. Dorigo, “Has-sop: hybrid ant system for the sequential ordering problem,” Tech. Rep. (IDSIA-11-97), 1997. View at Google Scholar
  30. L. M. Gambardella, E. Taillard, G. Agazzi, I. D. Corne, M. Dorigo, and F. Glover, “Macs-vrptw: a multiple ant colony system for vehicle routing problems with time windows,” in New Ideas in Optimization, pp. 63–76, McGraw-Hill, New York, NY, USA, 1999. View at Google Scholar
  31. V. Maniezzo and A. Colorni, “The ant system applied to the quadratic assignment problem,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 5, pp. 769–778, 1999. View at Publisher · View at Google Scholar
  32. C. Blum, M. Blesa, and U. P. de Catalunya, Departament de Llenguatges i Sistemes Informàtics, Metaheuristics for the edge-weighted k-cardinality tree problem, 2003.
  33. R. Michel and M. Middendorf, “An aco algorithm for the shortest common supersequence problem,” in New Ideas in Optimization, pp. 51–62, McGraw-Hill, London, UK, 1999. View at Google Scholar
  34. Y. Chen, D. Miao, and R. Wang, “A rough set approach to feature selection based on ant colony optimization,” Pattern Recognition Letters, vol. 31, no. 3, pp. 226–233, 2010. View at Publisher · View at Google Scholar
  35. L. Ke, Z. Feng, and Z. Ren, “An efficient ant colony optimization approach to attribute reduction in rough set theory,” Pattern Recognition Letters, vol. 29, no. 9, pp. 1351–1357, 2008. View at Publisher · View at Google Scholar
  36. C. L. Blake and C. J. Merz, “UCI repository of machine learning databases,” 1998, http://www.ics.uci.edu/~mlearn/mlrepository.html.