Abstract
The current reduction algorithms based on rough sets still have some disadvantages. First, we indicated their limitations for reduct generation. We modified the mean decision power, and proposed to use the algebraic definition of decision power. To select optimal attribute reduction, the judgment criterion of decision with inequality was presented and some important conclusions were obtained. A complete algorithm for the attribute reduction was designed. Finally, through analyzing the given example, it was shown that the proposed heuristic information was better and more efficient than the others, and the presented in the paper method reduces time complexity and improves the performance. We report experimental results with several data sets from UCI repository and we compare the results with some other methods. The results prove that the proposed method is promising.
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
Pawlak, Z.: Rough Sets and Intelligent Data Analysis. Int. J. of Inf. Sci. 147, 1–12 (2002)
Wang, G.Y.: Rough Reduction in Algebra View and Information View. Int. J. of Int. Syst. 18, 679–688 (2003)
Wang, G.Y., Yu, H., Yang, D.C.: Decision Table Reduction Based on Conditional Information Entropy. J. of Comp. 25(7), 759–766 (2002)
Miao, D.Q., Hu, G.R.: A Heuristic Algorithm for Reduction of Knowledge. Journal of Computer Research and Development 36(6), 681–684 (1999)
Liang, J.Y., Shi, Z.Z., Li, D.Y.: Applications of Inclusion Degree in Rough Set Theory. Int. J. of Comp. Cogn. 1(2), 67–68 (2003)
Jiang, S.Y., Lu, Y.S.: Two New Reduction Definitions of Decision Table. Mini-Micro Systems 27(3), 512–515 (2006)
Guan, J.W., Bell, D.A.: Rough Computational Methods for Information Systems. Int. J. of AI. 105, 77–103 (1998)
Liu, S.H., Sheng, Q.J., Wu, B., et al.: Research on Efficient Algorithms for Rough Set Methods. J. of Comp. 26(5), 524–529 (2003)
Xu, Z.Y., Liu, Z.P., et al.: A Quick Attribute Reduction Algorithm with Complexity of Max(O(|C||U|),O(|C| 2|U/C|)). J. of Comp. 29(3), 391–399 (2006)
Ślȩzak, D.: Approximate Entropy Reducts. Fundam. Inform. 53, 365–390 (2002)
Ślȩzak, D., Wróblewski, J.: Order Based Genetic Algorithms for the Search of Approximate Entropy Reducts. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, p. 570. Springer, Heidelberg (2003)
Liu, Q.H., Li, F., et al.: An Efficient Knowledge Reduction Algorithm Based on New Conditional Information Entropy. Control and Decision 20(8), 878–882 (2005)
Jiang, S.Y.: An Incremental Algorithm for the New Reduction Model of Decision Table. Comp. Eng.g and Appl. 28, 21–25 (2005)
Ślȩzak, D.: Various Approaches to Reasoning with Frequency-Based Decision Reducts: A Survey. In: Polkowski, L., Lin, T.Y., Tsumoto, S. (eds.) Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems, vol. 56, pp. 235–285. Springer, Heidelberg (2000)
Han, J.C., Hu, X.H., Lin, T.Y.: An Efficient Algorithm for Computing Core Attributes in Database Systems. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 663–667. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, J., Sun, L. (2008). 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) Rough Sets and Knowledge Technology. RSKT 2008. Lecture Notes in Computer Science(), vol 5009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79721-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-79721-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79720-3
Online ISBN: 978-3-540-79721-0
eBook Packages: Computer ScienceComputer Science (R0)