\(S\)-approximation: a new approach to algebraic approximation (Q2249956): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of fuzzy logic in the management of uncertainty in expert systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough sets: probabilistic versus deterministic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two views of the theory of rough sets in finite universes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Probabilities Induced by a Multivalued Mapping / rank
 
Normal rank

Latest revision as of 17:00, 8 July 2024

scientific article
Language Label Description Also known as
English
\(S\)-approximation: a new approach to algebraic approximation
scientific article

    Statements

    \(S\)-approximation: a new approach to algebraic approximation (English)
    0 references
    0 references
    4 July 2014
    0 references
    Summary: We intend to study a new class of algebraic approximations, called \(S\)-approximations, and their properties. We have shown that \(S\)-approximations can be used for applied problems which cannot be modeled by inclusion based approximations. Also, in this work, we studied a subclass of \(S\)-approximations, called \(S_{\mathcal{M}}\)-approximations, and showed that this subclass preserves most of the properties of inclusion based approximations but is not necessarily inclusion based. The paper concludes by studying some basic operations on \(S\)-approximations and counting the number of \(S\)-min functions.
    0 references
    \(S\)-approximation
    0 references
    \(S\)-min function
    0 references

    Identifiers