A non-boolean lattice derived by double indiscernibility

Yukio Pegio Gunji*, Taichi Haruna

*この研究の対応する著者

研究成果: Conference contribution

17 被引用数 (Scopus)

抄録

The central notion of a rough set is the indiscernibility that is based on an equivalence relation. Because an equivalence relation shows strong bondage in an equivalence class, it forms a Galois connection and the difference between the upper and lower approximations is lost. Here, we introduce two different equivalence relations, one for the upper approximation and one for the lower approximation, and construct a composite approximation operator consisting of different equivalence relations. We show that a collection of fixed points with respect to the operator is a lattice and there exists a representation theorem for that construction.

本文言語English
ホスト出版物のタイトルTransactions on Rough Sets XII
ページ211-225
ページ数15
DOI
出版ステータスPublished - 2010
外部発表はい
イベントRough Set and Knowledge Technology Conference, RSKT 2008 - Chengdu, China
継続期間: 2008 5月 12008 5月 1

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6190 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

ConferenceRough Set and Knowledge Technology Conference, RSKT 2008
国/地域China
CityChengdu
Period08/5/108/5/1

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A non-boolean lattice derived by double indiscernibility」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル