Skip to main navigation Skip to search Skip to main content

Foundations of rough biclustering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Citations (Scopus)

Abstract

Amongst the algorithms for biclustering using some rough sets based steps none of them uses the formal concept of rough bicluster with its lower and upper approximation. In this short article the new foundations of rough biclustering are described. The new relation β generates β-description classes that build the rough bicluster defined with its lower and upper approximation.

Original languageEnglish
Title of host publicationArtificial Intelligence and Soft Computing - 11th International Conference, ICAISC 2012, Proceedings
PublisherSpringer Verlag
Pages144-151
Number of pages8
EditionPART 2
ISBN (Print)9783642293498
DOIs
Publication statusPublished - 2012
Event11th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2012 - Zakopane, Poland
Duration: 29 Apr 2012 → 3 May 2012

Publication series

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

Conference

Conference11th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2012
Country/TerritoryPoland
CityZakopane
Period29/04/12 → 3/05/12

Keywords

  • biclustering
  • rough sets
  • upper and lower approximation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Cite this