Improving Indiscernibility Matrix Based Approach for Attribute Reduction
The problem of finding all reducts of the attribute set of a data table has often been studied in rough set theory by using the notion of discernibility matrix. An alternative version based on the indiscernibility matrix has been used for this problem to a lesser extent due to its space and time complexity. This paper improves the indiscernibility matrix based approach for computing all reducts. Only indiscernibility matrix cells as well as subsets of the attribute set necessary for computing reducts are processed. The experiments reported in this paper show that the improved version uses less memory to store partial results and can find reducts in a shorter time.
KeywordsRough sets Attribute reduction Indiscernibility matrix
- 4.Li, H., Zhu, J.: Finding all the absolute reductions based on discernibility matrix. In: ICMLC 2005. vol. 9, pp. 5682–5685. IEEE (2005)Google Scholar
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.