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

Decision with belief functions and generalized independence: Two impossibility theorems1 具有信念函数和广义独立性的决策：两个不可能性定理1

IF 3.2 3区计算机科学

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

Helene Fargier , Romain Guillaume

引用次数: 0

Neighborhood margin rough set: Self-tuning neighborhood threshold 邻域边际粗糙集自调整邻域阈值

IF 3.2 3区计算机科学

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

Mingjie Cai , Haichao Wang , Feng Xu , Qingguo Li

{"title":"Neighborhood margin rough set: Self-tuning neighborhood threshold","authors":"Mingjie Cai , Haichao Wang , Feng Xu , Qingguo Li","doi":"10.1016/j.ijar.2024.109271","DOIUrl":"10.1016/j.ijar.2024.109271","url":null,"abstract":"<div><p>The neighborhood threshold in the neighborhood rough set has a significant impact on the neighborhood relation. When the neighborhood threshold of an object exceeds the critical value, the labels of objects in the neighborhood are not completely consistent, and the critical value of each object often differs. Most existing neighborhood rough set models cannot adaptively regulate the neighborhood threshold. In this paper, we introduce a novel neighborhood rough set model that incorporates a self-tuning mechanism for the neighborhood threshold, taking into account the distribution of objects across different areas. The neighborhood margin is a measure proposed to assess the condition of neighborhoods, and it is calculated by subtracting the neighborhood threshold from the closest distance between heterogeneous elements. The neighborhood margin accurately represents the local state of the neighborhood, taking into account decision information. The margin neighborhood is proposed with a self-tuning the neighborhood threshold. Finally, we introduce the margin neighborhood rough set model and margin neighborhood-based attribute reduction algorithm, and explore the relationship between the proposed model and the neighborhood rough set model. The experiment examines the performance of reducts under various measures, and demonstrates that the neighborhood margin rough set reduces the uncertainty of neighborhood granules effectively, leading to excellent classification performance compared to other neighborhood-based SOTA models.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"174 ","pages":"Article 109271"},"PeriodicalIF":3.2,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142076906","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

Formal and cognitive reasoning 形式推理和认知推理

IF 3.2 3区计算机科学

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

Christoph Beierle , Marco Ragni , Kai Sauerwald , Frieder Stolzenburg , Matthias Thimm

引用次数: 0

Three-way concept lattice from adjunctive positive and negative concepts 来自正反概念的三向概念网格

IF 3.2 3区计算机科学

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

Binghan Long , Tingquan Deng , Yiyu Yao , Weihua Xu

{"title":"Three-way concept lattice from adjunctive positive and negative concepts","authors":"Binghan Long , Tingquan Deng , Yiyu Yao , Weihua Xu","doi":"10.1016/j.ijar.2024.109272","DOIUrl":"10.1016/j.ijar.2024.109272","url":null,"abstract":"<div><p>Three-way concept lattices (TCLs) have been widely explored due to their clear hierarchical structures, concise visual description and good interpretability. In contrast to classic formal contexts, lattice-valued fuzzy contexts exhibit great capability in describing and representing concepts with uncertainty. Different from conventional approaches to research of TCLs, this paper focuses on investigating the algebraic structure and properties of three-way concept lattice (TCL) stemmed from the positive concept lattice and negative concept lattice in a lattice-valued formal context. Several associated concept lattices such as the Cartesian product of positive concept lattice and negative lattice (i.e., pos-neg lattice), lattices induced from the partition of the pos-neg lattice, and their relationship are explored. Specifically, the isomorphism, embedding and order-preserving mappings between them are built. The quotient set of pos-neg lattice when being defined a specific equivalence relation on it is a complete lattice and each equivalence class is a lower semi-lattice. It is further declared that the structure of TCL is intrinsically and determined wholly by the pos-neg lattice. A practical application of the built theory of TCL is provided to sort alternatives in multi-criteria decision making.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"174 ","pages":"Article 109272"},"PeriodicalIF":3.2,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142084199","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

Description lattices of generalised convex hulls 广义凸壳的描述网格

IF 3.2 3区计算机科学

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

Christophe Demko, Karell Bertet, Jean-François Viaud, Cyril Faucher, Damien Mondou

引用次数: 0

A review of three-way decision: Triadic understanding, organization, and perspectives 回顾三方决策：三方理解、组织和观点

IF 3.2 3区计算机科学

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

Langwangqing Suo , Han Yang , Qiaoyi Li , Hai-Long Yang , Yiyu Yao

{"title":"A review of three-way decision: Triadic understanding, organization, and perspectives","authors":"Langwangqing Suo , Han Yang , Qiaoyi Li , Hai-Long Yang , Yiyu Yao","doi":"10.1016/j.ijar.2024.109268","DOIUrl":"10.1016/j.ijar.2024.109268","url":null,"abstract":"<div><p>A theory of three-way decision is about thinking, problem-solving, and computing in threes or through triads. In this paper, we review fifteen years of research on three-way decision by using the philosophy-theory-application triad and the who-what-when triad. First, we discuss the philosophy, theory, and application of three-way decision. At the philosophy level, we delve into the philosophical roots and fundamental nature of three-way decision to reveal the underlying philosophical thinking. At the theory level, we provide an insightful analysis of the theory and methodology of three-way decision. At the application level, we examine the integration of three-way decision with other theories and their applications and effectiveness in real-world scenarios. Second, we focus on bibliometrics analytics by using the who-what-when triad, which attempts to answer a fundamental question of “who did what when”. We propose a <span><math><mn>3</mn><mo>×</mo><mn>3</mn></math></span> model by applying the <span><math><mn>3</mn><mo>×</mo><mn>3</mn></math></span> method of three-way decision. The first 3 is the author-topic-time triad. The second 3 represents a three-level analysis for each of the first three: (1) categorizing authors into the three levels of prolific authors, frequent authors, and occasional authors, (2) classifying topics into the three levels of the core topics, emerging topics, and to-be-explored topics, and (3) dividing articles into the three levels of initial investigations, further developments, and most recent studies. Finally, we perform a bibliometrics analysis of three-way decision articles by using the <span><math><mn>3</mn><mo>×</mo><mn>3</mn></math></span> model of three-way decision. The results not only reveal the current status and trend of three-way decision research but also provide a road map for future research.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"173 ","pages":"Article 109268"},"PeriodicalIF":3.2,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141985060","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

Identifying arguments within a text: Categorizing errors and their impact in arguments' relation prediction 识别文本中的论点：错误分类及其对论据关系预测的影响

IF 3.2 3区计算机科学

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

Federico M. Schmidt, Sebastian Gottifredi, Alejandro J. García

引用次数: 0

On the enumeration of non-dominated matroids with imprecise weights 关于枚举权重不精确的非支配矩阵

IF 3.2 3区计算机科学

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

Tom Davot , Tuan-Anh Vu , Sébastien Destercke , David Savourey

引用次数: 0

Pairwise comparison matrices with uniformly ordered efficient vectors 具有均匀有序高效向量的配对比较矩阵

IF 3.2 3区计算机科学

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

Susana Furtado , Charles R. Johnson

{"title":"Pairwise comparison matrices with uniformly ordered efficient vectors","authors":"Susana Furtado , Charles R. Johnson","doi":"10.1016/j.ijar.2024.109265","DOIUrl":"10.1016/j.ijar.2024.109265","url":null,"abstract":"<div><p>Our primary interest is understanding reciprocal matrices all of whose efficient vectors are ordinally the same, i.e., there is only one efficient order (we call these matrices uniformly ordered, UO). These are reciprocal matrices for which no efficient vector produces strict order reversals. A reciprocal matrix is called column ordered (CO) if each column is ordinally the same. Efficient vectors for a CO matrix with the same order of the columns always exist. For example, the entry-wise geometric mean of some or all columns of a reciprocal matrix is efficient and, if the matrix is CO, has the same order of the columns. A necessary, but not sufficient, condition for UO is that the matrix be CO and then the only efficient order should be satisfied by the columns (possibly weakly). In the case <span><math><mi>n</mi><mo>=</mo><mn>3</mn></math></span>, CO is necessary and sufficient for UO, but not for <span><math><mi>n</mi><mo>></mo><mn>3</mn></math></span>. We characterize the 4-by-4 UO matrices and identify the three possible alternate orders when the matrix is CO (and give entry-wise conditions for their occurrence). We also describe the simple perturbed consistent matrices that are UO. Some of the technology developed for this purpose is of independent interest.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"173 ","pages":"Article 109265"},"PeriodicalIF":3.2,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X2400152X/pdfft?md5=46ced9a2ce3c58f5412d1fff892e8440&pid=1-s2.0-S0888613X2400152X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937937","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

The most likely common cause 最常见的原因

IF 3.2 3区计算机科学

International Journal of Approximate Reasoning Pub Date : 2024-07-29 DOI: 10.1016/j.ijar.2024.109264

A. Hovhannisyan , A.E. Allahverdyan

{"title":"The most likely common cause","authors":"A. Hovhannisyan , A.E. Allahverdyan","doi":"10.1016/j.ijar.2024.109264","DOIUrl":"10.1016/j.ijar.2024.109264","url":null,"abstract":"<div><p>The common cause principle for two random variables <em>A</em> and <em>B</em> is examined in the case of causal insufficiency, when their common cause <em>C</em> is known to exist, but only the joint probability of <em>A</em> and <em>B</em> is observed. As a result, <em>C</em> cannot be uniquely identified (the latent confounder problem). We show that the generalized maximum likelihood method can be applied to this situation and allows identification of <em>C</em> that is consistent with the common cause principle. It closely relates to the maximum entropy principle. Investigation of the two binary symmetric variables reveals a non-analytic behavior of conditional probabilities reminiscent of a second-order phase transition. This occurs during the transition from correlation to anti-correlation in the observed probability distribution. The relation between the generalized likelihood approach and alternative methods, such as predictive likelihood and minimum common entropy, is discussed. The consideration of the common cause for three observed variables (and one hidden cause) uncovers causal structures that defy representation through directed acyclic graphs with the Markov condition.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"173 ","pages":"Article 109264"},"PeriodicalIF":3.2,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937938","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