Determining of an Estimate of the Equivalence Relation on the Basis of Pairwise Comparisons

Conference paper
First Online:
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 578)

Abstract

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.

Keywords

Estimation of the equivalence relation Pairwise comparisons Nearest adjoining order idea 

References

  1. 1.
    Chopra, R., Rao, M.R.: The partition problem. Math. Program. 59, 87–115 (1993)CrossRefMATHGoogle Scholar
  2. 2.
    David, H.A.: The Method of Paired Comparisons, 2nd edn. Charles Griffin, London (1988)MATHGoogle Scholar
  3. 3.
    Gordon, A.D.: Classification, 2nd edn. Chapman&Hall/CRC, Boca Raton (1999)MATHGoogle Scholar
  4. 4.
    Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79, 191–215 (1997)MathSciNetMATHGoogle Scholar
  5. 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
  6. 6.
    Hoeffding, W.: Probability inequalities for sums of bounded random variables. JASA 58, 13–30 (1963)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Klukowski, L.: Some probabilistic properties of the nearest adjoining order method and its extensions. Ann. Oper. Res. 51, 241–261 (1994)MathSciNetCrossRefMATHGoogle Scholar
  8. 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. 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
  10. 10.
    Rao, M.R.: Cluster analysis and mathematical programming. J. Am. Stat. Assoc. 66, 622–626 (1971)CrossRefMATHGoogle Scholar
  11. 11.
    Slater, P.: Inconsistencies in a schedule of paired comparisons. Biometrika 48, 303–312 (1961)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Systems Research Institute Polish Academy of SciencesWarsawPoland

Personalised recommendations