Abstract
The problem of real value attribute discretization can be converted into the reduct problem in the Rough Set Theory, which is NP-hard and can be solved by some heuristic algorithms. In this paper we show that the straightforward conversion is not scalable and propose a divide-and-conquer algorithm. This algorithm is fully scalable and can reduce the time complexity dramatically especially while integrated with the tournament discretization algorithm. Parallel versions of this algorithm can be easily written, and their complexity depends on the number of objects in each subtable rather than the number of objects in the initial decision table. There is a tradeoff between the time complexity and the quality of the discretization scheme obtained, and this tradeoff can be made through adjusting the number of subtables, or equivalently, the number of objects in each subtable. Experimental results confirm our analysis and indicate appropriate parameter setting.
This is a preview of subscription content, log in via an institution to check access.
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
Kurgan, L., Cios, K.J.: CAIM Discretization Algorithm. IEEE Transactions on Knowledge and Data Engeering 16(2), 145–153 (2004)
Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough sets: A Tutorial. In: Pal, S., Skowron, A. (eds.) Rough Fuzzy Hybridization, pp. 3–98 (1999)
Nguyen, H.S., Skowron, A.: Discretization of Real Value Attributes. In: Proc. of the 2nd Joint Annual Conference on Information Science, Wrightsvlle Beach, North Carolina, pp. 34–37 (1995)
Nguyen, H.S.: Discretization of Real Value Attributes, Boolean Reasoning Approach. PhD thesis, Warsaw University, Warsaw, Poland (1997)
Nguyen, H.S.: Discretization Problem for Rough Sets Methods. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 545–552. Springer, Heidelberg (1998)
Min, F., Cai, H.B., Liu, Q.H., Li, F.: The Tournament Discretization Algrithm (submitted to ISPA 2005)
Min, F., Lin, S.M., Wang, X.B., Cai, H.B.: Attribute Extraction from Mixed-Mode Data (accepted by ICMLC 2005)
Swiniarski, R.W., Skowron, A.: Rough Set Methods in Feature Selection and Recognition. Pattern Recognition Letters 24, 833–849 (2003)
Shao-Hui, L., Qiu-Jian, S., Bin, W., Zhong-Zhi, S., Fei, H.: Research on Efficient Algorithms for Rough Set Methods. Chinese Journal of Computer 26(5), 524–529 (2003) (in Chinese)
Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases. UC Irvine, Dept. Information and Computer Science (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Cryszkiewicz, M.: Comparative Studies of Alternative Type of Knowledge Reduction in Inconsistent Systems. International Journal of Intelligent Systems 16(1), 105–120 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Min, F., Xie, L., Liu, Q., Cai, H. (2005). A Divide-and-Conquer Discretization Algorithm. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539506_161
Download citation
DOI: https://doi.org/10.1007/11539506_161
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28312-6
Online ISBN: 978-3-540-31830-9
eBook Packages: Computer ScienceComputer Science (R0)