Skip to main content

Scalable Improved Quick Reduct: Sample Based

  • 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:

  • 1519 Accesses

Abstract

This paper develops an iterative sample based Improved Quick Reduct algorithm with Information Gain heuristic approach for recommending a quality reduct for large decision tables. The Methodology and its performance have been demonstrated by considering large datasets. It is recommended to use roughly 5 to 10% data size for obtaining an apt reduct.

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.

Similar content being viewed by others

References

  1. Feature Selection in wikipedia, http://en.wikipedia.org/wiki/Feature_selection

  2. Bellman, R.E.: Adaptive Control Processes: a guided toor. Princeton University Press (1961)

    Google Scholar 

  3. Liu, H., Motoda, H., Yu, L.: Feature selection with selective sampling. In: Proceedings of the Nineteenth International Conference on Machine Learning, pp. 395–402 (2002)

    Google Scholar 

  4. Yang, J., Olafsson, S.: Optimization based feature selection using adaptive instance sampling. Computers & Operational Research 33(11), 3088–3106 (2006)

    Article  MATH  Google Scholar 

  5. Pawlak, Z.: Rough Sets: Theoretical Aspects and Reasoning about Data. Kluwer Academic Publications (1991)

    Google Scholar 

  6. Jensen, R., Shen, Q.: Rough set based featureselection: A review. In: Hassanien, A.E., Suraj, Z., Slezak, D., Lingras, P. (eds.) Rough Computing: Theories, Technologies and Applications. IGI global (2007)

    Google Scholar 

  7. Nguyen, H.S., Skowron, A.: Boolean Reasoning for Feature Extraction Problems. In: Raś, Z.W., Skowron, A. (eds.) ISMIS 1997. LNCS, vol. 1325, pp. 117–126. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Chouchoulas, A., Shen, Q.: Rough Set-Aided Keyword Reduction for Text Categorization. Applied Artificial Intelligence 15(9), 843–873 (2001)

    Article  Google Scholar 

  9. Sai Prasad, P.S.V.S., Raghavendra Rao, C.: IQuickReduct: An Improvement to Quick Reduct Algorithm. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS (LNAI), vol. 5908, pp. 152–159. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Sai Prasad, P.S.V.S., Raghavendra Rao, C.: Extensions to iQuickReduct. In: Sombattheera, C., Agarwal, A., Udgata, S.K., Lavangnananda, K. (eds.) MIWAI 2011. LNCS, vol. 7080, pp. 351–362. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Strąkowski, T., Rybiński, H.: A New Approach to Distributed Algorithms for Reduct Calculation. In: Peters, J.F., Skowron, A., Rybiński, H. (eds.) Transactions on Rough Sets IX. LNCS, vol. 5390, pp. 365–378. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Hu, K., Lu, Y., Shi, C.: Feature Ranking in Rough Sets. AI Communications 16, 41–50 (2003)

    Google Scholar 

  13. Boussouf, M., Quafafou, M.: Scalable Feature Selection Using Rough Set Theory. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 131–138. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Slezak, D.: Approximate Entropy Reducts. Fundamenta Informatica 53(3-4), 365–390 (2002)

    MathSciNet  Google Scholar 

  15. Wang, P.: Highly Scalable Rough Set Reducts Generation. Journal of Information Science and Engineering 23, 1281–1298 (2007)

    Google Scholar 

  16. Mi, J.-S., Wu, W.-Z., Zhang, W.-X.: Approaches to knowledge reduction based on variable precision rough set model. Information Sciences 159, 255–272 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Datasets for feature selection, http://featureselection.asu.edu/datasets.php

  18. UCI machine learning repository, http://archive.ics.uci.edu/ml/

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

Sai Prasad, P.S.V.S., Raghavendra Rao, C. (2012). Scalable Improved Quick Reduct: Sample Based. 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_5

Download citation

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

  • 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