標(biāo)題: Titlebook: Belief Functions: Theory and Applications; 5th International Co Sébastien Destercke,Thierry Denoeux,Arnaud Martin Conference proceedings 20 [打印本頁] 作者: 太平間 時(shí)間: 2025-3-21 17:00
書目名稱Belief Functions: Theory and Applications影響因子(影響力)
書目名稱Belief Functions: Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Belief Functions: Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Belief Functions: Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Belief Functions: Theory and Applications被引頻次
書目名稱Belief Functions: Theory and Applications被引頻次學(xué)科排名
書目名稱Belief Functions: Theory and Applications年度引用
書目名稱Belief Functions: Theory and Applications年度引用學(xué)科排名
書目名稱Belief Functions: Theory and Applications讀者反饋
書目名稱Belief Functions: Theory and Applications讀者反饋學(xué)科排名
作者: 極為憤怒 時(shí)間: 2025-3-21 20:49 作者: 裁決 時(shí)間: 2025-3-22 01:30 作者: 小隔間 時(shí)間: 2025-3-22 06:53 作者: charisma 時(shí)間: 2025-3-22 12:20 作者: WAIL 時(shí)間: 2025-3-22 16:29
Stamos T. Karamouzis,Stefan Feyockking process. Among the various recommendation approaches, Collaborative Filtering (CF) is considered as one of the most popular techniques in RSs. CF techniques are categorized into model-based and memory-based. Model-based approaches consist in learning a model from past ratings to perform predict作者: Condense 時(shí)間: 2025-3-22 19:10
Stavros C. Kassinos,William C. Reynoldszation where the objective is to determine the zone where the mobile sensor resides at any instant. The proposed approach uses the belief functions theory to define an evidence framework, for estimating the most probable sensor’s zone. Real experiments demonstrate the effectiveness of this approach 作者: PLAYS 時(shí)間: 2025-3-22 22:57 作者: 小故事 時(shí)間: 2025-3-23 01:53
Sedat Biringen,Haluk ?rs,Joel H. Ferzigerto improve their problem-solving performance and competence. However, to the best of our knowledge, all of them are not able to make use of prior knowledge which can be offered by domain experts, especially that CBR is widely applied in real-life domains. For instance, given symptoms of two differen作者: 精確 時(shí)間: 2025-3-23 08:12 作者: subordinate 時(shí)間: 2025-3-23 12:25
P. Hortelano,M. J. Faus,F. Sanchez-Medinad by the lower and upper expectations associated with the lower and upper probabilities associated with a belief measure. This generalised setting permits a more cautious appreciation of the information content of a training set. We analytically derive the Karush-Kuhn-Tucker conditions for the gener作者: Etching 時(shí)間: 2025-3-23 16:58
https://doi.org/10.1007/978-3-642-68195-0including Yager’s, Dubois’, and disjunctive combination, starting from the case of binary frames of discernment. Believability measures for unnormalised belief functions are also considered. A research programme to complete this analysis is outlined.作者: 陶醉 時(shí)間: 2025-3-23 18:17 作者: EXPEL 時(shí)間: 2025-3-23 22:15 作者: 安慰 時(shí)間: 2025-3-24 06:08 作者: 偶像 時(shí)間: 2025-3-24 06:53
Challenges of the Ultimate Messengers,ght delay) induced by airspace congestion through an appropriated FLA taking account of uncertainties such as weather condition, flight velocity, flight departure time, etc. Among these uncertainties, we assume that the flight departure time, which follows a Mixture Gaussian Distribution, is certain作者: 即席演說 時(shí)間: 2025-3-24 13:08
https://doi.org/10.1007/978-3-030-45402-9unctions to model uncertainties has been proposed for smart cars network. Since the origin of data coming from other cars is unknown, this algorithm uses the idempotent cautious operator in order to prevent data incest. This operator has been proved to be efficient in the case of transient errors an作者: Militia 時(shí)間: 2025-3-24 15:23 作者: 枯萎將要 時(shí)間: 2025-3-24 22:03 作者: Deadpan 時(shí)間: 2025-3-25 00:53 作者: 瘋狂 時(shí)間: 2025-3-25 05:03 作者: 正式通知 時(shí)間: 2025-3-25 07:52
Formal Verification in Railways,ication system. In this method, the evidential C-means algorithm is first used to obtain credal partitions of the training set. The clustering process operates in a supervised way by means of weighted product-space clustering with the goals of obtaining both good inter-cluster separability and inner作者: Lipohypertrophy 時(shí)間: 2025-3-25 15:30 作者: CURL 時(shí)間: 2025-3-25 18:12 作者: 敲竹杠 時(shí)間: 2025-3-25 20:59 作者: 書法 時(shí)間: 2025-3-26 00:29
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/183300.jpg作者: 注入 時(shí)間: 2025-3-26 06:11 作者: 產(chǎn)生 時(shí)間: 2025-3-26 09:01 作者: minion 時(shí)間: 2025-3-26 14:51
https://doi.org/10.1007/978-3-642-68195-0including Yager’s, Dubois’, and disjunctive combination, starting from the case of binary frames of discernment. Believability measures for unnormalised belief functions are also considered. A research programme to complete this analysis is outlined.作者: 慟哭 時(shí)間: 2025-3-26 17:10
India Studies in Business and Economicsusing Dempster’s rule of combination. From that perspective, the output probabilities from such classifiers can be seen as normalized plausibilities, for some mass functions that can be laid bare. This finding suggests that the theory of belief functions is a more general framework for classifier construction than is usually considered.作者: enlist 時(shí)間: 2025-3-26 21:05 作者: bifurcate 時(shí)間: 2025-3-27 03:11
Formal Methods Through Domain Engineering,operty that characterizes Shannon’s definitions of entropy and conditional entropy for discrete probability distributions. None of the existing definitions of entropy for belief functions in the D-S theory satisfy such a compound distributions property. We describe some important properties of our definition.作者: Celiac-Plexus 時(shí)間: 2025-3-27 06:10
Vicki V. Vandaveer,Tracey E. RizzutoWe propose the use of Smets and PCR5 rules to merge artificial geophysical and geotechnical data, as part of fluvial levee assessment. It highlights the ability to characterize the presence of interfaces and a geological anomaly.作者: fetter 時(shí)間: 2025-3-27 09:39 作者: Feedback 時(shí)間: 2025-3-27 17:06
An Evidential Collaborative Filtering Approach Based on Items Contents Clustering,king process. Among the various recommendation approaches, Collaborative Filtering (CF) is considered as one of the most popular techniques in RSs. CF techniques are categorized into model-based and memory-based. Model-based approaches consist in learning a model from past ratings to perform predict作者: Pelago 時(shí)間: 2025-3-27 19:32
The Belief Functions Theory for Sensors Localization in Indoor Wireless Networks,zation where the objective is to determine the zone where the mobile sensor resides at any instant. The proposed approach uses the belief functions theory to define an evidence framework, for estimating the most probable sensor’s zone. Real experiments demonstrate the effectiveness of this approach 作者: offense 時(shí)間: 2025-3-28 01:59
On Evidential Clustering with Partial Supervision, a credal partition coherent with the background knowledge. The main characteristics of the new method is its ability to express the uncertainties of partial prior information by assigning each constrained object to a set of labels. It enriches previous existing algorithm that allows the preservatio作者: Inveterate 時(shí)間: 2025-3-28 04:57
Exploiting Domain-Experts Knowledge Within an Evidential Process for Case Base Maintenance,to improve their problem-solving performance and competence. However, to the best of our knowledge, all of them are not able to make use of prior knowledge which can be offered by domain experts, especially that CBR is widely applied in real-life domains. For instance, given symptoms of two differen作者: 虛情假意 時(shí)間: 2025-3-28 06:17 作者: menopause 時(shí)間: 2025-3-28 11:56 作者: 小說 時(shí)間: 2025-3-28 15:04
General Geometry of Belief Function Combination,including Yager’s, Dubois’, and disjunctive combination, starting from the case of binary frames of discernment. Believability measures for unnormalised belief functions are also considered. A research programme to complete this analysis is outlined.作者: staging 時(shí)間: 2025-3-28 19:44 作者: Benign 時(shí)間: 2025-3-28 23:35 作者: 跟隨 時(shí)間: 2025-3-29 04:34 作者: ODIUM 時(shí)間: 2025-3-29 07:52 作者: HEDGE 時(shí)間: 2025-3-29 13:10
,Study of Distributed Data Fusion Using Dempster’s Rule and Cautious Operator,unctions to model uncertainties has been proposed for smart cars network. Since the origin of data coming from other cars is unknown, this algorithm uses the idempotent cautious operator in order to prevent data incest. This operator has been proved to be efficient in the case of transient errors an作者: Infusion 時(shí)間: 2025-3-29 16:49
Uncertainty-Aware Parzen-Rosenblatt Classifier for Multiattribute Data,meworks proposed in this area, determining the basic probability assignment remains an open issue. To address this problem, this paper proposes a novel Dempster-Shafer scheme based on Parzen-Rosenblatt windowing for multi-attribute data classification. More explicitly, training data are used to cons作者: Ferritin 時(shí)間: 2025-3-29 21:39 作者: 松雞 時(shí)間: 2025-3-30 00:57
Evidential Independence Maximization on Twitter Network,y are independent in their choices and decisions. Independent users may attract other users and make them adopt their point of view. A user is qualified as independent when his/her point of view does not depend on others ideas. Thus, the behavior of such a user is independent from other behaviors. D作者: Muscularis 時(shí)間: 2025-3-30 07:47
An Evidential ,-nearest Neighbors Combination Rule for Tree Species Recognition,.-nearest neighbors (.-NN) combination rule. The proposed rule is adapted to classification problems where we have a large number of classes with an intra-class variability and an inter-class similarity like the problem of tree species recognition. Finally, we compare the performance of the proposed作者: 假裝是你 時(shí)間: 2025-3-30 12:11 作者: Intentional 時(shí)間: 2025-3-30 13:55
A Decomposable Entropy of Belief Functions in the Dempster-Shafer Theory,operty that characterizes Shannon’s definitions of entropy and conditional entropy for discrete probability distributions. None of the existing definitions of entropy for belief functions in the D-S theory satisfy such a compound distributions property. We describe some important properties of our d作者: Sinus-Node 時(shí)間: 2025-3-30 17:17 作者: bromide 時(shí)間: 2025-3-30 21:43
https://doi.org/10.1007/978-3-642-68195-0ation for finitely defined belief functions and belief functions defined on reals. In addition, for such belief functions we consider the Wasserstein metric and study its connections to disjunctions of belief functions.作者: Ischemia 時(shí)間: 2025-3-31 03:40 作者: Cumulus 時(shí)間: 2025-3-31 08:34
The Kantorovich Problem and Wasserstein Metric in the Theory of Belief Functions,ation for finitely defined belief functions and belief functions defined on reals. In addition, for such belief functions we consider the Wasserstein metric and study its connections to disjunctions of belief functions.作者: 不成比例 時(shí)間: 2025-3-31 12:49 作者: 喃喃而言 時(shí)間: 2025-3-31 16:24
Conference proceedings 2018n theoretical aspects (including for example statistical inference, mathematical foundations,?continuous belief functions) as well as on applications in various areas including classification, statistics, data fusion, network analysis and intelligent vehicles..作者: 催眠 時(shí)間: 2025-3-31 20:54
Aircraft wake vortices in the atmosphere,n of the uncertainty in the constraint by adding the possibility to favor crisp decision following the inherent structure of the dataset. The advantages of the proposed approach are illustrated using both a synthetic dataset and a real genomics dataset.作者: 多嘴多舌 時(shí)間: 2025-4-1 01:01 作者: 圖畫文字 時(shí)間: 2025-4-1 03:22 作者: 遺留之物 時(shí)間: 2025-4-1 09:53
On Evidential Clustering with Partial Supervision,n of the uncertainty in the constraint by adding the possibility to favor crisp decision following the inherent structure of the dataset. The advantages of the proposed approach are illustrated using both a synthetic dataset and a real genomics dataset.作者: Amylase 時(shí)間: 2025-4-1 13:45
From Relations Between Sets to Relations Between Belief Functions,lations to belief functions, using constrained stochastic matrices to identify those belief functions in relation. We then study some properties of our proposal, as well as its relations with existing works focusing on peculiar relations.
