Abstract
In this paper, we consider a heuristic method to partially calculate relative reducts with better evaluation by the evaluation criterion proposed by the authors. By considering discernibility and equivalence of elements with respect to values of condition attributes that appear in relative reducts, we introduce an evaluation criterion of condition attributes, and consider a heuristic method for calculating a relative reduct with better evaluation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hedar, A.H., Wang, J., Fukushima, M.: Tabu search for attribute reduction in rough set theory. Soft Couping 12(9), 909–918 (2008)
Hu, F., Wang, G., Feng, L.: Fast Knowledge Reduction Algorithms Based on Quick Sort. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 72–79. Springer, Heidelberg (2008)
Kudo, Y., Murai, T.: A Heuristic Algorithm for Selective Calculation of a Better Relative Reduct in Rough Set Theory. In: Nakamatsu, K., et al. (eds.) New Advances in Intelligent Decision Technologies. SCI, vol. 199, pp. 555–564. Springer, Heidelberg (2009)
Kudo, Y., Murai, T.: On an Approximate Calculation Method of a Relative Reduct Based on Classification by Condition Attributes. In: Proc. of the 25th Fuzzy System Symposium, SOFT (2009) (in Japanese)
Mori, N., Tanaka, H., Inoue, K.: Rough Sets and Kansei —Knowledge Acquisition and Reasoning from Kansei Data—. Kaibundo (2004) (in Japanese)
Nakaura, T., Kudo, Y., Murai, T.: On an Evaluation Method of Relative Reducts Based on Classification by Condition Attributes. In: Proc. of the 25th Fuzzy System Symposium, SOFT (2009) (in Japanese)
Pawlak, Z.: Rough Sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Pawlak, Z.: On Rough Dependency of Attributes in Information Systems. Bulletin of the Polish Academy of Sciences, Technical Sciences 33, 481–485 (1985)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Pawlak, Z., Słowiński, R.: Rough Set Approach to Multi-Attribute Decision Analysis. European Journal of Operation Research 74, 443–459 (1994)
Polkowski, L.: Rough Sets: Mathematical Foundations. In: Advances in Soft Computing. Physica-Verlag, New York (2002)
Skowron, A., Rauszer, C.M.: The discernibility matrix and functions in information systems. In: Słowiński, R. (ed.) Intelligent Decision Support: Handbook of Application and Advance of the Rough Set Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
Ślȩzak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53(3-4), 365–387 (2002)
Xu, J., Sun, L.: New Reduction Algorithm Based on Decision Power of Decision Table. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 180–188. Springer, Heidelberg (2008)
Xu, Z., Zhang, C., Zhang, S., Song, W., Yang, B.: Efficient Attribute Reduction Based on Discernibility Matrix. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., Ślȩzak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 13–21. Springer, Heidelberg (2007)
Yamaguchi, D.: On the Improvement of Pawlak’s Attribute Dependency Model. In: Proc. of the 2nd International Conference on Kansei Engineering and Affective Systems, JSKE, pp. 83–88 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kudo, Y., Murai, T. (2009). A Heuristic Algorithm for Attribute Reduction Based on Discernibility and Equivalence by Attributes. In: Torra, V., Narukawa, Y., Inuiguchi, M. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2009. Lecture Notes in Computer Science(), vol 5861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04820-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-04820-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04819-7
Online ISBN: 978-3-642-04820-3
eBook Packages: Computer ScienceComputer Science (R0)