Number of the records: 1  

Degree of Coverage of Radial Rule Bases

  1. 1.
    SYSNO ASEP0453676
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleDegree of Coverage of Radial Rule Bases
    Author(s) Coufal, David (UIVT-O) RID, SAI, ORCID
    Source TitleNAFIPS 2015. Proceedings of the 2015 Annual Meeting of the North American Fuzzy Information Processing Society. - Piscataway : IEEE, 2015 - ISBN 978-1-4673-7249-7
    Pagess. 1-6
    Number of pages6 s.
    Publication formOnline - E
    ActionNAFIPS 2015. Annual Meeting of the North American
    Event date17.08.2015-19.08.2015
    VEvent locationRedmond
    CountryUS - United States
    Event typeWRD
    Languageeng - English
    CountryUS - United States
    Keywordsradial fuzzy systems ; convex optimization
    Subject RIVIN - Informatics, Computer Science
    R&D ProjectsLD13002 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000380566200018
    EID SCOPUS84961961841
    DOI10.1109/NAFIPS-WConSC.2015.7284141
    AnnotationThe paper discusses how a rule base covers its input space in radial fuzzy systems. We investigate the minimal degree of firing of rules in the rule base when moving across the input space. This minimal degree is called the degree of coverage (DOC) and refers to the area of the input space where the rule base has the weakest explanatory power. Identification of the DOC corresponds to a constrained optimization problem. Whilst in general case solving this problem may be hard, in the radial fuzzy systems it may be eased by passing to convex optimization, however, at the cost of getting only a lower bound on the DOC. Moreover, we introduce an algorithm to check out different lower bounds on the DOC for the case of the specific radial rule bases.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2016
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.