Formal rough concept analysis

Jamil Saquer, Jitender S Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

50 Citations (Scopus)

Abstract

In this paper, we present a novel approach for approximating concepts in the framework of formal concept analysis. Two main problems are investigated. The first, given a set A of objects (or a set B of features), we want to find a formal concept that approximates A (or B). The second, given a pair (A,B), where A is a set of objects and B is a set of features, the objective is to find formal concepts that approximate (A,B). The techniques developed in this paper use ideas from rough set theory. The approach we present is different and more general than existing approaches.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages91-99
Number of pages9
Volume1711
ISBN (Print)3540666451, 9783540666455
DOIs
StatePublished - 1999
Event7th International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999 - Yamaguchi, Japan
Duration: Nov 9 1999Nov 11 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1711
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999
CountryJapan
CityYamaguchi
Period11/9/9911/11/99

Fingerprint

Formal concept analysis
Rough set theory
Rough
Formal Concept Analysis
Rough Set Theory
Concepts
Object

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Saquer, J., & Deogun, J. S. (1999). Formal rough concept analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1711, pp. 91-99). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1711). Springer Verlag. https://doi.org/10.1007/978-3-540-48061-7_13

Formal rough concept analysis. / Saquer, Jamil; Deogun, Jitender S.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1711 Springer Verlag, 1999. p. 91-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1711).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Saquer, J & Deogun, JS 1999, Formal rough concept analysis. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1711, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1711, Springer Verlag, pp. 91-99, 7th International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, RSFDGrC 1999, Yamaguchi, Japan, 11/9/99. https://doi.org/10.1007/978-3-540-48061-7_13
Saquer J, Deogun JS. Formal rough concept analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1711. Springer Verlag. 1999. p. 91-99. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-48061-7_13
Saquer, Jamil ; Deogun, Jitender S. / Formal rough concept analysis. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1711 Springer Verlag, 1999. pp. 91-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d96e7477bb534896b824137ba56f4f6e,
title = "Formal rough concept analysis",
abstract = "In this paper, we present a novel approach for approximating concepts in the framework of formal concept analysis. Two main problems are investigated. The first, given a set A of objects (or a set B of features), we want to find a formal concept that approximates A (or B). The second, given a pair (A,B), where A is a set of objects and B is a set of features, the objective is to find formal concepts that approximate (A,B). The techniques developed in this paper use ideas from rough set theory. The approach we present is different and more general than existing approaches.",
author = "Jamil Saquer and Deogun, {Jitender S}",
year = "1999",
doi = "10.1007/978-3-540-48061-7_13",
language = "English (US)",
isbn = "3540666451",
volume = "1711",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "91--99",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Formal rough concept analysis

AU - Saquer, Jamil

AU - Deogun, Jitender S

PY - 1999

Y1 - 1999

N2 - In this paper, we present a novel approach for approximating concepts in the framework of formal concept analysis. Two main problems are investigated. The first, given a set A of objects (or a set B of features), we want to find a formal concept that approximates A (or B). The second, given a pair (A,B), where A is a set of objects and B is a set of features, the objective is to find formal concepts that approximate (A,B). The techniques developed in this paper use ideas from rough set theory. The approach we present is different and more general than existing approaches.

AB - In this paper, we present a novel approach for approximating concepts in the framework of formal concept analysis. Two main problems are investigated. The first, given a set A of objects (or a set B of features), we want to find a formal concept that approximates A (or B). The second, given a pair (A,B), where A is a set of objects and B is a set of features, the objective is to find formal concepts that approximate (A,B). The techniques developed in this paper use ideas from rough set theory. The approach we present is different and more general than existing approaches.

UR - http://www.scopus.com/inward/record.url?scp=84958053871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958053871&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-48061-7_13

DO - 10.1007/978-3-540-48061-7_13

M3 - Conference contribution

SN - 3540666451

SN - 9783540666455

VL - 1711

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 91

EP - 99

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -