Algorithm for finding all attribute reduction of a decision

Nguyễn Long Giang, Vũ Đức Thi
Author affiliations


  • Nguyễn Long Giang
  • Vũ Đức Thi



Attribute reduction is one of the most important issues in rough set theory. There are many scientific papers that suppose algorithms on attribute reduction algorithms. However, they are all heuristic algorithms that find the best attribute reduction based on a kind of heuristic information. In this paper, we present a new algorithm for finding all attribute reductions of a decision and we show that the time complexity of the algorithm is exponential in the number of attributes. We also show that this complexity is polynomial in many special cases.


Metrics Loading ...

How to Cite

N. L. Giang and V. Đức Thi, “Algorithm for finding all attribute reduction of a decision”, JCC, vol. 27, no. 3, pp. 199–205, Apr. 2012.



Computer Science

Most read articles by the same author(s)

1 2 3 4 > >>