Determining of an Estimate of the Equivalence Relation on the Basis of Pairwise Comparisons
The paper presents two approaches for solving of a discrete programming problem necessary for determining of estimates of the equivalence relation on the basis of pairwise comparisons with random errors. The problem minimizes sum of absolute differences between relation form and comparisons. The problem is NP hard and can be solved with the use of exact algorithms for moderate size of sets - about 50 elements. In the case of larger sets, at least 100 elements and/or multiple comparisons, it is necessary to apply heuristic algorithms. The paper presents original results: a statistical preprocessing, based on two tests proposed, which allows determining of the optimal or suboptimal solution for large sets with acceptable computational cost.
KeywordsEstimation of the equivalence relation Pairwise comparisons Nearest adjoining order idea
- 5.Hansen, P., Jaumard, B., Sanlaville, E.: Partitioning problems in cluster analysis: a review of mathematical programming approaches. In: Diday, E., et al. (eds.) Studies in Classification, Data Analysis, and Knowledge Organization. New Approaches in Classification and Data Analysis, pp. 228–240. Springer, Heidelberg (1994)CrossRefGoogle Scholar
- 8.Klukowski, L.: Methods of estimation of relations of: equivalence, tolerance, and preference in a finite set. IBS PAN, Series: Systems Research, vol. 69, Warsaw (2011)Google Scholar
- 9.Klukowski, L.: Estimation of the relations of equivalence, tolerance and preference on the basis of pairwise comparisons. In: Burduk, R., et al. (eds.) CORES 2013. Springer, Cham (2013)Google Scholar