Conference
Optimal Approximations with Rough Sets
Abstract
When arbitrary sets are approximated by more structured sets, it may not be possible to obtain an exact approximation that is equivalent to a given set. A proposal is presented for a ‘metric’ approach to Rough Sets. This includes a definition of the ‘optimal’ or best approximation with respect to a measure of similarity, and an algorithm to find it using the Jaccard Index. A definition of consistency also allows the algorithm to work for a …
Authors
Janicki R; Lenarčič A
Series
Lecture Notes in Computer Science
Volume
8171
Pagination
pp. 87-98
Publisher
Springer Nature
Publication Date
2013
DOI
10.1007/978-3-642-41299-8_9
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743