Остановите войну!
for scientists:
default search action
Marco Baioletti
- > Home > Persons > Marco Baioletti
Publications
- 2023
- [j20]Marco Baioletti, Andrea Capotorti:
A further step for efficient corrections of inconsistent probabilistic data sets. Int. J. Approx. Reason. 159: 108942 (2023) - 2020
- [j17]Linda C. van der Gaag, Marco Baioletti, Janneke H. Bolt:
A lattice-based representation of independence relations for efficient closure computation. Int. J. Approx. Reason. 126: 272-289 (2020) - [c48]Marco Baioletti, Andrea Capotorti:
A L1 Minimization Optimal Corrective Explanation Procedure for Probabilistic Databases. IPMU (1) 2020: 80-92 - 2019
- [j14]Marco Baioletti, Andrea Capotorti:
A L1 based probabilistic merging algorithm and its application to statistical matching. Appl. Intell. 49(1): 112-124 (2019) - 2018
- [c38]Linda C. van der Gaag, Marco Baioletti, Janneke H. Bolt:
A Lattice Representation of Independence Relations. PGM 2018: 487-498 - 2017
- [c34]Marco Baioletti, Andrea Capotorti:
An Efficient Probabilistic Merging Procedure Applied to Statistical Matching. IEA/AIE (2) 2017: 65-74 - 2013
- [c24]Marco Baioletti, Davide Petturiti, Barbara Vantaggi:
Qualitative Combination of Independence Models. ECSQARU 2013: 37-48 - 2012
- [c23]Marco Baioletti, Giulianella Coletti, Davide Petturiti:
Weighted Attribute Combinations Based Similarity Measures. IPMU (3) 2012: 211-220 - 2011
- [j8]Marco Baioletti, Davide Petturiti:
Algorithms for possibility assessments: Coherence and extension. Fuzzy Sets Syst. 169(1): 1-25 (2011) - [j7]Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi:
Acyclic directed graphs representing independence models. Int. J. Approx. Reason. 52(1): 2-18 (2011) - [j6]Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi:
Exploiting independencies to compute semigraphoid and graphoid structures. Int. J. Approx. Reason. 52(5): 565-579 (2011) - [j5]Marco Baioletti, Giulianella Coletti, Davide Petturiti, Barbara Vantaggi:
Inferential models and relevant algorithms in a possibilistic framework. Int. J. Approx. Reason. 52(5): 580-598 (2011) - [c22]Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi:
Finding P-Maps and I-Maps to Represent Conditional Independencies. ECSQARU 2011: 239-250 - 2010
- [c20]Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi:
An Algorithm to Find a Perfect Map for Graphoid Structures. IPMU (1) 2010: 1-10 - 2009
- [j3]Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi:
Conditional independence structure and its closure: Inferential rules and algorithms. Int. J. Approx. Reason. 50(7): 1097-1114 (2009) - [c17]Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi:
Acyclic Directed Graphs to Represent Conditional Independence Models. ECSQARU 2009: 530-541 - 2002
- [j2]Marco Baioletti, Andrea Capotorti, Sauro Tulipani, Barbara Vantaggi:
Simplification Rules for the Coherent Probability Assessment Problem. Ann. Math. Artif. Intell. 35(1-4): 11-28 (2002) - 2000
- [j1]Marco Baioletti, Andrea Capotorti, Sauro Tulipani, Barbara Vantaggi:
Elimination of Boolean variables for probabilistic coherence. Soft Comput. 4(2): 81-88 (2000)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-07 22:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint