Skip to main content
SpringerLink
Log in

Rough sets and ordinal reducts

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Rough set theory has been successfully applied in selecting attributes to improve the effectiveness in deriving decision trees/rules for decisions and classification problems. When decisions involve ordinal classes, the rough set reduction process should try to preserve the order relation generated by the decision classes. Previous works on rough sets when applied to ordinal decision systems still focus on preserving the information relating to the decision classes and not the underlying order relation. In this paper, we propose a new way of evaluating and finding reducts involving ordinal decision classes which focus on the order generated by the ordinal decision classes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. We use X/Y to represent difference of set X and Y.

References

  • Bioch J, Popova V (2000) Rough sets and ordinal classification. In: Arimura ASH, Jain S (eds) Algorithmic learning theory. Lect Notes Artif Intell 1968:291–305

  • Greco S, Matarazzo B, Slowinski R (2001) Rough sets theory for multicriteria decision analysis. Eur J Oper Res 129:1–47

    Google Scholar 

  • Iwinski TB (1988) Ordinal information systems, I. Bull Polish Acad Sci Math 36(7–8):467–475

    Google Scholar 

  • Iwinski TB (1991) Ordinal information systems, II. Bull Polish Acad Sci Tech Sci 39(1):157–170

    Google Scholar 

  • Komorowski J, Polkowski L, Skowron A (1998) Rough sets: a tutorial. In: Pal SK, Skowron A (eds) Rough-fuzzy hybridization: a new method for decision making. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Lee JWT, Yeung DS, Tsang ECC (2002) Ordinal fuzzy sets. IEEE Transact Fuzzy Syst 10(6):767–778

    Google Scholar 

  • Pal SK, Skowron A (eds) (1999) Rough-fuzzy hybridization: a new trend in decision making. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Pawlak Z (1982) Rough Sets. Int J Inform Comput Sci 11:341–356

    Google Scholar 

  • Sai Y, Yao YY, Zhong N (2001) Data analysis and mining in ordered information tables. In: Proceedings of the IEEE international conference on data mining 2001, pp 497–504

Download references

Acknowledgements

This project is supported by the Hong Kong Polytechnic University research grant H-ZJ85.

Author information

Authors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, Hong Kong, China

    John W. T. Lee, Daniel S. Yeung & Eric C. C. Tsang

Authors
  1. John W. T. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel S. Yeung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eric C. C. Tsang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to John W. T. Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, J.W.T., Yeung, D.S. & Tsang, E.C.C. Rough sets and ordinal reducts. Soft Comput 10, 27–33 (2006). https://doi.org/10.1007/s00500-005-0460-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-005-0460-5

Keywords

Search

Navigation