7123 search results - page 65 / 1425 » The Ordered Set of Rough Sets |
ISMIS
2003
Springer
14 years 3 months ago
2003
Springer
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
RSCTC
1993
Springer
14 years 2 months ago
1993
Springer
This paper focuses on the application of rough set constructs to inductive learning from a database. A design guideline is suggested, which provides users the option to choose app...
RSCTC
2000
Springer
14 years 1 months ago
2000
Springer
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
ENDM
2006
13 years 10 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
COMBINATORICS
2000
13 years 9 months ago
2000
The lattice of the set partitions of [n] ordered by refinement is studied. Suppose r partitions p1, . . . , pr are chosen independently and uniformly at random. The probability tha...