发布求助
文献互助 智能选刊 最新文献

Int. J. Approx. Reason.最新文献

筛选
英文 中文
Notes on "On (O, G)-fuzzy rough sets based on overlap and grouping functions over complete lattices" 关于“完全格上基于重叠和分组函数的on (O, G)-模糊粗糙集”的注解
Int. J. Approx. Reason. Pub Date : 2022-09-01 DOI: 10.1016/j.ijar.2022.09.013
Chun Yong Wang, Rong Tao Wu, Bo Zhang
{"title":"Notes on \"On (O, G)-fuzzy rough sets based on overlap and grouping functions over complete lattices\"","authors":"Chun Yong Wang, Rong Tao Wu, Bo Zhang","doi":"10.1016/j.ijar.2022.09.013","DOIUrl":"https://doi.org/10.1016/j.ijar.2022.09.013","url":null,"abstract":"","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"148 1","pages":"344-359"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79363117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Nonlinear desirability theory 非线性期望理论
Int. J. Approx. Reason. Pub Date : 2022-09-01 DOI: 10.48550/arXiv.2209.00686
Enrique Miranda, Marco Zaffalon
{"title":"Nonlinear desirability theory","authors":"Enrique Miranda, Marco Zaffalon","doi":"10.48550/arXiv.2209.00686","DOIUrl":"https://doi.org/10.48550/arXiv.2209.00686","url":null,"abstract":"Desirability can be understood as an extension of Anscombe and Aumann's Bayesian decision theory to sets of expected utilities. At the core of desirability lies an assumption of linearity of the scale in which rewards are measured. It is a traditional assumption used to derive the expected utility model, which clashes with a general representation of rational decision making, though. Allais has, in particular, pointed this out in 1953 with his famous paradox. We note that the utility scale plays the role of a closure operator when we regard desirability as a logical theory. This observation enables us to extend desirability to the nonlinear case by letting the utility scale be represented via a general closure operator. The new theory directly expresses rewards in actual nonlinear currency (money), much in Savage's spirit, while arguably weakening the founding assumptions to a minimum. We characterise the main properties of the new theory both from the perspective of sets of gambles and of their lower and upper prices (previsions). We show how Allais paradox finds a solution in the new theory, and discuss the role of sets of probabilities in the theory.","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"22 1","pages":"176-199"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74215381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Learning and total evidence with imprecise probabilities 学习和不精确概率的全部证据
Int. J. Approx. Reason. Pub Date : 2022-09-01 DOI: 10.1016/j.ijar.2022.08.016
Ruobin Gong, J. Kadane, M. Schervish, Teddy Seidenfeld, R. Stern
{"title":"Learning and total evidence with imprecise probabilities","authors":"Ruobin Gong, J. Kadane, M. Schervish, Teddy Seidenfeld, R. Stern","doi":"10.1016/j.ijar.2022.08.016","DOIUrl":"https://doi.org/10.1016/j.ijar.2022.08.016","url":null,"abstract":"","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"297 1","pages":"21-32"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82863285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
An approach to improve argumentation-based epistemic planning with contextual preferences 基于上下文偏好的基于论证的认知规划改进方法
Int. J. Approx. Reason. Pub Date : 2022-09-01 DOI: 10.1016/j.ijar.2022.09.005
J. C. Teze, L. Godo, Gerardo I. Simari
{"title":"An approach to improve argumentation-based epistemic planning with contextual preferences","authors":"J. C. Teze, L. Godo, Gerardo I. Simari","doi":"10.1016/j.ijar.2022.09.005","DOIUrl":"https://doi.org/10.1016/j.ijar.2022.09.005","url":null,"abstract":"","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"3 1","pages":"130-163"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73626895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Motivating explanations in Bayesian networks using MAP-independence 基于map独立性的贝叶斯网络激励解释
Int. J. Approx. Reason. Pub Date : 2022-08-05 DOI: 10.48550/arXiv.2208.03121
J. Kwisthout
{"title":"Motivating explanations in Bayesian networks using MAP-independence","authors":"J. Kwisthout","doi":"10.48550/arXiv.2208.03121","DOIUrl":"https://doi.org/10.48550/arXiv.2208.03121","url":null,"abstract":"In decision support systems the motivation and justification of the system's diagnosis or classification is crucial for the acceptance of the system by the human user. In Bayesian networks a diagnosis or classification is typically formalized as the computation of the most probable joint value assignment to the hypothesis variables, given the observed values of the evidence variables (generally known as the MAP problem). While solving the MAP problem gives the most probable explanation of the evidence, the computation is a black box as far as the human user is concerned and it does not give additional insights that allow the user to appreciate and accept the decision. For example, a user might want to know to whether an unobserved variable could potentially (upon observation) impact the explanation, or whether it is irrelevant in this aspect. In this paper we introduce a new concept, MAP- independence, which tries to capture this notion of relevance, and explore its role towards a potential justification of an inference to the best explanation. We formalize several computational problems based on this concept and assess their computational complexity.","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"20 1","pages":"18-28"},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87547180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Fast Causal Orientation Learning in Directed Acyclic Graphs 有向无环图的快速因果定向学习
Int. J. Approx. Reason. Pub Date : 2022-05-27 DOI: 10.48550/arXiv.2205.13919
Ramin Safaeian, Saber Salehkaleybar, M. Tabandeh
{"title":"Fast Causal Orientation Learning in Directed Acyclic Graphs","authors":"Ramin Safaeian, Saber Salehkaleybar, M. Tabandeh","doi":"10.48550/arXiv.2205.13919","DOIUrl":"https://doi.org/10.48550/arXiv.2205.13919","url":null,"abstract":"Causal relationships among a set of variables are commonly represented by a directed acyclic graph. The orientations of some edges in the causal DAG can be discovered from observational/interventional data. Further edges can be oriented by iteratively applying so-called Meek rules. Inferring edges’ orientations from some previously oriented edges, which we call Causal Orientation Learning (COL), is a common problem in various causal discovery tasks. In these tasks, it is often required to solve multiple COL problems and therefore applying Meek rules could be time consuming. Motivated by Meek rules, we introduce Meek functions that can be utilized in solving COL problems. In particular, we show that these functions have some desirable properties, enabling us to speed up the process of applying Meek rules. In particular, we propose a dynamic programming (DP) based method to apply Meek functions. Moreover, based on the proposed DP method, we present a lower bound on the number of edges that can be oriented as a result of intervention. We also propose a method to check whether some oriented edges belong to a causal DAG. Experimental results show that the proposed methods can outperform previous work in several causal discovery tasks in terms of running-time.","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"36 1","pages":"49-86"},"PeriodicalIF":0.0,"publicationDate":"2022-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76439461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fuzzy Simulations and Bisimulations between Fuzzy Automata 模糊仿真与模糊自动机间的双仿真
Int. J. Approx. Reason. Pub Date : 2022-05-04 DOI: 10.48550/arXiv.2205.01955
Linh Anh Nguyen
{"title":"Fuzzy Simulations and Bisimulations between Fuzzy Automata","authors":"Linh Anh Nguyen","doi":"10.48550/arXiv.2205.01955","DOIUrl":"https://doi.org/10.48550/arXiv.2205.01955","url":null,"abstract":"Simulations and bisimulations between two fuzzy automata over a complete residuated lattice were defined by 'Ciri'c et al. (2012) as fuzzy relations between the sets of states of the automata. However, they act as a crisp relationship between the automata. In particular, if there exists a (forward) bisimulation between two fuzzy automata, then the fuzzy languages recognized by them are crisply equal. Approximate simulations and bisimulations introduced by Stanimirovi'c et al. (2020) aim at fuzzifying this phenomenon. However, they are defined only for fuzzy automata over a complete Heyting algebra and do not give the exact relationship between states of the automata. In this article, we introduce and study fuzzy simulations and bisimulations between fuzzy automata over a complete residuated lattice. These notions are novel and have good properties. They are defined for fuzzy automata over any complete residuated lattice. We prove that the fuzzy language recognized by a fuzzy automaton is fuzzily preserved by fuzzy simulations and fuzzily invariant under fuzzy bisimulations. We also prove that the notions of fuzzy simulation and bisimulation have the Hennessy-Milner properties, which are a logical characterization of the greatest fuzzy simulation or bisimulation between two fuzzy automata. In addition, we provide results showing that our notions of fuzzy simulation and bisimulation are more general and refined than the notions of simulation and bisimulation introduced by 'Ciri'c et al. and the notions of approximate simulation and bisimulation introduced by Stanimirovi'c et al.","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"22 1","pages":"113-131"},"PeriodicalIF":0.0,"publicationDate":"2022-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89002856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
The structure theorem of three-way concept lattice 三向概念格的结构定理
Int. J. Approx. Reason. Pub Date : 2022-05-01 DOI: 10.1016/j.ijar.2022.04.007
Yanhui Zhai, Jianjun Qi, Deyu Li, Chao Zhang, Weihua Xu
{"title":"The structure theorem of three-way concept lattice","authors":"Yanhui Zhai, Jianjun Qi, Deyu Li, Chao Zhang, Weihua Xu","doi":"10.1016/j.ijar.2022.04.007","DOIUrl":"https://doi.org/10.1016/j.ijar.2022.04.007","url":null,"abstract":"","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"168 ","pages":"157-173"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91450999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Continuity and Additivity Properties of Information Decompositions 信息分解的连续性和可加性
Int. J. Approx. Reason. Pub Date : 2022-04-23 DOI: 10.48550/arXiv.2204.10982
Johannes Rauh, P. Banerjee, E. Olbrich, Guido Montúfar, J. Jost
{"title":"Continuity and Additivity Properties of Information Decompositions","authors":"Johannes Rauh, P. Banerjee, E. Olbrich, Guido Montúfar, J. Jost","doi":"10.48550/arXiv.2204.10982","DOIUrl":"https://doi.org/10.48550/arXiv.2204.10982","url":null,"abstract":"Information decompositions quantify how the Shannon information about a given random variable is distributed among several other random variables. Various requirements have been proposed that such a decomposition should satisfy, leading to different candidate solutions. Curiously, however, only two of the original requirements that determined the Shannon information have been considered, namely monotonicity and normalization. Two other important properties, continuity and additivity, have not been considered. In this contribution, we focus on the mutual information of two finite variables $Y,Z$ about a third finite variable $S$ and check which of the decompositions satisfy these two properties. While most of them satisfy continuity, only one of them is both continuous and additive.","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"157 1","pages":"108979"},"PeriodicalIF":0.0,"publicationDate":"2022-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77271878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Distribution-free risk analysis 无分销风险分析
Int. J. Approx. Reason. Pub Date : 2022-04-01 DOI: 10.1016/j.ijar.2022.04.001
Ander Gray, S. Ferson, V. Kreinovich, E. Patelli
{"title":"Distribution-free risk analysis","authors":"Ander Gray, S. Ferson, V. Kreinovich, E. Patelli","doi":"10.1016/j.ijar.2022.04.001","DOIUrl":"https://doi.org/10.1016/j.ijar.2022.04.001","url":null,"abstract":"","PeriodicalId":13685,"journal":{"name":"Int. J. Approx. Reason.","volume":"98 1","pages":"133-156"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76084294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
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学术官方微信