Pub Date : 2025-11-09DOI: 10.1016/j.ijar.2025.109597
Andrey G. Bronevich , Alexander E. Lepskiy
In the paper, we consider three possible types of external conflict in Dempster-Shafer theory and propose its measurement based on functionals evaluating intersection, inclusion and distance between random sets. All proposed functionals can be viewed as extensions of known functionals like Jaccard metric, Jaccard index, and Dice coefficient from usual sets to random sets based on the solutions of the Kantorovich problems.
{"title":"Measuring external conflict in Dempster-Shafer theory based on Kantorovich problems","authors":"Andrey G. Bronevich , Alexander E. Lepskiy","doi":"10.1016/j.ijar.2025.109597","DOIUrl":"10.1016/j.ijar.2025.109597","url":null,"abstract":"<div><div>In the paper, we consider three possible types of external conflict in Dempster-Shafer theory and propose its measurement based on functionals evaluating intersection, inclusion and distance between random sets. All proposed functionals can be viewed as extensions of known functionals like Jaccard metric, Jaccard index, and Dice coefficient from usual sets to random sets based on the solutions of the Kantorovich problems.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"190 ","pages":"Article 109597"},"PeriodicalIF":3.0,"publicationDate":"2025-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145735356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Efficient computation of hard reasoning tasks is a key issue in abstract argumentation. One recent approach is to define approximate algorithms, i.e. methods that provide an answer that may not always be correct, but outperform the exact algorithms regarding the computation runtime. One such approach proposes to use the grounded semantics, which is polynomially computable, as a starting point for determining whether arguments are (credulously or skeptically) accepted with respect to various other extension-based semantics. In this paper, we push further this idea by defining a general family of approaches to evaluate the acceptability of arguments which are not in the grounded extension, neither attacked by it. These approaches rely on gradual semantics to evaluate these arguments. We also propose an approach using an heuristic based on the number of arguments attacked by or attacking an argument, and we show that this last approach, although seemingly different, is actually also an instance of our general family of approaches based on gradual semantics. We have implemented our approaches and provided an empirical study in which we discuss the results and compare our approach with the state-of-the-art approximate algorithms.
{"title":"ARIPOTER: Solvers for approximate reasoning based on grounded semantics","authors":"Jérôme Delobelle , Jean-Guy Mailly , Julien Rossit","doi":"10.1016/j.ijar.2025.109599","DOIUrl":"10.1016/j.ijar.2025.109599","url":null,"abstract":"<div><div>Efficient computation of hard reasoning tasks is a key issue in abstract argumentation. One recent approach is to define approximate algorithms, <em>i.e.</em> methods that provide an answer that may not always be correct, but outperform the exact algorithms regarding the computation runtime. One such approach proposes to use the grounded semantics, which is polynomially computable, as a starting point for determining whether arguments are (credulously or skeptically) accepted with respect to various other extension-based semantics. In this paper, we push further this idea by defining a general family of approaches to evaluate the acceptability of arguments which are not in the grounded extension, neither attacked by it. These approaches rely on gradual semantics to evaluate these arguments. We also propose an approach using an heuristic based on the number of arguments attacked by or attacking an argument, and we show that this last approach, although seemingly different, is actually also an instance of our general family of approaches based on gradual semantics. We have implemented our approaches and provided an empirical study in which we discuss the results and compare our approach with the state-of-the-art approximate algorithms.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"189 ","pages":"Article 109599"},"PeriodicalIF":3.0,"publicationDate":"2025-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145577154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-02DOI: 10.1016/j.ijar.2025.109588
Sebastian Fuchs, Carsten Limbach, Fabian Schürrer
We explore how the classical concordance measures–Kendall’s , Spearman’s rank correlation , and Spearman’s footrule –relate to Chatterjee’s rank correlation when restricted to lower semilinear copulas. First, we provide a complete characterization of the attainable region for this class, thus resolving the conjecture of Maislinger and Trutschnig [1]. Building on this result, we then derive the exact and regions, obtain a closed-form relationship between and , and establish the exact region. In particular, we prove that never exceeds , , or . Our results clarify the relationship between undirected and directed dependence measures and reveal novel insights into the dependence structures that result from lower semilinear copulas.
{"title":"On exact regions between measures of concordance and Chatterjee’s rank correlation for lower semilinear copulas","authors":"Sebastian Fuchs, Carsten Limbach, Fabian Schürrer","doi":"10.1016/j.ijar.2025.109588","DOIUrl":"10.1016/j.ijar.2025.109588","url":null,"abstract":"<div><div>We explore how the classical concordance measures–Kendall’s <span><math><mi>τ</mi></math></span>, Spearman’s rank correlation <span><math><mi>ρ</mi></math></span>, and Spearman’s footrule <span><math><mi>ϕ</mi></math></span>–relate to Chatterjee’s rank correlation <span><math><mi>ξ</mi></math></span> when restricted to lower semilinear copulas. First, we provide a complete characterization of the attainable <span><math><mrow><mi>τ</mi><mspace></mspace><mo>−</mo><mspace></mspace><mi>ρ</mi></mrow></math></span> region for this class, thus resolving the conjecture of Maislinger and Trutschnig [1]. Building on this result, we then derive the exact <span><math><mrow><mi>τ</mi><mspace></mspace><mo>−</mo><mspace></mspace><mi>ϕ</mi></mrow></math></span> and <span><math><mrow><mi>ϕ</mi><mspace></mspace><mo>−</mo><mspace></mspace><mi>ρ</mi></mrow></math></span> regions, obtain a closed-form relationship between <span><math><mi>ξ</mi></math></span> and <span><math><mi>τ</mi></math></span>, and establish the exact <span><math><mrow><mi>τ</mi><mspace></mspace><mo>−</mo><mspace></mspace><mi>ξ</mi></mrow></math></span> region. In particular, we prove that <span><math><mi>ξ</mi></math></span> never exceeds <span><math><mi>τ</mi></math></span>, <span><math><mi>ρ</mi></math></span>, or <span><math><mi>ϕ</mi></math></span>. Our results clarify the relationship between undirected and directed dependence measures and reveal novel insights into the dependence structures that result from lower semilinear copulas.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"189 ","pages":"Article 109588"},"PeriodicalIF":3.0,"publicationDate":"2025-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145464607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-01DOI: 10.1016/j.ijar.2025.109587
Bidhan Saha , Mohua Banerjee , Soma Dutta
Several logics were proposed by Bunder, Chakraborty and Banerjee using different kinds of ‘rough modus ponens’ rules [1, 2, 3]. Some of these logics are paraconsistent, but most are explosive. We observe that weakening the rules in a particular manner generates a collection of new paraconsistent modal logics. Several properties of the new logics are studied. One such is the characterization of the syntactic consequence relations, which yields a collection of non-standard notions of semantic consequence. Interrelations between the proposed logics and the logics introduced in [3] are also investigated.
{"title":"New paraconsistent modal logics based on rough modus ponens rules and their interrelations","authors":"Bidhan Saha , Mohua Banerjee , Soma Dutta","doi":"10.1016/j.ijar.2025.109587","DOIUrl":"10.1016/j.ijar.2025.109587","url":null,"abstract":"<div><div>Several logics were proposed by Bunder, Chakraborty and Banerjee using different kinds of ‘rough modus ponens’ rules [1, 2, 3]. Some of these logics are paraconsistent, but most are explosive. We observe that weakening the rules in a particular manner generates a collection of new paraconsistent modal logics. Several properties of the new logics are studied. One such is the characterization of the syntactic consequence relations, which yields a collection of non-standard notions of semantic consequence. Interrelations between the proposed logics and the logics introduced in <span><span>[3]</span></span> are also investigated.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"189 ","pages":"Article 109587"},"PeriodicalIF":3.0,"publicationDate":"2025-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145518526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-30DOI: 10.1016/j.ijar.2025.109589
Linqing Huang , Jinfu Fan , Gongshen Liu , Shilin Wang
In pattern recognition with few or no labeled data, domain adaptation techniques are often used to transfer knowledge in the source domain to help build classification models in the target domain. The effective combination of complementary information in multiple source domains usually can further improve the classification accuracy. To this end, we present a Robust Multi-Source Transfer (RMST) classification method consisting of two-step fusion of classifiers to extract the useful information in each source domain as much as possible, and to effectively combine the complementary information using belief functions in different source domains. The first step is to accurately predict the pseudo labels when computing conditional distribution, in order to learn a robust new feature representation, which is used to fuse diverse classifiers learnt by patterns for reliable soft classification in the second step of our algorithm. Furthermore, the soft classification results yielded by the assistance of different source domains are combined by belief functions with the new weighting factors taking into account the distribution discrepancy and classifier’s performance. The effectiveness of RMST was evaluated with respect to a variety of advanced methods, and the experimental results show that RMST can significantly improve the classification accuracy.
{"title":"A robust multi-source transfer classification method based on belief functions for cross-domain pattern recognition","authors":"Linqing Huang , Jinfu Fan , Gongshen Liu , Shilin Wang","doi":"10.1016/j.ijar.2025.109589","DOIUrl":"10.1016/j.ijar.2025.109589","url":null,"abstract":"<div><div>In pattern recognition with few or no labeled data, domain adaptation techniques are often used to transfer knowledge in the source domain to help build classification models in the target domain. The effective combination of complementary information in multiple source domains usually can further improve the classification accuracy. To this end, we present a Robust Multi-Source Transfer (RMST) classification method consisting of two-step fusion of classifiers to extract the useful information in each source domain as much as possible, and to effectively combine the complementary information using belief functions in different source domains. The first step is to accurately predict the pseudo labels when computing conditional distribution, in order to learn a robust new feature representation, which is used to fuse diverse classifiers learnt by patterns for reliable soft classification in the second step of our algorithm. Furthermore, the soft classification results yielded by the assistance of different source domains are combined by belief functions with the new weighting factors taking into account the distribution discrepancy and classifier’s performance. The effectiveness of RMST was evaluated with respect to a variety of advanced methods, and the experimental results show that RMST can significantly improve the classification accuracy.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"189 ","pages":"Article 109589"},"PeriodicalIF":3.0,"publicationDate":"2025-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145464523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-26DOI: 10.1016/j.ijar.2025.109586
Zaiwu Gong , Jiaxin Zhou , Xinxin Luo , Kun Zhou , Weiwei Guo , Guo Wei
In Multiple Criteria Decision Aid (MCDA), preference disaggregation is used to derive aggregation functions that replicate the preference information provided by decision makers (DMs). A key research challenge is identifying the most representative aggregation function that aligns with the DMs’ behavioral preferences from all feasible functions. In the context of group decisions and negotiations, preference disaggregation faces two main barriers: Selecting representative aggregation functions and reducing the cognitive effort required from DMs. In this paper, we extend preference disaggregation to group decision-making by enabling DMs to increase the diversity of their decision matrices, and establish several representative aggregation function selection models that account for group behavioral preferences. Given the cognitive limitations of DMs, their preferences are often expressed as confidence levels, which inherently involve uncertainty. Therefore, we expand the scope of preference information required for preference disaggregation from deterministic preferences to uncertain preferences. By applying probability theory–specifically, chance constraints–we transform DMs’ uncertain preferences into constraints for selecting representative aggregation functions that align with their behavioral preferences. Notably, when the confidence level approaches 100 %, the uncertain preferences converge to their deterministic counterparts, demonstrating the extensiveness and inclusiveness of uncertain preference information. Finally, we illustrate the practical feasibility of our approach through a case study on the evaluation of medical pension institutions.
{"title":"Modeling the selection of representative aggregation functions for optimizing the representation of group behavior preferences within the preference disaggregation framework","authors":"Zaiwu Gong , Jiaxin Zhou , Xinxin Luo , Kun Zhou , Weiwei Guo , Guo Wei","doi":"10.1016/j.ijar.2025.109586","DOIUrl":"10.1016/j.ijar.2025.109586","url":null,"abstract":"<div><div>In Multiple Criteria Decision Aid (MCDA), preference disaggregation is used to derive aggregation functions that replicate the preference information provided by decision makers (DMs). A key research challenge is identifying the most representative aggregation function that aligns with the DMs’ behavioral preferences from all feasible functions. In the context of group decisions and negotiations, preference disaggregation faces two main barriers: Selecting representative aggregation functions and reducing the cognitive effort required from DMs. In this paper, we extend preference disaggregation to group decision-making by enabling DMs to increase the diversity of their decision matrices, and establish several representative aggregation function selection models that account for group behavioral preferences. Given the cognitive limitations of DMs, their preferences are often expressed as confidence levels, which inherently involve uncertainty. Therefore, we expand the scope of preference information required for preference disaggregation from deterministic preferences to uncertain preferences. By applying probability theory–specifically, chance constraints–we transform DMs’ uncertain preferences into constraints for selecting representative aggregation functions that align with their behavioral preferences. Notably, when the confidence level approaches 100 %, the uncertain preferences converge to their deterministic counterparts, demonstrating the extensiveness and inclusiveness of uncertain preference information. Finally, we illustrate the practical feasibility of our approach through a case study on the evaluation of medical pension institutions.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"189 ","pages":"Article 109586"},"PeriodicalIF":3.0,"publicationDate":"2025-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145420387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-14DOI: 10.1016/j.ijar.2025.109585
Wannes De Maeyer , Mauricio Restrepo , Chris Cornelis
Covering-based rough sets (CBRS) offer a flexible extension of classical rough set theory, making them well-suited for analyzing diverse types of complex and possibly inconsistent data. A requirement for the effective use of CBRS is the availability of high-quality coverings of the dataset. A promising approach for generating such coverings is the Mapper algorithm, which builds on the underlying topological structure of the data. However, Mapper's performance depends heavily on the choice of its parameters. In this paper, we study how the structure of the parameter space is transferred to the structure of the coverings generated by these parameters, focusing on the weak and strong approximation operators. We prove important monotonicity results that give insights into the inner workings of the Mapper algorithm and how it can generate coverings. We give an overview of how each parameter influences the output covering and illustrate this using real-world datasets.
{"title":"Granular structures of covering-based rough set approximations through the Mapper algorithm","authors":"Wannes De Maeyer , Mauricio Restrepo , Chris Cornelis","doi":"10.1016/j.ijar.2025.109585","DOIUrl":"10.1016/j.ijar.2025.109585","url":null,"abstract":"<div><div>Covering-based rough sets (CBRS) offer a flexible extension of classical rough set theory, making them well-suited for analyzing diverse types of complex and possibly inconsistent data. A requirement for the effective use of CBRS is the availability of high-quality coverings of the dataset. A promising approach for generating such coverings is the Mapper algorithm, which builds on the underlying topological structure of the data. However, Mapper's performance depends heavily on the choice of its parameters. In this paper, we study how the structure of the parameter space is transferred to the structure of the coverings generated by these parameters, focusing on the weak and strong approximation operators. We prove important monotonicity results that give insights into the inner workings of the Mapper algorithm and how it can generate coverings. We give an overview of how each parameter influences the output covering and illustrate this using real-world datasets.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"188 ","pages":"Article 109585"},"PeriodicalIF":3.0,"publicationDate":"2025-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145333076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-09DOI: 10.1016/j.ijar.2025.109584
Sebastian Fuchs
{"title":"Special issue on the 11th International Conference on Soft Methods in Probability and Statistics (SMPS 2024)","authors":"Sebastian Fuchs","doi":"10.1016/j.ijar.2025.109584","DOIUrl":"10.1016/j.ijar.2025.109584","url":null,"abstract":"","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"188 ","pages":"Article 109584"},"PeriodicalIF":3.0,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145333074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-09DOI: 10.1016/j.ijar.2025.109583
Yan Zou , Feng Qin , Ting-hai Zhang , Jian-Jun Li
Recently, Baczyński et al. introduced an axiomatic framework for fuzzy Sheffer strokes within the realm of fuzzy logic. Building on this foundation, Zhao and Liu extended this concept to the context of directionally monotone functions. In this paper, we propose a novel class of cone-monotone functions, referred to as the -Sheffer stroke, by generalizing the monotonicity condition from fuzzy Sheffer strokes to cone monotonicity. We then systematically investigate their fundamental properties and explore their connections with both fuzzy Sheffer strokes and -Sheffer strokes. Moreover, we present a method to construct -Sheffer strokes using -conjunctions and fuzzy negations, along with a characterization of -constant Sheffer strokes. In addition, we propose splicing construction techniques applicable to both -Sheffer strokes and -Sheffer strokes. Finally, an ordinal sum construction method for -Sheffer stroke operators is presented.
{"title":"On A-Sheffer strokes: A new class of cone-monotone functions and their ordinal sum constructions","authors":"Yan Zou , Feng Qin , Ting-hai Zhang , Jian-Jun Li","doi":"10.1016/j.ijar.2025.109583","DOIUrl":"10.1016/j.ijar.2025.109583","url":null,"abstract":"<div><div>Recently, Baczyński et al. introduced an axiomatic framework for fuzzy Sheffer strokes within the realm of fuzzy logic. Building on this foundation, Zhao and Liu extended this concept to the context of directionally monotone functions. In this paper, we propose a novel class of cone-monotone functions, referred to as the <span><math><mi>A</mi></math></span>-Sheffer stroke, by generalizing the monotonicity condition from fuzzy Sheffer strokes to cone monotonicity. We then systematically investigate their fundamental properties and explore their connections with both fuzzy Sheffer strokes and <span><math><mover><mrow><mi>r</mi></mrow><mrow><mo>→</mo></mrow></mover></math></span>-Sheffer strokes. Moreover, we present a method to construct <span><math><mi>A</mi></math></span>-Sheffer strokes using <span><math><mi>A</mi></math></span>-conjunctions and fuzzy negations, along with a characterization of <span><math><mi>A</mi></math></span>-constant Sheffer strokes. In addition, we propose splicing construction techniques applicable to both <span><math><mover><mrow><mi>r</mi></mrow><mrow><mo>→</mo></mrow></mover></math></span>-Sheffer strokes and <span><math><mi>A</mi></math></span>-Sheffer strokes. Finally, an ordinal sum construction method for <span><math><mi>A</mi></math></span>-Sheffer stroke operators is presented.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"188 ","pages":"Article 109583"},"PeriodicalIF":3.0,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145333075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-10-02DOI: 10.1016/j.ijar.2025.109582
Roberto Fontana , Elisa Perrone , Fabio Rapallo
We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. This is an old question which relates to recent advances in copula modeling for discrete random vectors. In this work, we focus on multi-way binary tables and develop novel theory to show how the zero patterns affect the existence of the transformation as well as its statistical interpretability in terms of dependence structure. The implementation of the theory relies on combinatorial and linear programming techniques, which can also be applied to arbitrary multi-way tables. In addition, we investigate which odds ratios characterize the unique solution in relation to specific zero patterns. Several examples are described to illustrate the approach and point to interesting future research directions.
{"title":"Zero patterns in multi-way binary contingency tables with uniform margins","authors":"Roberto Fontana , Elisa Perrone , Fabio Rapallo","doi":"10.1016/j.ijar.2025.109582","DOIUrl":"10.1016/j.ijar.2025.109582","url":null,"abstract":"<div><div>We study the problem of transforming a multi-way contingency table into an equivalent table with uniform margins and same dependence structure. This is an old question which relates to recent advances in copula modeling for discrete random vectors. In this work, we focus on multi-way binary tables and develop novel theory to show how the zero patterns affect the existence of the transformation as well as its statistical interpretability in terms of dependence structure. The implementation of the theory relies on combinatorial and linear programming techniques, which can also be applied to arbitrary multi-way tables. In addition, we investigate which odds ratios characterize the unique solution in relation to specific zero patterns. Several examples are described to illustrate the approach and point to interesting future research directions.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"188 ","pages":"Article 109582"},"PeriodicalIF":3.0,"publicationDate":"2025-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145270160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号