• DocumentCode
    344647
  • Title

    The Occam´s razor principle for degenerate selfguessing fuzzy classifiers

  • Author

    Vatlin, Sergei

  • Author_Institution
    Res. Center for Med. Technol. Comput. Syst., Adm. & Manage. of Health, Minsk, Byelorussia
  • Volume
    2
  • fYear
    1999
  • fDate
    22-25 Aug. 1999
  • Firstpage
    1092
  • Abstract
    Let G/sub 1/, C/sub 2//spl epsiv/DSg (/spl Theta/) be arbitrary degenerate self-guessing (for fixed learning set /spl Theta/) fuzzy classifiers. We\´ll say that G/sub 2/ is more effective than G/sub 1/ iff the performance of G/sub 2/ is higher than G/sub 1/. The problem of choice the "best" fuzzy classifier from DSg (/spl Theta/) set is considered. The unambiguous concept of simplicity and the possible interpretation of the simplicity (Occam\´s razor) principle for degenerate fuzzy classifiers are introduced. The quality criterion for fuzzy classifiers from DSg (/spl Theta/) is proved.
  • Keywords
    fuzzy set theory; pattern classification; Occam razor; degenerate self-guessing fuzzy classifiers; degenerate selfguessing fuzzy classifiers; fixed learning set; Approximation algorithms; Data processing; Fuzzy sets; Fuzzy systems; Heuristic algorithms; Machine learning; Machine learning algorithms; Neural networks; Target recognition; Technology management;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fuzzy Systems Conference Proceedings, 1999. FUZZ-IEEE '99. 1999 IEEE International
  • Conference_Location
    Seoul, South Korea
  • ISSN
    1098-7584
  • Print_ISBN
    0-7803-5406-0
  • Type

    conf

  • DOI
    10.1109/FUZZY.1999.793106
  • Filename
    793106