Skip to main navigation Skip to search Skip to main content

Fuzzy concept lattices determined by (θ,σ)-fuzzy rough approximation operators

  • Yan Qing Yao*
  • , Ju Sheng Mi
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Formal concept analysis and rough set analysis are two complementary approaches for analyzing data. This paper studies approaches to constructing fuzzy concept lattices based on generalized fuzzy rough approximation operators. For a Lukasiewicz implicator θ and its dual σ, a pair of (θ,σ)-fuzzy rough approximation operators is defined. We then propose three kinds of fuzzy Galois connections, and examine some of their basic properties. Thus, three complete fuzzy concept lattices can be produced, for which the properties are analogous to those of the classical concept lattices.

Original languageEnglish
Title of host publicationRough Sets and Knowledge Technology - 4th International Conference, RSKT 2009, Proceedings
Pages601-609
Number of pages9
DOIs
StatePublished - 2009
Externally publishedYes
Event4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009 - Gold Coast, QLD, Australia
Duration: 14 Jul 200916 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5589 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Rough Sets and Knowledge Technology, RSKT 2009
Country/TerritoryAustralia
CityGold Coast, QLD
Period14/07/0916/07/09

Keywords

  • (θand σ)-fuzzy rough sets
  • Approximation operators
  • Fuzzy concept lattices
  • Lukasiewicz implicator

Fingerprint

Dive into the research topics of 'Fuzzy concept lattices determined by (θ,σ)-fuzzy rough approximation operators'. Together they form a unique fingerprint.

Cite this