Advertisement

Generation of Reducts and Threshold Functions Using Discernibility and Indiscernibility Matrices for Classification

  • Naohiro IshiiEmail author
  • Ippei Torii
  • Kazunori Iwata
  • Kazuya Odagiri
  • Toyoshiro Nakashima
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 650)

Abstract

Dimension reduction of data is an important issue in the data processing and it is needed for the analysis of higher dimensional data in the application domain. 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. In this paper, generations of reducts and threshold functions are developed for the classification system. The reduct followed by the nearest neighbor method or threshold functions is useful for the reduct classification system. For the classification, a nearest neighbor relation with minimal distance proposed here has a fundamental information for classification. Then, the nearest neighbor relation plays a fundamental role on the discernibility and in discernibility matrices, in which the indiscernibility matrix is proposed here to test the sufficient condition for reduct and threshold function. Then, generation methods for the reducts and threshold functions based on the nearest neighbor relation are proposed here using Boolean operations on the discernibility and the indiscernibility matrices.

Keywords

Reduct Threshold function Nearest neighbor relation Discernibility matrix Indiscernibility matrix 

References

  1. 1.
    Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)CrossRefzbMATHGoogle Scholar
  2. 2.
    Pawlak, Z., Slowinski, R.: Rough set approach to multi-attribute decision analysis. Eur. J. Oper. Res. 72, 443–459 (1994)CrossRefzbMATHGoogle Scholar
  3. 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. 4.
    Skowron, A., Polkowski, L.: Decision algorithms, a survey of rough set theoretic methods. Fundamenta Informatica 30(3-4), 345–358 (1997)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Meghabghab, G., Kandel, A.: Search Engines, Link Analysis, and User’s Web Behavior. Springer, Heidelberg (2008)CrossRefzbMATHGoogle Scholar
  6. 6.
    Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21–27 (1967)CrossRefzbMATHGoogle Scholar
  7. 7.
    Ishii, N., Morioka, Y., Bao, Y., Tanaka, H.: Control of variables in reducts-kNN classification with confidence. In: KES 2011. LNCS, vol. 6884, pp. 98–107. Springer (2011)Google Scholar
  8. 8.
    Ishii, N., Torii, I., Bao, Y., Tanaka, H.: Modified reduct nearest neighbor classification. Proc. ACIS-ICIS, IEEE Comp. Soc. 310–315 (2012)Google Scholar
  9. 9.
    Ishii, N., Torii, I., Mukai, N., Iwata, K., Nakashima, T.: Classification on nonlinear mapping of reducts based on nearest neighbor relation. Proc. ACIS-ICIS IEEE Comp. Soc. 491–496 (2015)Google Scholar
  10. 10.
    Levitin, A.V.: Introduction to the Design and Analysis of Algorithms. Addison Wesley, Boston (2002)Google Scholar
  11. 11.
    De, A., Diakonikolas, I., Feldman, V., Servedio, R.A.: Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. J. ACM 61(2), 11:1–11:36 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Hu, S.T.: Threshold Logic. University of California Press, Berkeley (1965)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Naohiro Ishii
    • 1
    Email author
  • Ippei Torii
    • 1
  • Kazunori Iwata
    • 2
  • Kazuya Odagiri
    • 3
  • Toyoshiro Nakashima
    • 3
  1. 1.Aichi Institute of TechnologyToyotaJapan
  2. 2.Aichi UniversityNagoyaJapan
  3. 3.Sugiyama Jyogakuen UniversityNagoyaJapan

Personalised recommendations