Skip to main content

Applying PSO in Finding Useful Features

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

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

Included in the following conference series:

Abstract

In data mining and knowledge discovery, the curse of dimensionality is a damning factor for numerous potentially powerful machine learning techniques, while rough set theory can be employed to reduce the dimensionality of datasets as a preprocessing step. For rough set based methods, finding reducts is an essential step, yet it is of high complexity. In this paper, based on particle swarm optimization(PSO) which is an optimization algorithm inspired by social behavior of flocks of birds when they are searching for food, a novel method is proposed for finding useful features instead of reducts in rough set theory. Subsequent experiments on UCI show that this method performs well on whole convergence, and can retrieve useful subsets effectively while retaining attributes of high importance as possible.

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. Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Guan, J.W., Bell, D.A.: Rough computational methods for information systems. Artificial Intelligence 103, 77–103 (1998)

    Article  Google Scholar 

  3. Bazan, J., Skowron, A., Synak, P.: Dynamic reducts as a tool for extracting laws from decision tables. In: Proceedings of the Eighth International Symposium on Methodologies for Intelligent Systems, Charlotte, pp. 346–355 (1994)

    Google Scholar 

  4. Bazan, J., Skowron, A., Synak, P.: Market data analysis: A rough set approach. ICS Research Report 6/94, Warsaw University of Technology

    Google Scholar 

  5. Zhang, X., Zhang, F., Li, M., et al.: Research of optimal reduct under preference. Journal of Computer Engineering and Design 8, 2103–2106 (2005)

    Google Scholar 

  6. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, Nagoya, pp. 39–43 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, Y., Zhang, X., Jia, S., Zhang, F. (2006). Applying PSO in Finding Useful Features. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_84

Download citation

  • DOI: https://doi.org/10.1007/11795131_84

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36297-5

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics