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

On A-Sheffer strokes: A new class of cone-monotone functions and their ordinal sum constructions 关于A- sheffer笔划：一类新的锥单调函数及其序和构造

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2026-01-01 Epub Date: 2025-10-09 DOI: 10.1016/j.ijar.2025.109583

Yan Zou , Feng Qin , Ting-hai Zhang , Jian-Jun Li

{"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":"2026-01-01","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}

引用次数: 0

A novel three-way based self-adaptive filtering model for sentiment analysis 一种新的基于三向自适应的情感分析模型

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-08-05 DOI: 10.1016/j.ijar.2025.109536

Zhihui Zhang, Dun Liu, Rongping Shen

{"title":"A novel three-way based self-adaptive filtering model for sentiment analysis","authors":"Zhihui Zhang, Dun Liu, Rongping Shen","doi":"10.1016/j.ijar.2025.109536","DOIUrl":"10.1016/j.ijar.2025.109536","url":null,"abstract":"<div><div>In the era of social media and diverse communication platforms, understanding human emotion across various modalities has become a crucial challenge. While significant progress has been made in feature extraction and interaction techniques, several unresolved issues persist, particularly concerning the balance between these two aspects. A central question is whether all extracted features are of equal importance, or if some may contain redundant or noisy information that undermines effective modality interaction. To address these challenges, we propose a novel Three-Way Decision-Based Self-Adaptive Filtering Model (TWSAFM). Inspired by the three-way decision (TWD) theory, we introduce a self-adaptive filtering module that categorizes extracted modal features into three distinct domains: acceptable, rejectable, and reconsidering. This classification allows for separate processing of features, enabling the model to prioritize essential information while minimizing the impact of redundant and noisy data. Experimental validation on three benchmark datasets demonstrates that TWSAFM outperforms state-of-the-art methods in sentiment analysis tasks. Furthermore, training studies and parameter sensitivity analysis underscore the effectiveness of TWSAFM in efficiently filtering out irrelevant and noisy features, highlighting its robust contribution to enhancing feature interaction.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"187 ","pages":"Article 109536"},"PeriodicalIF":3.0,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144780439","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

FCPCA: Fuzzy clustering of high-dimensional time series based on common principal component analysis FCPCA：基于共主成分分析的高维时间序列模糊聚类

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-08-29 DOI: 10.1016/j.ijar.2025.109552

Ziling Ma, Ángel López-Oriona, Hernando Ombao, Ying Sun

{"title":"FCPCA: Fuzzy clustering of high-dimensional time series based on common principal component analysis","authors":"Ziling Ma, Ángel López-Oriona, Hernando Ombao, Ying Sun","doi":"10.1016/j.ijar.2025.109552","DOIUrl":"10.1016/j.ijar.2025.109552","url":null,"abstract":"<div><div>Clustering multivariate time series data is a crucial task in many domains, as it enables the identification of meaningful patterns and groups in time-evolving data. Traditional approaches, such as crisp clustering, rely on the assumption that clusters are sufficiently separated with little overlap. However, real-world data often defy this assumption, showing overlapping distributions or overlapping clouds of points and blurred boundaries between clusters. Fuzzy clustering offers a compelling alternative by allowing partial membership in multiple clusters, making it well-suited for these ambiguous scenarios. Despite its advantages, current fuzzy clustering methods primarily focus on univariate time series, and for multivariate cases, even datasets of moderate dimensionality become computationally prohibitive. This challenge is further exacerbated when dealing with time series of varying lengths, leaving a clear gap in addressing the complexities of modern datasets. This work introduces a novel fuzzy clustering approach based on common principal component analysis to address the aforementioned shortcomings. Our method has the advantage of efficiently handling high-dimensional multivariate time series by reducing dimensionality while preserving critical temporal features. Extensive numerical results show that our proposed clustering method outperforms several existing approaches in the literature. An interesting application involving brain signals from different drivers recorded from a simulated driving experiment illustrates the potential of the approach.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"187 ","pages":"Article 109552"},"PeriodicalIF":3.0,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144925197","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

A two-player newsvendor game with competition on demand under ambiguity 歧义条件下按需竞争的二人报摊博弈

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-08-11 DOI: 10.1016/j.ijar.2025.109546

Andrea Cinfrignini , Silvia Lorenzini , Davide Petturiti

{"title":"A two-player newsvendor game with competition on demand under ambiguity","authors":"Andrea Cinfrignini , Silvia Lorenzini , Davide Petturiti","doi":"10.1016/j.ijar.2025.109546","DOIUrl":"10.1016/j.ijar.2025.109546","url":null,"abstract":"<div><div>We deal with a single period two-player newsvendor game where both newsvendors are assumed to be rational and risk-neutral, and to operate under ambiguity. Each newsvendor needs to choose his/her order quantity of the same perishable product, whose global market demand is modeled by a discrete random variable, endowed with a reference probability measure. Furthermore, the global market demand is distributed to newsvendors according to a proportional allocation rule. We model the uncertainty faced by each newsvendor with an individual <em>ϵ</em>-contamination of the reference probability measure, computed with respect to a suitable class of probability measures. The resulting <em>ϵ</em>-contamination model preserves the expected demand under the reference probability and is used to compute the individual lower expected profit as a Choquet expectation. Therefore, the optimization problem of each player reduces to settle the order quantity that maximizes his/her lower expected profit, given the opponent choice, which is a maximin problem. In the resulting game, we prove that a Nash equilibrium always exists, though it may not be unique. Finally, we provide a characterization of Nash equilibria in terms of best response functions.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"187 ","pages":"Article 109546"},"PeriodicalIF":3.0,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144829499","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

Inner and outer approximation of the image of a set by a nonlinear function 用非线性函数对一个集合的象进行内外逼近

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-09-15 DOI: 10.1016/j.ijar.2025.109574

Maël Godard , Luc Jaulin , Damien Massé

引用次数: 0

Investigation of semantic behavior in probabilistic argumentation 概率论证中的语义行为研究

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-08-22 DOI: 10.1016/j.ijar.2025.109551

Zhaoqun Li, Beishui Liao, Chen Chen

引用次数: 0

Domain-informed and neural-optimized belief assignments: A framework applied to cultural heritage 领域信息和神经优化的信念分配：一个应用于文化遗产的框架

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-08-05 DOI: 10.1016/j.ijar.2025.109534

Sofiane Daimellah , Sylvie Le Hégarat-Mascle , Clotilde Boust

引用次数: 0

Unimodular triangulations in Łukasiewicz logic: Complexity bounds of probabilistic coherence Łukasiewicz逻辑中的单模三角剖分：概率相干性的复杂度界限

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-09-09 DOI: 10.1016/j.ijar.2025.109565

Tommaso Flaminio , Serafina Lapenta , Sebastiano Napolitano

引用次数: 0

Optimal scale combination selection based on a monotonic variable precision multi-scale rough set model 基于单调变精度多尺度粗糙集模型的最优尺度组合选择

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-09-10 DOI: 10.1016/j.ijar.2025.109569

Ruili Guo , Qinghua Zhang , Yunlong Cheng , Ying Yang , Hang Zhong

{"title":"Optimal scale combination selection based on a monotonic variable precision multi-scale rough set model","authors":"Ruili Guo , Qinghua Zhang , Yunlong Cheng , Ying Yang , Hang Zhong","doi":"10.1016/j.ijar.2025.109569","DOIUrl":"10.1016/j.ijar.2025.109569","url":null,"abstract":"<div><div>Most existing generalized multi-scale rough set models (GMRSMs) are based on Pawlak's rough set, which lacks fault tolerance and thus limits their generalization ability. To improve generalization, the variable precision generalized multi-scale rough set model (VPGMRSM) was proposed. However, this model disrupts the monotonicity of the positive region, posing challenges for optimal scale combination (OSC) selection. To address these issues, a monotonic VPGMRSM is proposed in this paper through a two-stage approximation process. The proposed model preserves the monotonicity of the GMRSM and the fault tolerance of the VPGMRSM, and is further applied to OSC selection. First, the non-monotonicity of the positive region in the original VPGMRSM is analyzed. Then, a monotonic VPGMRSM is proposed, whose information measurements are proven to satisfy the monotonicity lacking in the original model. Second, an extended definition of OSC is proposed based on the positive region in the new model, which significantly simplifies and improves the efficiency of the OSC selection process. Third, two OSC selection algorithms are proposed: one based on binary search to find a single OSC, and the other based on three-way decision theory to identify all OSCs. Finally, the experimental results validate the monotonicity of the positive region in the new model and demonstrate that the proposed algorithms are not only suitable for VPGMRSMs, but also effectively reduce the computation time.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"187 ","pages":"Article 109569"},"PeriodicalIF":3.0,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145044515","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

Flexible categorization using formal concept analysis and Dempster-Shafer theory 使用形式概念分析和Dempster-Shafer理论的灵活分类

IF 3 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2025-12-01 Epub Date: 2025-08-12 DOI: 10.1016/j.ijar.2025.109548

Marcel Boersma , Krishna Manoorkar , Alessandra Palmigiano , Mattia Panettiere , Apostolos Tzimoulis , Nachoem Wijnberg

引用次数: 0