International Journal of Approximate Reasoning最新文献

筛选
英文 中文
Multiindistinguishability operators 多区分性算子
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-28 DOI: 10.1016/j.ijar.2025.109401
D. Boixader, J. Recasens
{"title":"Multiindistinguishability operators","authors":"D. Boixader,&nbsp;J. Recasens","doi":"10.1016/j.ijar.2025.109401","DOIUrl":"10.1016/j.ijar.2025.109401","url":null,"abstract":"<div><div>In this paper (binary) equivalence relations and their fuzzification, indistinguishability operators, are generalized to <em>n</em>-equivalence relations and <em>n</em>-multiindistinguishability operators respectively. Some of the properties of these two last objects are stated as well as their relation with binary ones.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"181 ","pages":"Article 109401"},"PeriodicalIF":3.2,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143529582","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
DEEM: A novel approach to semi-supervised and unsupervised image clustering under uncertainty using belief functions and convolutional neural networks
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-27 DOI: 10.1016/j.ijar.2025.109400
Loïc Guiziou , Emmanuel Ramasso , Sébastien Thibaud , Sébastien Denneulin
{"title":"DEEM: A novel approach to semi-supervised and unsupervised image clustering under uncertainty using belief functions and convolutional neural networks","authors":"Loïc Guiziou ,&nbsp;Emmanuel Ramasso ,&nbsp;Sébastien Thibaud ,&nbsp;Sébastien Denneulin","doi":"10.1016/j.ijar.2025.109400","DOIUrl":"10.1016/j.ijar.2025.109400","url":null,"abstract":"<div><div>DEEM (Deep Evidential Encoding of iMages) is a clustering algorithm that combines belief functions with convolutional neural networks in a Siamese-like framework for unsupervised and semi-supervised image clustering. In DEEM, images are mapped to Dempster–Shafer mass functions to quantify uncertainty in cluster membership. Various forms of prior information, including must-link and cannot-link constraints, supervised dissimilarities, and Distance Metric Learning, are incorporated to guide training and improve generalisation. By processing image pairs through shared network weights, DEEM aligns pairwise dissimilarities with the conflict between mass functions, thereby mitigating errors in noisy or incomplete distance matrices. Experiments on MNIST demonstrate that DEEM generalises effectively to unseen data while managing different types of prior knowledge, making it a promising approach for clustering and semi-supervised learning from image data under uncertainty.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"181 ","pages":"Article 109400"},"PeriodicalIF":3.2,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143534895","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
Soft computing for the posterior of a matrix t graphical network
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-24 DOI: 10.1016/j.ijar.2025.109397
Jason Pillay , Andriette Bekker , Johannes Ferreira , Mohammad Arashi
{"title":"Soft computing for the posterior of a matrix t graphical network","authors":"Jason Pillay ,&nbsp;Andriette Bekker ,&nbsp;Johannes Ferreira ,&nbsp;Mohammad Arashi","doi":"10.1016/j.ijar.2025.109397","DOIUrl":"10.1016/j.ijar.2025.109397","url":null,"abstract":"<div><div>Modeling noisy data in a network context remains an unavoidable obstacle; fortunately, random matrix theory may comprehensively describe network environments. Noisy data necessitates the probabilistic characterization of these networks using matrix variate models. Denoising network data using a Bayesian approach is not common in surveyed literature. Therefore, this paper adopts the Bayesian viewpoint and introduces a new version of the matrix variate t graphical network. This model's prior beliefs rely on the matrix variate gamma distribution to handle the noise process flexibly; from a statistical learning viewpoint, such a theoretical consideration benefits the comprehension of structures and processes that cause network-based noise in data as part of machine learning and offers real-world interpretation. A proposed Gibbs algorithm is provided for computing and approximating the resulting posterior probability distribution of interest to assess the considered model's network centrality measures. Experiments with synthetic and real-world stock price data are performed to validate the proposed algorithm's capabilities and show that this model has wider flexibility than the model proposed by <span><span>[13]</span></span>.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109397"},"PeriodicalIF":3.2,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143508698","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
Fuzzy time series analysis: Expanding the scope with fuzzy numbers
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-21 DOI: 10.1016/j.ijar.2025.109387
Hugo J. Bello , Manuel Ojeda-Hernández , Domingo López-Rodríguez , Carlos Bejines
{"title":"Fuzzy time series analysis: Expanding the scope with fuzzy numbers","authors":"Hugo J. Bello ,&nbsp;Manuel Ojeda-Hernández ,&nbsp;Domingo López-Rodríguez ,&nbsp;Carlos Bejines","doi":"10.1016/j.ijar.2025.109387","DOIUrl":"10.1016/j.ijar.2025.109387","url":null,"abstract":"<div><div>This article delves into the process of fuzzifying time series, which entails converting a conventional time series into a time-indexed sequence of fuzzy numbers. The focus lies on the well-established practice of fuzzifying time series when a predefined degree of uncertainty is known, employing fuzzy numbers to quantify volatility or vagueness. To address practical challenges associated with volatility or vagueness quantification, we introduce the concept of informed time series. An algorithm is proposed to derive fuzzy time series, and findings include the examination of structural breaks within the realm of fuzzy time series. Additionally, this article underscores the significance of employing topological tools in the analysis of fuzzy time series, accentuating the role of these tools in extracting insights and unraveling intricate relationships within the data.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109387"},"PeriodicalIF":3.2,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143508699","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
Asymptotic efficiency of inferential models and a possibilistic Bernstein–von Mises theorem
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-20 DOI: 10.1016/j.ijar.2025.109389
Ryan Martin, Jonathan P. Williams
{"title":"Asymptotic efficiency of inferential models and a possibilistic Bernstein–von Mises theorem","authors":"Ryan Martin,&nbsp;Jonathan P. Williams","doi":"10.1016/j.ijar.2025.109389","DOIUrl":"10.1016/j.ijar.2025.109389","url":null,"abstract":"<div><div>The inferential model (IM) framework offers an alternative to the classical probabilistic (e.g., Bayesian and fiducial) uncertainty quantification in statistical inference. A key distinction is that classical uncertainty quantification takes the form of precise probabilities and offers only limited large-sample validity guarantees, whereas the IM's uncertainty quantification is imprecise in such a way that exact, finite-sample valid inference is possible. But are the IM's imprecision and finite-sample validity compatible with statistical efficiency? That is, can IMs be both finite-sample valid and asymptotically efficient? This paper gives an affirmative answer to this question via a new possibilistic Bernstein–von Mises theorem that parallels a fundamental Bayesian result. Among other things, our result shows that the IM solution is efficient in the sense that, asymptotically, its credal set is the smallest that contains the Gaussian distribution with variance equal to the Cramér–Rao lower bound. Moreover, a corresponding version of this new Bernstein–von Mises theorem is presented for problems that involve the elimination of nuisance parameters, which settles an open question concerning the relative efficiency of profiling-based versus extension-based marginalization strategies.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109389"},"PeriodicalIF":3.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480018","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
Maximal hypercliques search based on concept-cognitive learning
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-20 DOI: 10.1016/j.ijar.2025.109386
Jiawei Wang , Fei Hao , Jie Gao , Li Zou , Zheng Pei
{"title":"Maximal hypercliques search based on concept-cognitive learning","authors":"Jiawei Wang ,&nbsp;Fei Hao ,&nbsp;Jie Gao ,&nbsp;Li Zou ,&nbsp;Zheng Pei","doi":"10.1016/j.ijar.2025.109386","DOIUrl":"10.1016/j.ijar.2025.109386","url":null,"abstract":"<div><div>Maximal hyperclique search, focused on finding the largest hypernode subsets in a hypergraph such that every combination of <em>r</em> nodes in these subsets forms a hyperedge, is a fundamental problem in hypergraph mining. However, compared to traditional graphs, the combinatorial explosion of hyperedges significantly increases the complexity of enumeration, especially as the <em>r</em>-value and the number of hypernodes grow, rapidly expanding the search space. Moreover, overlapping hyperedges in dense hypergraphs lead to substantial redundant checks, further exacerbating search inefficiency, making traditional methods inadequate for large-scale hypergraphs. To tackle these challenges, this paper proposes a novel approach MHSC that handles the maximal hyperclique search task in <em>r</em>-uniform hypergraph based on concept-cognitive learning. Concept-cognitive learning refers to the process of understanding and structuring knowledge through the formation of concepts and their interrelationships. Technically, the hypernode-neighbor structure of the hypergraph is first expressed as a formal context, and the required concepts are generated using the concept lattice algorithm. Based on the shared relationships between hypernodes represented by the hyperedges, a series of theorems are proposed to prune hypernodes that cannot form maximal hypercliques within the sets of 1-intent and 2-intent concepts, thereby narrowing the search space and reducing redundant computations. Furthermore, an optimization method termed MHSC+ is introduced. Extensive experiments conducted on both test datasets and real-world datasets demonstrate the effectiveness, efficiency, and applicability of the proposed algorithm.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109386"},"PeriodicalIF":3.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143474846","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
Assessing inference to the best explanation posteriors for the estimation of economic agent-based models
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-20 DOI: 10.1016/j.ijar.2025.109388
Francesco De Pretis , Aldo Glielmo , Jürgen Landes
{"title":"Assessing inference to the best explanation posteriors for the estimation of economic agent-based models","authors":"Francesco De Pretis ,&nbsp;Aldo Glielmo ,&nbsp;Jürgen Landes","doi":"10.1016/j.ijar.2025.109388","DOIUrl":"10.1016/j.ijar.2025.109388","url":null,"abstract":"<div><div>Explanatory relationships between data and hypotheses have been suggested to play a role in the formation of posterior probabilities. This suggestion was tested in a toy environment and supported by simulations by David H. Glass. We here put forward a variety of inference to the best explanation approaches for determining posterior probabilities by intertwining Bayesian and inference to the best explanation approaches. We then simulate their performances for the estimation of parameters in the Brock and Hommes agent-based model for asset pricing in finance. We find that performances depend on circumstances and also on the evaluation metric. However, most of the time our suggested approaches outperform the Bayesian approach.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109388"},"PeriodicalIF":3.2,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480019","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
A dialectical formalisation of preferred subtheories reasoning under resource bounds
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-17 DOI: 10.1016/j.ijar.2025.109385
Kees van Berkel , Marcello D'Agostino , Sanjay Modgil
{"title":"A dialectical formalisation of preferred subtheories reasoning under resource bounds","authors":"Kees van Berkel ,&nbsp;Marcello D'Agostino ,&nbsp;Sanjay Modgil","doi":"10.1016/j.ijar.2025.109385","DOIUrl":"10.1016/j.ijar.2025.109385","url":null,"abstract":"<div><div><em>Dialectical Classical Argumentation</em> (Dialectical <em>Cl-Arg</em>) has been shown to satisfy rationality postulates under resource bounds. In particular, the consistency and non-contamination postulates are satisfied despite dropping the assumption of logical omniscience and the consistency and subset minimality checks on arguments' premises that are deployed by standard approaches to <em>Cl-Arg</em>. This paper studies Dialectical <em>Cl-Arg</em>'s formalisation of Preferred Subtheories (<em>PS</em>) non-monotonic reasoning under resource bounds. The contribution of this paper is twofold. First, we establish soundness and completeness for Dialectical <em>Cl-Arg</em>'s credulous consequence relation under the <em>preferred</em> semantics and credulous <em>PS</em> consequences. This result paves the way for the use of argument game proof theories and dialogues that establish membership of arguments in admissible (and so preferred) extensions, and hence the credulous <em>PS</em> consequences of a belief base. Second, we refine the non-standard characteristic function for Dialectical <em>Cl-Arg</em>, and use this refined function to show soundness for Dialectical <em>Cl-Arg</em> consequences under the grounded semantics and resource-bounded sceptical <em>PS</em> consequence. We provide a counterexample that shows that completeness does not hold. However, we also show that the grounded consequences defined by Dialectical <em>Cl-Arg</em> strictly subsume the grounded consequences defined by standard <em>Cl-Arg</em> formalisations of <em>PS</em>, so that we recover sceptical <em>PS</em> consequences that one would intuitively expect to hold.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109385"},"PeriodicalIF":3.2,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143429220","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
An unsupervised feature extraction and fusion framework for multi-source data based on copula theory
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-13 DOI: 10.1016/j.ijar.2025.109384
Xiuwei Chen, Li Lai, Maokang Luo
{"title":"An unsupervised feature extraction and fusion framework for multi-source data based on copula theory","authors":"Xiuwei Chen,&nbsp;Li Lai,&nbsp;Maokang Luo","doi":"10.1016/j.ijar.2025.109384","DOIUrl":"10.1016/j.ijar.2025.109384","url":null,"abstract":"<div><div>With the development of big data technology, people are increasingly facing the challenge of dealing with massive amounts of multi-source or multi-sensor data. Therefore, it becomes crucial to extract valuable information from such data. Information fusion techniques provide effective solutions for handling multi-source data and can be categorized into three levels: data-level fusion, feature-level fusion, and decision-level fusion. Feature-level fusion combines features from multiple sources to create a consolidated feature, enhancing information richness. This paper proposes an unsupervised feature extraction and fusion method for multi-source data that utilizes the R-Vine copula, denoted as CF. The method starts by performing kernel density estimation to extract each data source's marginal density and distribution. Next, the maximum spanning tree is employed to select a vine structure for each attribute, and the corresponding copulas are chosen using maximum likelihood estimation and the AIC criterion. The joint probability density of each attribute across all information sources can be obtained by utilizing the relevant vine structure and copulas, serving as the final fusion feature. Finally, the proposed method is evaluated on eighteen simulated datasets and six real datasets. The results indicate that compared to several state-of-the-art fusion methods, the CF method can significantly enhance the classification accuracy of popular classifiers such as KNN, SVM, and Logistic Regression.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109384"},"PeriodicalIF":3.2,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143419648","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
Efficient parameter-free adaptive hashing for large-scale cross-modal retrieval
IF 3.2 3区 计算机科学
International Journal of Approximate Reasoning Pub Date : 2025-02-10 DOI: 10.1016/j.ijar.2025.109383
Bo Li , You Wu , Zhixin Li
{"title":"Efficient parameter-free adaptive hashing for large-scale cross-modal retrieval","authors":"Bo Li ,&nbsp;You Wu ,&nbsp;Zhixin Li","doi":"10.1016/j.ijar.2025.109383","DOIUrl":"10.1016/j.ijar.2025.109383","url":null,"abstract":"<div><div>The intention of deep cross-modal hashing retrieval (DCMHR) is to explore the connections between multi-media data, but most methods are only applicable to a few modalities and cannot be extended to other scenarios. Meanwhile, many methods also fail to emphasize the importance of unified training for classification loss and hash loss, which can also reduce the robustness and effectiveness of the model. Regarding these two issues, this paper designs Efficient Parameter-free Adaptive Hashing for Large-Scale Cross-Modal Retrieval (EPAH) to adaptively extract the modality variations and collect corresponding semantics of cross-modal features into the generated hash codes. EPAH does not use hyper-parameters, weight vectors, auxiliary matrices, and other structures to learn cross-modal data, while efficient parameter-free adaptive hashing can achieve multi-modal retrieval tasks. Specifically, our proposal is a two-stage strategy, divided into feature extraction and unified training, both stages are parameter-free adaptive learning. Meanwhile, this article simplifies the model training settings, selects the more stable gradient descent method, and designs the unified hash code generation function. Comprehensive experiments evidence that our EPAH approach can outperform the SoTA DCMHR methods. In addition, EPAH conducts the essential analysis of out-of-modality extension and parameter anti-interference, which demonstrates generalization and innovation. The code is available at <span><span>https://github.com/libo-02/EPAH</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109383"},"PeriodicalIF":3.2,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143395813","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信