An introduction of the condition class space with continuous value discretization and rough set theory

International Journal of Intelligent Systems

Volumn 21, Issue 2, 2006, Pages 173-191

  Beynon, Malcolm J ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DECISION THEORY; INFORMATION SCIENCE; LEARNING ALGORITHMS; LEARNING SYSTEMS;

CLASS SPACES; CONTINUOUS VALUE DISCRETIZATION (CVD); GRANULARITY; SUBSETS;

ROUGH SET THEORY;

EID: 32644442306     PISSN: 08848173     EISSN: None     Source Type: Journal    
DOI: 10.1002/int.20126     Document Type: Article

References (18)

1. Pawlak Z. Rough sets. Int J Inform Comput Sci 1982;11:341-356.
2. Pawlak Z. Rough sets - Theoretical aspects of reasoning about data. London: Kluwer Academic Publishers; 1991.
3. Teghem J, Benjelloun M. Some experiments to compare rough sets and ordinal statistical methods. In: Słowiński R, editor. Intelligent decision support: Handbook of applications and advances of rough set theory, vol 11. Dordrecht: Kluwer; 1992. pp 267-284.
4. Dünstch I, Gediga G. Statistical evaluation of rough set dependency analysis. Int J Hum Comput Stud 1997;46:589-604.
5. Domingos P. The role of Occam's razor in knowledge discovery. Data Mining Knowl Discov 1999;3:409-425.
6. Bazan TG. A comparison of dynamic and non-dynamic rough sets methods for extracting laws from decision tables. In: Polkowski L, Skowron A, editors. Rough sets in knowledge discovery 1: Methodology and applications. New York: Physica-Verlag; 1998. pp 451-482.
7. Nguyen HS. Discretization problem for rough sets methods. In: Polkowski L, Skowron A, editors. Rough sets and current trends in computing. Proc First Int Conf RSCTC'98, Warsaw, Poland; 1998. pp 545-552.
8. Wright GN, Bolger FMI. Expertise and decision support. New York: Plenum; 1992.
9. Dougherty J, Kohavi R, Sahami M. Supervised and unsupervised discretization of continuous features. In: Proc 12th Int Conf on Machine Learning, Tahoe City. San Francisco: Kaufmann; 1995. pp 194-202.
10. Liu H, Setiono R. Dimensionality reduction via discretization. Knowl Base Syst 1996;9:67-72.
11. Beynon MJ, Peel MJ. Variable precision rough set theory and data discretisation: An application to corporate failure prediction. Omega 2001;29:561-576.
12. Chmielewski M, Grzymala-Busse L. Global discretization of continuous attributes as preprocessing for machine learning. Int J Approx Reas 1996;15:319-331.
13. Nguyen HS, Nguyen SH. Discretisation methods in data mining. In: Polkowski L, Skowron A, editors. Rough sets in knowledge discovery 1: Methodology and applications. New York: Physica-Verlag; 1998. pp 451-482.
14. Beynon MJ. Stability of continuous value discretisation: An application within rough set theory. Int J Approx Reas 2004;35:29-53.
15. Słowiński K, Słowiński R. Sensitivity analysis of rough classification. Int J Man Mach Stud 1990;32:693-705.
16. Browne C, Dünstch L, Gediga G. IRIS revisited: A comparison of discriminant and enhanced rough set data analysis. In: Polkowski L, Skowron A, editors. Rough sets in knowledge discovery 2: Applications, case studies and software systems. New York: Physica-Verlag; 1998. pp 345-368.
17. Parzen E. On estimation of a probability density function mode. Ann Math Stat 1962;33:1065-1076.
18. Forina M, Leardi R, Armanino C, Lanteri S. PARVUS: An extendable package of programs for data exploration, classification and correlation. Amsterdam: Elsevier; 1988.