Chapter
On Efficacy of Approximating Arbitrary Relations by Partial Orders
Abstract
The problem of optimal quantitative approximation of an arbitrary binary relation by a partial order is discussed and the results of some experiments are discussed. In general, this problem is NP-hard even for very simple quantitative measures, so some alternative sub-optimal but relatively efficient algorithms are discussed and tested.
Authors
Janicki R; Yang N
Book title
Information Processing and Management of Uncertainty in Knowledge-Based Systems
Series
Lecture Notes in Networks and Systems
Volume
1174
Pagination
pp. 310-320
Publisher
Springer Nature
Publication Date
2024
DOI
10.1007/978-3-031-74003-9_25