All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Isotone fuzzy Galois connections with hedges

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F11%3A10225432" target="_blank" >RIV/61989592:15310/11:10225432 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.ins.2010.11.011" target="_blank" >http://dx.doi.org/10.1016/j.ins.2010.11.011</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ins.2010.11.011" target="_blank" >10.1016/j.ins.2010.11.011</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Isotone fuzzy Galois connections with hedges

  • Original language description

    We study isotone fuzzy Galois connections and concept lattices parameterized by particular unary operators. The operators represent linguistic hedges such as "very", "rather", "more or less", etc. Isotone fuzzy Galois connections and concept lattices provide an alternative to their antitone counterparts which are the fundamental structures behind formal concept analysis of data with fuzzy attributes. We show that hedges enable us to control the number of formal concepts in the associated concept lattice. We also describe the structure of the concept lattice and provide a counterpoint to the main theorem of concept lattices.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F10%2F0262" target="_blank" >GAP202/10/0262: Decompositions of matrices with binary and ordinal data: theory, algorithms, and complexity</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2011

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Information Sciences

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    181

  • Issue of the periodical within the volume

    10

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    14

  • Pages from-to

    1804-1817

  • UT code for WoS article

    000288833300004

  • EID of the result in the Scopus database