Skip to main content

An Addition Strategy for Reduct Construction

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8818))

Included in the following conference series:

Abstract

This paper examines an addition strategy for constructing an attribute reduct based on three-way classification of attributes. Properties of three-way classification of attributes are used to design an algorithm for constructing a reduct by using useful attributes. The algorithm makes sure that every attribute to be added, together with already added attributes, will form a partial reduct (i.e., a subset of a reduct). Based on the results of this paper, it is possible to study a wide class of addition based reduct construction algorithms. Finally, variations of the proposed algorithm are discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Miao, D.Q., Zhao, Y., Yao, Y.Y., Li, H.X., Xu, F.F.: Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model. Information Sciences 179(24), 4140–4150 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Nguyen, L.G., Nguyen, H.S.: On elimination of redundant attributes in decision tables. In: Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 317–322 (2012)

    Google Scholar 

  3. Nguyen, H.S.: Approximate Boolean reasoning: foundations and applications in data mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 334–506. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)

    Book  MATH  Google Scholar 

  5. Pawlak, Z.: Rough sets. International Journal of Computer Information and Science 11(5), 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  6. Quafafou, M.: α-RST: a generalization of rough set theory. Information Sciences 124(1-4), 301–316 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support. Theory and Decision Library, pp. 331–362. Springer, Netherlands (1992)

    Chapter  Google Scholar 

  8. Swiniarski, R.W.: Rough sets methods in feature reduction and classification. International Journal of Applied Mathematics and Computer Science 11(3), 565–582 (2001)

    MathSciNet  Google Scholar 

  9. Wang, J., Wang, J.: Reduction algorithms based on discernibility matrix: the ordered attributes method. Journal of Computer Science and Technology 16(6), 489–504 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Wei, L., Li, H.R., Zhang, W.X.: Knowledge reduction based on the equivalence relations defined on attribute set and its power set. Information Sciences 177(15), 3178–3185 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wong, S.K.M., Ziarko, W.: On optimal decision rules in decision tables. Bulletin of Polish Academy of Sciences 33, 693–696 (1985)

    MathSciNet  MATH  Google Scholar 

  12. Yao, Y.: An outline of a theory of three-way decisions. In: Yao, J., Yang, Y., Słowiński, R., Greco, S., Li, H., Mitra, S., Polkowski, L. (eds.) RSCTC 2012. LNCS, vol. 7413, pp. 1–17. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Yao, Y.Y.: The superiority of three-way decisions in probabilistic rough set models. Information Sciences 181(6), 1080–1096 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Yao, Y.Y.: Duality in rough set theory based on the square of opposition. Fundamenta Informaticae 127(1), 49–64 (2013)

    MathSciNet  MATH  Google Scholar 

  15. Yao, Y.Y., Zhao, Y.: Discernibility matrix simplification for constructing attribute reducts. Information Sciences 179(7), 867–882 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Yao, Y.Y., Zhao, Y., Wang, J.: On reduct construction algorithms. In: Gavrilova, M.L., Tan, C.J.K., Wang, Y., Yao, Y., Wang, G. (eds.) Transactions on Computational Science II. LNCS, vol. 5150, pp. 100–117. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Zhao, K., Wang, J.: A reduction algorithm meeting users’ requirements. Journal of Computer Science and Technology 17(5), 578–593 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cong Gao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gao, C., Yao, Y. (2014). An Addition Strategy for Reduct Construction. In: Miao, D., Pedrycz, W., Ślȩzak, D., Peters, G., Hu, Q., Wang, R. (eds) Rough Sets and Knowledge Technology. RSKT 2014. Lecture Notes in Computer Science(), vol 8818. Springer, Cham. https://doi.org/10.1007/978-3-319-11740-9_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11740-9_49

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11739-3

  • Online ISBN: 978-3-319-11740-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics