Skip to main content

Heuristic for Attribute Selection Using Belief Discernibility Matrix

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

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

Included in the following conference series:

Abstract

This paper proposes a new heuristic attribute selection method based on rough sets to remove the superfluous attributes from partially uncertain data. We handle uncertainty only in decision attributes (classes) under the belief function framework. The simplification of the uncertain decision table which is based on belief discernibility matrix generates more significant attributes with fewer computations without making significant sacrifices in classification accuracy.

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. Bauer, M.: Approximations algorithm and decision making in the Dempster-Shafer theory of evidence - an empirical study. IJAR 17(2-3), 217–237 (1997)

    MATH  Google Scholar 

  2. Bosse, E., Jousseleme, A.L., Grenier, D.: A new distance between two bodies of evidence. Information Fusion 2, 91–101 (2001)

    Article  Google Scholar 

  3. Elouedi, Z., Mellouli, K., Smets, P.: Assessing sensor reliability for multisensor data fusion within the transferable belief model. IEEE Trans. Syst. Man Cyben. 34(1), 782–787 (2004)

    Article  Google Scholar 

  4. Fixen, D., Mahler, R.P.S.: The modified Dempster-Shafer approach to classification. IEEE Trans. Syst. Man Cybern. 27(1), 96–104 (1997)

    Article  Google Scholar 

  5. Modrzejewski, M.: Feature selection using rough sets theory. In: Proceedings of the 11th International Conference on Machine Learning, pp. 213–226 (1993)

    Google Scholar 

  6. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  7. Pawlak, Z., Zdzislaw, A.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishing, Dordrecht (1991) ISBN 0-7923-1472-7

    MATH  Google Scholar 

  8. Pawlak, Z., Rauszer, C.M.: Dependency of attributes in Information systems. Bull. Polish Acad. Sci., Math. 33, 551–559 (1985)

    MathSciNet  MATH  Google Scholar 

  9. Rauszer, C.M.: Reducts in Information systems. Fundamenta Informaticae (1990)

    Google Scholar 

  10. Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  11. Smets, P., Kennes, R.: The transferable belief model. Artificial Intelligence 66, 191–236 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256–278 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  13. Smets, P.: The transferable belief model for quantified belief representation. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1, pp. 207–301. Kluwer, Doordrecht (1998)

    Google Scholar 

  14. Tanaka, H., Ishibuchi, H., Matuda, N.: Reduction of information system based on rough sets and its application to fuzzy expert system. Advancement of Fuzzy Theory and Systems in china and Japan (1990)

    Google Scholar 

  15. Tessem, B.: Approximations for efficient computation in the theory of evidence. Artif. Intell 61(2), 315–329 (1993)

    Article  MathSciNet  Google Scholar 

  16. Trabelsi, S., Elouedi, Z.: Heuristic method for attribute selection from partially uncertain data using rough sets. International Journal of General Systems 39(3), 271–290 (2010)

    Article  MATH  Google Scholar 

  17. Trabelsi, S., Elouedi, Z.: Attribute selection from partially uncertain data using rough sets. In: The Third International Conference on Modeling Simulation, and Applied Optimization, UAE, January 20-22 (2009)

    Google Scholar 

  18. Trabelsi, S., Elouedi, Z., Lingras, P.: Belief Rough Set Classifier. In: Gao, Y., Japkowicz, N. (eds.) AI 2009. LNCS (LNAI), vol. 5549, pp. 257–261. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Wroblewski, J.: Finding minimal reducts using genetic algorithms. In: Proceedings of the 2nd Annual Joint Conference on Information Sciences, pp. 186–189 (1995)

    Google Scholar 

  20. Zhong, N., Dong, J.Z., Ohsuga, S.: Using Rough Sets with Heuristics for Feature Selection. Journal of Intelligent Information Systems 16(3), 199–214 (2001)

    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

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trabelsi, S., Elouedi, Z., Lingras, P. (2012). Heuristic for Attribute Selection Using Belief Discernibility Matrix. In: Li, T., et al. Rough Sets and Knowledge Technology. RSKT 2012. Lecture Notes in Computer Science(), vol 7414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31900-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31900-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31899-3

  • Online ISBN: 978-3-642-31900-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics