Sciweavers

61 search results - page 6 / 13
» Rough Set Approximation as Formal Concept
Sort
View
AIIA
2005
Springer
14 years 1 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
FUIN
2006
88views more  FUIN 2006»
13 years 7 months ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...
FSS
2008
113views more  FSS 2008»
13 years 7 months ago
Consistency measure, inclusion degree and fuzzy measure in decision tables
Classical consistency degree has some limitations for measuring the consistency of a decision table, in which the lower approximation of a target decision is only taken into consi...
Yuhua Qian, Jiye Liang, Chuangyin Dang
APSEC
2000
IEEE
14 years 2 days ago
Fuzzy concepts and formal methods: some illustrative examples
It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modell...
Chris Matthews, Paul A. Swatman
CLA
2007
13 years 9 months ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil