Skip to main content
SpringerLink
Log in

A L1 based probabilistic merging algorithm and its application to statistical matching

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

We propose to use a recently introduced merging procedure for jointly inconsistent probabilistic assessments to the statistical matching problem. The merging procedure is based on an efficient L1 distance minimization through mixed-integer linear programming. Significance of the method can be appreciated whenever among quantities (events) there are logical (structural) constraints and there are different sources of information. Statistical matching problem has these features and is characterized by a set of random (discrete) variables that cannot be jointly observed. Separate observations share anyhow some common variable, and this, together with structural constraints, make sometimes inconsistent the estimates of probability occurrences. Even though estimates on statistical matching are mainly conditional probabilities, inconsistencies appear only on events with the same conditioning, hence the correction procedure can be easily reduced to unconditional cases and the aforementioned procedure applied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. rounded to the 3-rd decimal digit

References

  1. Baioletti M, Capotorti A, Tulipani S, Vantaggi B (2000) Elimination of Boolean variables for probabilistic coherence. Soft Comput 4(2):81–88

    Article  Google Scholar 

  2. Baioletti M, Capotorti A, Tulipani S, Vantaggi B (2002) Simplification rules for the coherent probability assessment problem. Ann Math Artif Intell 35:11–28

    Article  MathSciNet  MATH  Google Scholar 

  3. Baioletti M, Capotorti A, Tulipani S (2005) An empirical complexity study for a 2CPA solver. In: Bouchon-meunier B, Coletti G, Yager RR (eds) Modern information processing: from theory to applications, pp 1–12

  4. Baioletti M, Capotorti A (2015) Efficient L1-based probability assessments correction: algorithms and applications to belief merging and revision. In: ISIPTA’15 Proc of the 9th international symposium on imprecise probability: theories and applications. Pescara (IT), ARACNE, pp 37–46

  5. Brozzi A, Capotorti A, Vantaggi B (2012) Incoherence correction strategies in statistical matching. Int J Approx Reason 53(8):1124–1136

    Article  MathSciNet  MATH  Google Scholar 

  6. Capotorti A (2012) A further empirical study on the Over-Performance of estimate correction in statistical matching. In: Greco S, Bouchon-Meunier B, Coletti G, Fedrizzi M, Matarazzo B, Yager RR (eds) Advances in computational intelligence. Springer, Berlin, pp 124–133

  7. Capotorti A, Vantaggi B (2011) Incoherence correction strategies in statistical matching. In: ISIPTA’11 Proc of the 7th international symposium on imprecise probability: theories and applications. Innsbruck, SIPTA, pp 109–11

  8. Coletti G (1994) Coherent numerical and ordinal probabilistic assessments. IEEE Trans Syst Man Cybern 24:1747–1754

    Article  MathSciNet  MATH  Google Scholar 

  9. Coletti G, Scozzafava R (2002) Probabilistic logic in a coherent setting. Dordrecht, Series “Trends in Logic”

    Book  MATH  Google Scholar 

  10. Cozman FG, Fargonidi Ianni L (2013) Probabilistic satisfiability and coherence checking through integer programming. Lect Notes Comput Sci 7958:145–156

    Article  MathSciNet  MATH  Google Scholar 

  11. Cozman FG, Fargonidi Ianni L (2015) Probabilistic satisfiability and coherence checking through integer programming. Int J Approx Reason 58:57–70

    Article  MATH  Google Scholar 

  12. de Finetti B (1974) Teoria della probabilità Torino: Einaudi, 1970, Engl. transl. Theory of probability. Wiley, London

    Google Scholar 

  13. D’Orazio M, Di Zio M, Scanu M (2006) Statistical matching: theory and practice. Wiley, New York

    Book  MATH  Google Scholar 

  14. D’Orazio M, Di Zio M, Scanu M (2006) Statistical matching for categorical data: displaying uncertainty and using logical constraints. J Off Stat 22:137–157

    Google Scholar 

  15. Finger M, De Bona G (2011) Probabilistic satisfiability: logic based algorithms and phase transition. IJCAI, pp 528–533

  16. Fukuda K (2011) Lecture: Polyhedral Computation, Spring. Institute for operations research and institute of theoretical computer science. ETH Zurich. Available on-line at http://stat.ethz.ch/ifor/teaching/lectures/poly_comp_ss11/lecture_notes

  17. Gärdenfors P, Rott H (1995) Belief revision. In: Handbook of logic in artificial intelligence and logic programming, vol 4. Oxford University Press, pp 35–132

  18. Georgakopoulos G, Kavvadias D, Papadimitriou CH (1988) Probabilistic satisfiability. J Complex 4:1–11

    Article  MathSciNet  MATH  Google Scholar 

  19. Gilio A, Pfeifer N, Sanfilippo G (2016) Transitivity in coherence-based probability logic. J Appl Log 14:46–64

    Article  MathSciNet  MATH  Google Scholar 

  20. Jaumard B, Hansen P, Poggi de Aragão M (1991) Column generation methods for probabilistic logic. ORSA J Comput 3(2):135–148

    Article  MATH  Google Scholar 

  21. Karlsson A, Johansson R, Andler SF (2011) Characterization and empirical evaluation of bayesian and credal combination operators. J Adv Inf Fusion 6(2):150–166

    Google Scholar 

  22. Lad F (1996) Operational subjective statistical methods: a mathematical, philosophical, and historical introduction. Wiley, New York

    MATH  Google Scholar 

  23. Murty KG, Al-Sultan KS (1989) On relationship between l 1, l 2, l ∞ minima. Technical Report 89-26, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor

    Google Scholar 

  24. Pretolani D (2005) Probability logic and optimization SAT: the PSAT and CPA models. Ann Math Artif Intell 43:211–221

    Article  MathSciNet  MATH  Google Scholar 

  25. Skulj D (2006) Jeffrey’s conditioning rule in neighbourhood models. Int J Approx Reasoning 42(3):192–211

    Article  MathSciNet  MATH  Google Scholar 

  26. Vantaggi B (2008) Statistical matching of multiple sources: a look through coherence. Int J Approx Reason 49(3):701–711

    Article  MathSciNet  MATH  Google Scholar 

  27. Walley P (1991) Statistical reasoning with imprecise probabilities. Chapman and Hall, London

    Book  MATH  Google Scholar 

  28. Yue A, Liu W (2008) Revising imprecise probabilistic beliefs in the framework of probabilistic logic programming. AAAI 2008:590–596

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica ed Informatica, Perugia, Italy

    Marco Baioletti & Andrea Capotorti

Authors
  1. Marco Baioletti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Capotorti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marco Baioletti.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baioletti, M., Capotorti, A. A L1 based probabilistic merging algorithm and its application to statistical matching. Appl Intell 49, 112–124 (2019). https://doi.org/10.1007/s10489-018-1233-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-018-1233-z

Keywords

Search

Navigation