A New Fitness Function for Solving Minimum Attribute Reduction Problem

  • Dongyi Ye
  • Zhaojiong Chen
  • Shenglan Ma
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6401)


The problem of minimum attribute reduction is formally a nonlinearly constrained combinatorial optimization problem and has been proved to be NP-hard. A most commonly used approach for dealing with the problem is to first transform it into a fitness maximization problem over a Boolean space and then to solve the latter via stochastic optimization methods. However, existing fitness functions either fail to assure in theory the optimality equivalence between the original problem and the fitness maximization problem or are not quite adequate in terms of fitness evaluation. In this paper, a new fitness function that overcomes the drawbacks of the existing fitness functions is given. The optimality equivalence using the proposed fitness function is theoretically proved. Comparisons are made experimentally between the proposed fitness function and two other typical fitness functions by using two recent attribute reduction algorithms. Experimental results show that for each algorithm in test, the proposed fitness function outperforms the other two in terms of both the probability of finding a minimum reduct and the average length of the output reducts.


Particle Swarm Optimization Fitness Function Maximization Problem Decision Table Minimum Reduct 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wong, S.K.M., Ziarko, W.: On optimal decision rules in decision tables. Bulletin of Polish Academy of Science 33, 693–696 (1985)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Bello, R., Gomez, Y., Garcia, M.M., et al.: Two-Step Particle Swarm Optimization to Solve the Feature Selection Problem. In: Proceedings of Seventh International Conference on Intelligent Systems Design and Applications, pp. 691–696 (2007)Google Scholar
  3. 3.
    Dai, J.H.: Particle swarm algorithm for minimal attribute reduction of decision tables. In: Proceedings of IMSCCS 2006, vol. 2, pp. 572–575. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
  4. 4.
    Jensen, R., Shen, Q.: Finding Rough Set Reducts with Ant Colony Optimization. In: Proceedings of the 2003 UK workshop on computational intelligence, pp. 15–22 (2003)Google Scholar
  5. 5.
    Ke, L.J., Feng, Z.R., Ren, Z.G.: An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognition Letters 29, 1351–1357 (2008)CrossRefGoogle Scholar
  6. 6.
    Wang, X.Y., Yang, J., Peng, N.S., et al.: Finding Minimal Rough Set Reducts with Particle Swarm Optimization. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 451–460. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Wang, X.Y., Yang, J., Teng, X., Xia, W., Jensen, R.: Feature selection based on rough sets and particle swarm optimization. Pattern Recognition Letters 28, 459–471 (2007)CrossRefGoogle Scholar
  8. 8.
    Wroblewski, J.: Finding mininmal reducts using genetic algorithm. In: Proceedings of the Second Annual Joint Conference on Information Sciences, Wrightsville Beach, NC, pp. 186–189 (1995)Google Scholar
  9. 9.
    Hedar, A.R., Wang, J., Fukushima, M.: Tabu search for attribute reduction in rough set theory. Soft Computing 12(9), 909–918 (2008)zbMATHCrossRefGoogle Scholar
  10. 10.
    Ye, D.Y., Chen, Z.J., Liao, J.K.: A New Algorithm for Minimum Attribute Reduction Based on Binary Particle Swarm Optimization with Vaccination. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 1029–1036. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Pawlak, Z., Slowinski, R.: Rough set approach to multi-attribute decision analysis. European J. of Operational Research 72, 443–459 (1994)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Dongyi Ye
    • 1
  • Zhaojiong Chen
    • 1
  • Shenglan Ma
    • 1
  1. 1.College of Mathematics and ComputerFuzhou UniversityFuzhouChina

Personalised recommendations