Abstract
A new method for discretization of continuous features based on the Variable Precision Rough Set theory is proposed and tested in the process of inducing decision trees. Through rectifying error ratio, the generalization capability of decision trees is enhanced by enlarging or reducing the sizes of positive regions. Two ways of computing frequency and width are deployed to calculate the misclassifying rate of the data, and thus the negative effect on decision trees is reduced, by which the discretization points are determined. In the paper, we use some open data sets to testify the method. The results are compared with that obtained by C4.5, which shows that the presented method is a feasible way to discretization of continuous features in applications.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Quinlan, J.R.: Simplifying decision trees. J. Man-Machine Studies 27, 221–234 (1987)
Hussain, F., Liu, H., Tan, C.L., Dash, M.: Discretization: An Enabling Technique. Data Mining and Knowledge Discovery 6, 393–423 (2002)
Quinlan, J.R.: Improved use of continuous attributes in C.45. Journal of Artificial Intelligence Research 4, 77–90 (1996)
Nguyen, H.S.: On efficient handling of continuous attributes in large data bases. Fundamenta Informaticae 48, 61–81 (2001)
Liu, H., Setiono, R.: Chi2: Feature Selection and Discretization of Numeric Attributes. In: Seventh International Conference on Tools with Artificial Intelligence, pp. 388–391 (1995)
Hong, S.J.: Use of contextual information for feature ranking anddiscretization. IEEE Transactions on Knowledge and Data Engineering 9, 718–730 (1997)
Pawlak, Z.: Rough sets-theoretical aspects of reasoning about data, pp. 9–30. Kluwer Academic Publishers, Dordrecht (1991)
Wei, J., Huang, D.: Rough set based decision tree. In: Proc. of the 4th World Congress on intelligence Control and Automation, Shanghai, pp. 426–431 (2002)
Zhi, T., Baodong, X., Dingwei, W.: Knowledge reduction method based on decision attribute support degree. Journal of Northeastern University (Natural Science) 23, 1025–1028 (2002)
Nguyen, S.H., Nguyen, H.S.: Some efficient algorithms for Rough Set methods. In: Proc. of the Conf. on Information Processing and Management of Uncertainty in Knowledge Based Systems, pp. 1451–1456 (1996)
Jun, Z., Guoyin, W., Zhongfu, W.U., Hong, T., Hua, L.: Method of Data Discretization Based on Rough Set Theory. Mini- Micro Systems (Chinese) 25, 60–64 (2004)
Ziarko, W.: Variable precision rough set model. Journal of Computer and System Sciences 46, 39–59 (1993)
Frank, E.: Pruning decision trees and Lists. PhD thesis. University of Waikato, Department of Computer Science, Hamilton, New Zealand, pp. 160–345 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, JM., Wang, GY., Kong, XM., Li, SJ., Wang, SQ., Liu, DY. (2006). A New Method for Discretization of Continuous Attributes Based on VPRS. In: Greco, S., et al. Rough Sets and Current Trends in Computing. RSCTC 2006. Lecture Notes in Computer Science(), vol 4259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908029_21
Download citation
DOI: https://doi.org/10.1007/11908029_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47693-1
Online ISBN: 978-3-540-49842-1
eBook Packages: Computer ScienceComputer Science (R0)