International Journal of Approximate Reasoning最新文献_第9页

Editorial of the special issue “Synergies Between Machine Learning and Reasoning” 机器学习与推理之间的协同作用 "特刊编辑

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-24 DOI: 10.1016/j.ijar.2024.109207

Sébastien Destercke , Jérôme Mengin , Henri Prade

引用次数: 0

Revisiting analogical proportions and analogical inference 重新审视类比比例和类比推理

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-18 DOI: 10.1016/j.ijar.2024.109202

Myriam Bounhas , Henri Prade

{"title":"Revisiting analogical proportions and analogical inference","authors":"Myriam Bounhas , Henri Prade","doi":"10.1016/j.ijar.2024.109202","DOIUrl":"10.1016/j.ijar.2024.109202","url":null,"abstract":"<div><p>In this paper, we consider analogical proportions which are statements of the form “<span><math><mover><mrow><mi>a</mi></mrow><mrow><mo>→</mo></mrow></mover></math></span> is to <span><math><mover><mrow><mi>b</mi></mrow><mrow><mo>→</mo></mrow></mover></math></span> as <span><math><mover><mrow><mi>c</mi></mrow><mrow><mo>→</mo></mrow></mover></math></span> is to <span><math><mover><mrow><mi>d</mi></mrow><mrow><mo>→</mo></mrow></mover></math></span>”, understood as a comparative formulation between vectors of items described on the same set of attributes. Analogical proportions and analogical inference have been extensively studied in the last decade, in particular by the authors of this paper. Some important remarks have been made regarding these proportions on i) the role of ordered pairs in them; ii) the large number of them associated with taxonomic trees; and more recently iii) their close relationship with multi-valued dependencies. We offer a renewed presentation of these facts together with some new insights on analogical proportions, emphasizing the role of equivalence classes of ordered pairs. Moreover, not all consequences had been drawn for a better understanding of analogical inference. This is the main purpose of this paper. In particular, it is advocated that analogical proportions whose four members are equal on some attributes are better predictors in general for classification purposes than analogical proportions for which there does not exist such attribute. This is confirmed by experimental results also reported in the paper. Thus this paper can be read both as an introductory survey on recent advances on analogical proportions and as a study on the impact of particular patterns on analogical inference, a topic never considered before.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"171 ","pages":"Article 109202"},"PeriodicalIF":3.9,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140769456","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}

引用次数: 0

Consequence relations and data science: From Galois mappings to data interpretation 后果关系与数据科学：从伽罗瓦映射到数据解释

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-18 DOI: 10.1016/j.ijar.2024.109203

Marcin Wolski , Anna Gomolińska

{"title":"Consequence relations and data science: From Galois mappings to data interpretation","authors":"Marcin Wolski , Anna Gomolińska","doi":"10.1016/j.ijar.2024.109203","DOIUrl":"https://doi.org/10.1016/j.ijar.2024.109203","url":null,"abstract":"<div><p>The concepts of a consequence relation and operation, though very abstract and theoretical, may be related to specific categories of information systems (i.e. mathematical <em>frontends</em> of data tables); as it has been demonstrated by D. Vakarelov, there exist correspondence between Pawlak information systems and Scott as well as Tarski consequence operations. This line of research goes (via <em>representation</em>) from abstract concepts to data. In this paper we would like to take the opposite direction: from data (via <em>construction</em>) to consequence relations. The main emphasis is laid here not on general categories of consequence relations (e.g. Scott or Tarski ones) but on concrete operators that can be retrieved from information systems (e.g. different examples of Scott consequence). To this end, we employ Galois connections and adjunctions (<em>en masse</em> called Galois mappings) and study the consequence relations that can be built <em>via</em> these maps. The main novelty of our research comes from the investigation of consequence relations induced by adjunctions rather than monotone Galois connections, which have been the main subject of studies so far. Surprisingly, the operations obtained from adjunctions possess a number of counter-intuitive properties, which (in turn) request some intelligible interpretations. And this is our next objective: to make sense of these consequence relations in the context of information processing.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"170 ","pages":"Article 109203"},"PeriodicalIF":3.9,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140632678","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}

引用次数: 0

Triple perturbed consistent matrix and the efficiency of its principal right eigenvector 三重扰动一致矩阵及其右主特征向量的效率

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-18 DOI: 10.1016/j.ijar.2024.109204

Rosário Fernandes , Susana Palheira

{"title":"Triple perturbed consistent matrix and the efficiency of its principal right eigenvector","authors":"Rosário Fernandes , Susana Palheira","doi":"10.1016/j.ijar.2024.109204","DOIUrl":"https://doi.org/10.1016/j.ijar.2024.109204","url":null,"abstract":"<div><p>Let <em>A</em> be a pairwise comparison matrix obtained from a consistent one by perturbing three entries above the main diagonal, <span><math><mi>x</mi><mo>,</mo><mi>y</mi><mo>,</mo><mi>z</mi></math></span>, and the corresponding reciprocal entries, in a way that there is a submatrix of size 2 containing the three perturbed entries and not containing a diagonal entry. In this paper we describe the relations among <span><math><mi>x</mi><mo>,</mo><mi>y</mi><mo>,</mo><mi>z</mi></math></span> with which <em>A</em> always has its principal right eigenvector efficient. Previously, and only for a few cases of this problem, R. Fernandes and S. Furtado (2022) proved the efficiency of the principal right eigenvector of <em>A</em>. In this paper, we continue to use the strong connectivity of a certain digraph associated with <em>A</em> and its principal right eigenvector to characterize the vector efficiency. For completeness, we show that the existence of a sink in this digraph is equivalent to the inefficiency of the principal right eigenvector of <em>A</em>.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"170 ","pages":"Article 109204"},"PeriodicalIF":3.9,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X24000914/pdfft?md5=d6b553917e677989eb4fbde615815e37&pid=1-s2.0-S0888613X24000914-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140632679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Uncertainty propagation in stereo matching using copulas 使用协方差在立体匹配中传播不确定性

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-16 DOI: 10.1016/j.ijar.2024.109191

Roman Malinowski , Sébastien Destercke , Loïc Dumas , Emmanuel Dubois , Emmanuelle Sarrazin

引用次数: 0

Logics for the new AI spring 人工智能新春天的逻辑

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-16 DOI: 10.1016/j.ijar.2024.109199

Tommaso Flaminio, Hykel Hosni

引用次数: 0

Learning decision catalogues for situated decision making: The case of scoring systems 为情境决策学习决策目录：评分系统案例

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-12 DOI: 10.1016/j.ijar.2024.109190

Stefan Heid , Jonas Hanselle , Johannes Fürnkranz , Eyke Hüllermeier

{"title":"Learning decision catalogues for situated decision making: The case of scoring systems","authors":"Stefan Heid , Jonas Hanselle , Johannes Fürnkranz , Eyke Hüllermeier","doi":"10.1016/j.ijar.2024.109190","DOIUrl":"10.1016/j.ijar.2024.109190","url":null,"abstract":"<div><p>In this paper, we formalize the problem of learning coherent collections of decision models, which we call decision catalogues, and illustrate it for the case where models are scoring systems. This problem is motivated by the recent rise of algorithmic decision-making and the idea to improve human decision-making through machine learning, in conjunction with the observation that decision models should be situated in terms of their complexity and resource requirements: Instead of constructing a single decision model and using this model in all cases, different models might be appropriate depending on the decision context. Decision catalogues are supposed to support a seamless transition from very simple, resource-efficient to more sophisticated but also more demanding models. We present a general algorithmic framework for inducing such catalogues from training data, which tackles the learning task as a problem of searching the space of candidate catalogues systematically and, to this end, makes use of heuristic search methods. We also present a concrete instantiation of this framework as well as empirical studies for performance evaluation, which, in a nutshell, show that greedy search is an efficient and hard-to-beat strategy for the construction of catalogues of scoring systems.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"171 ","pages":"Article 109190"},"PeriodicalIF":3.9,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X2400077X/pdfft?md5=dbbec50c1dcf50fb106bcfb2cf8b65f9&pid=1-s2.0-S0888613X2400077X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140772000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Neighborhood-based argumental community support in the context of multi-topic debates 多主题辩论中基于邻里关系的论证社区支持

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-12 DOI: 10.1016/j.ijar.2024.109189

Irene M. Coronel , Melisa G. Escañuela Gonzalez , Diego C. Martinez , Gerardo I. Simari , Maximiliano C.D. Budán

{"title":"Neighborhood-based argumental community support in the context of multi-topic debates","authors":"Irene M. Coronel , Melisa G. Escañuela Gonzalez , Diego C. Martinez , Gerardo I. Simari , Maximiliano C.D. Budán","doi":"10.1016/j.ijar.2024.109189","DOIUrl":"https://doi.org/10.1016/j.ijar.2024.109189","url":null,"abstract":"<div><p>The formal characterization of abstract argumentation has allowed the study of many exciting characteristics of the argumentation process. Nevertheless, while helpful in many aspects, abstraction diminishes the knowledge representation capabilities available to describe naturally occurring features of argumentative dialogues; one of these elements is the consideration of the topics involved in a discussion. In studying dialogical processes, participants recognize that some topics are closely related to the original issue; in contrast, others are more distant from the central subject or refer to unrelated matters. Consequently, it is reasonable to study different argumentation semantics that considers a discussion's focus to evaluate acceptability. In this work, we introduce the necessary representational elements required to reflect the focus of a discussion. We propose a novel extension of the semantics for <em>multi-topic abstract argumentation frameworks</em>, acknowledging that every argument has its own <em>zone of relevance</em> in the argumentation framework, leading to the concepts of neighborhoods and communities of legitimate defenses. Furthermore, other semantic elaborations are defined and discussed around this structure.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"170 ","pages":"Article 109189"},"PeriodicalIF":3.9,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140555371","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}

引用次数: 0

Hierarchical variable clustering based on the predictive strength between random vectors 基于随机向量间预测强度的分层变量聚类

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-08 DOI: 10.1016/j.ijar.2024.109185

Sebastian Fuchs, Yuping Wang

引用次数: 0

Towards an effective practice of learning from data and knowledge 实现从数据和知识中学习的有效实践

IF 3.9 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-04-05 DOI: 10.1016/j.ijar.2024.109188

Yizuo Chen, Haiying Huang, Adnan Darwiche

{"title":"Towards an effective practice of learning from data and knowledge","authors":"Yizuo Chen, Haiying Huang, Adnan Darwiche","doi":"10.1016/j.ijar.2024.109188","DOIUrl":"10.1016/j.ijar.2024.109188","url":null,"abstract":"<div><p>We discuss some recent advances on combining data and knowledge in the context of supervised learning using Bayesian networks. A first set of advances concern the computational efficiency of learning and inference, and they include a software-level boost based on compiling Bayesian network structures into tractable circuits in the form of <em>tensor graphs</em>, and algorithmic improvements based on exploiting a type of knowledge called <em>unknown functional dependencies.</em> The used tensor graphs capitalize on a highly optimized tensor operation (matrix multiplication) which brings orders of magnitude speedups in circuit training and evaluation. The exploitation of unknown functional dependencies yields exponential reductions in the size of tractable circuits and gives rise to the notion of <em>causal treewidth</em> for offering a corresponding complexity bound. Beyond computational efficiency, we discuss empirical evidence showing the promise of learning from a combination of data and knowledge, in terms of data hungriness and robustness against noise perturbations. Sometimes, however, an accurate Bayesian network structure may not be available due to the incompleteness of human knowledge, leading to <em>modeling errors</em> in the form of missing dependencies or missing variable values. On this front, we discuss another set of advances for recovering from certain types of modeling errors. This is achieved using Testing Bayesian networks which dynamically select parameters based on the input evidence, and come with theoretical guarantees on full recovery under certain conditions.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"171 ","pages":"Article 109188"},"PeriodicalIF":3.9,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X24000756/pdfft?md5=a14a683e66d7ef5d6aabb38b3d5cd7fa&pid=1-s2.0-S0888613X24000756-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140629876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0