Skip to main content

A Time-Reduction Strategy to Feature Selection in Rough Set Theory

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

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

Included in the following conference series:

  • 2638 Accesses

Abstract

In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, quite often, these methods are computationally time-consuming. To overcome this shortcoming, we introduce a time-reduction strategy, which can be used to accelerate a heuristic process of feature selection. Based on the proposed strategy, a modified feature selection algorithm is designed. Experiments show that this modified algorithm outperforms its original counterpart. It is worth noting that the performance of the modified algorithm becomes more visible when dealing with larger data sets.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ziarko, W.: Variable precision rough set model. Journal of Computer and System Science 46, 39–59 (1993)

    Article  MATH  Google Scholar 

  2. Wu, W.Z., Zhang, M., Li, H.Z., Mi, J.S.: Knowledge reduction in random information systems via Dempster-Shafer theory of evidence. Information Sciences 174, 143–164 (2005)

    Article  MATH  Google Scholar 

  3. Kryszkiewicz, M.: Comparative study of alternative type of knowledge reduction in inconsistent systems. International Journal of Intelligent Systems 16, 105–120 (2001)

    Article  MATH  Google Scholar 

  4. Li, D.Y., Zhang, B., Leung, Y.: On knowledge reduction in inconsistent decision information systems. International Journal of Uncertainty Fuzziness and Knowledge-Based Systems 12(5), 651–672 (2004)

    Article  MATH  Google Scholar 

  5. Mi, J.S., Wu, W.Z., Zhang, W.X.: Comparative studies of knowledge reductions in inconsistent systems. Fuzzy Systems and Mathematics 17(3), 54–60 (2003)

    MATH  Google Scholar 

  6. Skowron, A.: Extracting laws from decision tables: a rough set approach. Computational Intelligence 11, 371–388 (1995)

    Article  Google Scholar 

  7. Qian, Y.H., Liang, J.Y., Dang, C.Y.: Interval ordered information systems. Computers & Mathematics with Applications 56, 1994–2009 (2008)

    Article  MATH  Google Scholar 

  8. Shao, M.W., Zhang, W.X.: Dominance relation and rules in an incomplete ordered information system. International Journal of Intelligent Systems 20, 13–27 (2005)

    Article  MATH  Google Scholar 

  9. Hu, X.H., Cercone, N.: Learning in relational databases: a rough set approach. International Journal of Computational Intelligence 11(2), 323–338 (1995)

    Article  Google Scholar 

  10. Hu, Q.H., Xie, Z.X., Yu, D.R.: Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation. Pattern Recognition 40, 3509–3521 (2007)

    Article  MATH  Google Scholar 

  11. Hu, Q.H., Yu, D.R., Xie, Z.X.: Information-preserving hybrid data reduction based on fuzzy-rough techniques. Pattern Recognition Letters 27(5), 414–423 (2006)

    Article  Google Scholar 

  12. Liang, J.Y., Chin, K.S., Dang, C.Y., Yam Richid, C.M.: A new method for measuring uncertainty and fuzziness in rough set theory. International Journal of General Systems 31(4), 331–342 (2002)

    Article  MATH  Google Scholar 

  13. Liang, J.Y., Xu, Z.B.: The algorithm on knowledge reduction in incomplete information systems. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10(1), 95–103 (2002)

    Article  MATH  Google Scholar 

  14. Qian, Y.H., Liang, J.Y.: Combination entropy and combination granulation in rough set theory. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 16(2), 179–193 (2008)

    Article  MATH  Google Scholar 

  15. Slezak, D.: Approximate entropy reducts. Fundamenta Informaticae 53(3-4), 365–390 (2002)

    MATH  Google Scholar 

  16. Wang, G.Y., Yu, H., Yang, D.C.: Decision table reduction based on conditional information entropy. Chinese Journal of Computers 25(7), 759–766 (2002)

    Google Scholar 

  17. Wang, G.Y., Zhao, J., An, J.J.: A comparative study of algebra viewpoint and information viewpoint in attribute reduction. Fundamenta Informaticae 68(3), 289–301 (2005)

    MATH  Google Scholar 

  18. Wu, S.X., Li, M.Q., Huang, W.T., Liu, S.F.: An improved heuristic algorithm of attribute reduction in rough set. Journal of Systems Science and Information 2(3), 557–562 (2004)

    Google Scholar 

  19. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, System Theory. In: Knowledge Engineering and Problem Solving. Kluwer, Dordrecht (1991)

    Google Scholar 

  20. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177, 3–27 (2007)

    Article  MATH  Google Scholar 

  21. Qian, Y.H., Liang, J.Y., Dang, C.Y.: Converse approximation and rule extration from decision tables in rough set theory. Computers & Mathematics with Applications 55, 1754–1765 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, H., Qian, Y., Liang, J., Wei, W., Wang, F. (2009). A Time-Reduction Strategy to Feature Selection in Rough Set Theory. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02962-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02961-5

  • Online ISBN: 978-3-642-02962-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics