| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6858778 | International Journal of Approximate Reasoning | 2018 | 20 Pages |
Abstract
The problem of optimal quantitative approximation of an arbitrary binary relation by a partial order is discussed and some solutions are provided. It is shown that even for a very simple quantitative measure the problem is NP-hard. Some quantitative metrics are also applied for known property-driven approximations by partial orders. Some relationship to Rough Sets is discussed.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Ryszard Janicki,