Skip to main content

Generation of Reducts Based on Nearest Neighbor Relation

  • Conference paper
Intelligent Data Engineering and Automated Learning – IDEAL 2014 (IDEAL 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8669))

  • 1529 Accesses

Abstract

Dimension reduction of data is an important theme in the data processing and on the web to represent and manipulate higher dimensional data. Rough set is fundamental and useful to process higher dimensional data. Reduct in the rough set is a minimal subset of features, which has the same discernible power as the entire features in the higher dimensional scheme. A nearest neighbor relation with minimal distance proposed here has a basic information for classification. In this paper, a new reduct generation method based on the nearest neighbor relation with minimal distance is proposed. To characterize the classification ability of reducts, we develop a graph mapping method of the nearest neighbor relation, which derives a higher 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. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Science 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pawlak, Z., Slowinski, R.: Rough Set Approach to Multi-attribute Decision Analysis. European Journal of Operations Research 72, 443–459 (1994)

    Article  MATH  Google Scholar 

  3. Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Intelligent Decision Support-Handbook of Application and Advances of Rough Sets Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  4. Skowron, A., Polkowski, L.: Decision Algorithms, A Survey of Rough Set Theoretic Methods. Fundamenta Informatica 30(3-4), 345–358 (1997)

    MathSciNet  MATH  Google Scholar 

  5. Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Information Science 177, 41–73 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cover, T.M., Hart, P.E.: Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory 13(1), 21–27 (1967)

    Article  MATH  Google Scholar 

  7. Ishii, N., Morioka, Y., Bao, Y., Tanaka, H.: Control of Variables in Reducts - kNN Classification with Confidence. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds.) KES 2011, Part IV. LNCS, vol. 6884, pp. 98–107. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Ishii, N., Torii, I., Bao, Y., Tanaka, H.: Modified Reduct Nearest Neighbor Classification. In: ACIS-ICIS, pp. 310–315. IEEE Comp. Soc. (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ishii, N., Torii, I., Iwata, K., Nakashima, T. (2014). Generation of Reducts Based on Nearest Neighbor Relation. In: Corchado, E., Lozano, J.A., Quintián, H., Yin, H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2014. IDEAL 2014. Lecture Notes in Computer Science, vol 8669. Springer, Cham. https://doi.org/10.1007/978-3-319-10840-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10840-7_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10839-1

  • Online ISBN: 978-3-319-10840-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics