Abstract
We study the relationship between reduct problem in Rough Sets theory and the problem of real value attribute discretization. We consider the problem of searching for a minimal set of cuts on attribute domains that preserves discernibility of objects with respect to any chosen attributes subset of cardinality s (where s is a parameter given by a user). Such a discretization procedure assures that one can keep all reducts consisting of at least s attributes. We show that this optimization problem is NP-hard and it is interesting to find efficient heuristics for solving this problem.
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
Bazan, J., Skowron, A., Synak, P. (1994). Dynamic reducts as tool for extracting laws from decision table. Proc. of the Symp. on Metodologies for Intelligent System, Charllotte, NC, Lecture Notes in Artificial Intelligence 869, Springer-Verlag, Berlin, 346–355.
Brown F.M., 1990. Boolean reasoning, Kluwer, Dordrecht.
Catlett J. (1991). On changing continuous attributes into ordered discrete attributes. In Y. Kodratoff, (ed.), Machine Learning-EWSL-91, Porto, Portugal, LNAI, pp. 164–178.
Chmielewski M.R., Grzymala-Busse J.W. (1994). Global Discretization of Attributes as Preprocessing for Machine Learning. Proc. of the III International Workshop on RSSC94, pp. 294–301.
Chlebus B., Nguyen S. Hoa. On finding good discretizations for two attributes (also composed to RSCTC’98 ).
Fayyad U. M., Irani K.B. (1992). The attribute selection problem in decision tree generation. Proc. of AAAI-92, July 1992, San Jose, CA. MIT Press, pp. 104–110.
Kondratoff Y., Michalski R. (1990): Machine learning: An Artificial Intelligence approach, vol.3, Morgan Kaufmann.
Nguyen H. S., Skowron A. (1995). Quantization of real value attributes, Rough set and Boolean Reasoning Approaches. Proc. of the Second Joint Annual Conference on Information Sciences, Wrightsville Beach, NC, USA, pp. 34–37.
Nguyen S. H., Nguyen H. S. (1996), Some Efficient Algorithms for Rough Set Methods. Proc. of the Conference of Information Processing and Management of Uncertainty in Knowledge-Based Systems, Granada, Spain, pp. 1451–1456.
Nguyen, H.S., Nguyen, S.H. (1997). Discretization Methods for Data Mining. In A. Skowron and L. Polkowski (eds.), Rough Set in Data Mining and Knowledge Discovery (in preparation). Berlin, Springer Verlag.
Pawlak Z. (1991): Rough sets: Theoretical aspects of reasoning about data, Kluwer Dordrecht.
Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. San Mateo. CA: Morgan Kaufmann Publishers.
Skowron A., Rauszer C. (1992). The Discernibility Matrices and Functions in Information Systems. In: Intelligent Decision Support-Handbook of Applications and Advances of the Rough Sets Theory, Słowiński R. (ed.), Kluwer Dordrecht, 331–362.
Wegener I. (1987). The Complexity of Boolean Functions. Stuttgart: John Wiley & Sons.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, H.S. (1998). Discretization Problem for Rough Sets Methods. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_75
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive