標題: Titlebook: Belief Functions: Theory and Applications; 7th International Co Sylvie Le Hégarat-Mascle,Isabelle Bloch,Emanuel Al Conference proceedings 2 [打印本頁] 作者: 衰退 時間: 2025-3-21 17:12
書目名稱Belief Functions: Theory and Applications影響因子(影響力)
書目名稱Belief Functions: Theory and Applications影響因子(影響力)學科排名
書目名稱Belief Functions: Theory and Applications網(wǎng)絡公開度
書目名稱Belief Functions: Theory and Applications網(wǎng)絡公開度學科排名
書目名稱Belief Functions: Theory and Applications被引頻次
書目名稱Belief Functions: Theory and Applications被引頻次學科排名
書目名稱Belief Functions: Theory and Applications年度引用
書目名稱Belief Functions: Theory and Applications年度引用學科排名
書目名稱Belief Functions: Theory and Applications讀者反饋
書目名稱Belief Functions: Theory and Applications讀者反饋學科排名
作者: filial 時間: 2025-3-21 21:19
Themenmotivation und Gang der Untersuchung,at can be summarized by three numbers characterizing the most plausible predicted value, variability around this value, and epistemic uncertainty. Experiments with real datasets demonstrate the very good performance of the method as compared to state-of-the-art evidential and statistical learning algorithms.作者: 空洞 時間: 2025-3-22 01:04
Themenmotivation und Gang der Untersuchung,assifier, which can be scaled to 48 nodes (2688 cores) at a cluster named the Texas Advanced Computing Center Frontera, with several other parallel K-NN based algorithms over 4 large datasets. Our method is able to achieve state-of-the-art scaling efficiency and accuracy on the large datasets having more than 10 million samples.作者: narcissism 時間: 2025-3-22 05:12
Conference proceedings 2022 2022..The theory of belief functions is now well established as a general framework for reasoning with uncertainty, and has well-understood connections to other frameworks such as probability, possibility, and imprecise probability theories. It has been applied in diverse areas such as machine lear作者: engrossed 時間: 2025-3-22 08:58 作者: 聚集 時間: 2025-3-22 14:24
An Evidential Neural Network Model for?Regression Based on?Random Fuzzy Numbersat can be summarized by three numbers characterizing the most plausible predicted value, variability around this value, and epistemic uncertainty. Experiments with real datasets demonstrate the very good performance of the method as compared to state-of-the-art evidential and statistical learning algorithms.作者: 售穴 時間: 2025-3-22 20:50 作者: 自負的人 時間: 2025-3-22 23:45 作者: Gastric 時間: 2025-3-23 02:56
0302-9743 ubmissions. The papers cover a wide range on theoretical aspects on mathematical foundations, statistical inference as well as on applications in various areas including classification, clustering, data fusion, image processing, and much more..978-3-031-17800-9978-3-031-17801-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: nugatory 時間: 2025-3-23 07:50 作者: 柳樹；枯黃 時間: 2025-3-23 11:41 作者: musicologist 時間: 2025-3-23 15:05 作者: sultry 時間: 2025-3-23 21:51
https://doi.org/10.1007/978-94-011-6790-1rget recognition. In the training process, the weight of each image is automatically optimized in the networks. Finally, the performance of the proposed HIFTR has been evaluated by comparing with other related methods, and the experimental results show that the HIFTR method can efficiently improve the classification accuracy.作者: 親屬 時間: 2025-3-23 22:31 作者: Infirm 時間: 2025-3-24 03:02
Ordinal Classification Using Single-Model Evidential Extreme Learning Machinenty in training labels, the proposed evidential ordinal method can be reduced to the traditional ordinal one. Experiments on artificial and UCI datasets illustrate the practical implementation and effectiveness of proposed evidential extreme learning machine for ordinal classification.作者: 無可非議 時間: 2025-3-24 09:48 作者: 哄騙 時間: 2025-3-24 10:52 作者: 傳授知識 時間: 2025-3-24 17:04 作者: Addictive 時間: 2025-3-24 20:22
Themenmotivation und Gang der Untersuchung, since it can mine the ambiguity and uncertainty of the data structure; secondly, through a competitive strategy, it can automatically gain the number of clusters under the rule of intra-class compactness and inter-class dispersion. Results demonstrate the effectiveness of the proposed method on synthetic and real-world datasets.作者: 節(jié)約 時間: 2025-3-24 23:12 作者: 的是兄弟 時間: 2025-3-25 07:08
Industrialismus und ?koromantiknce. We show that in the particular case where the focal sets of the belief function are Cartesian products of intervals, finding best, ., non-dominated, paths according to these criteria amounts to solving known variants of the deterministic shortest path problem, for which exact resolution algorithms exist.作者: braggadocio 時間: 2025-3-25 09:20
Evidential Clustering by?Competitive Agglomeration since it can mine the ambiguity and uncertainty of the data structure; secondly, through a competitive strategy, it can automatically gain the number of clusters under the rule of intra-class compactness and inter-class dispersion. Results demonstrate the effectiveness of the proposed method on synthetic and real-world datasets.作者: cutlery 時間: 2025-3-25 15:00
Belief Functions on?Ordered Frames of?Discernmentisjunctive combination. We also study distances on ordered elements and their use. In particular, from a membership function, we redefine the cardinality of the intersection of ordered elements, considering them fuzzy.作者: 極端的正確性 時間: 2025-3-25 18:32 作者: 從屬 時間: 2025-3-25 20:22
A Variational Bayesian Clustering Approach to?Acoustic Emission Interpretation Including Soft Labelsused in non-destructive testing. This model, called VBGMM (variational Bayesian GMM) allows the end-user to automatically determine the number of clusters which makes it relevant for this type of application where clusters are related to damages. In this work, we modify the training procedure to inc作者: FACT 時間: 2025-3-26 03:34 作者: paleolithic 時間: 2025-3-26 05:39 作者: 慷慨不好 時間: 2025-3-26 11:12 作者: 發(fā)炎 時間: 2025-3-26 12:44
Ordinal Classification Using Single-Model Evidential Extreme Learning Machine theory, in this paper, the single-model multi-output extreme learning machine is learned from evidential training data. Taking both the uncertainty and the ordering relation of labels into consideration, given mass functions of training labels, different evidential encoding schemes for model output作者: Madrigal 時間: 2025-3-26 20:19
Reliability-Based Imbalanced Data Classification with?Dempster-Shafer Theorythe minority class. This paper proposes a reliability-based imbalanced data classification approach (RIC) with Dempster-Shafer theory to address this issue. First, based on the minority class, multiple under-sampling for the majority one are implemented to obtain the corresponding balanced training 作者: jarring 時間: 2025-3-26 21:58
Evidential Regression by?Synthesizing Feature Selection and?Parameters Learning these two functions, an evaluation function for the significance of the features to be selected is proposed, which contains two terms, one for evaluating the impact of the feature to be selected on the prediction accuracy and one for evaluating the redundancy between it and the already selected fea作者: ADORE 時間: 2025-3-27 04:46 作者: 外科醫(yī)生 時間: 2025-3-27 07:10
Belief Functions on?Ordered Frames of?Discernment discernment consisting of ordered elements on belief functions. This leads us to redefine the power space and the union of ordered elements for the disjunctive combination. We also study distances on ordered elements and their use. In particular, from a membership function, we redefine the cardinal作者: 翻布尋找 時間: 2025-3-27 12:59 作者: 光明正大 時間: 2025-3-27 17:08
Heterogeneous Image Fusion for?Target Recognition Based on?Evidence Reasoning to improve the classification performance. In this paper, we propose a new end-to-end framework for heterogeneous (i.e. visible & infrared) image fusion target recognition (HIFTR). Firstly, two networks are built for the visible and infrared images respectively and jointly trained based on mutual l作者: HOWL 時間: 2025-3-27 21:23 作者: 揮舞 時間: 2025-3-27 22:03 作者: 騷動 時間: 2025-3-28 03:00
A Distributional Approach for?Soft Clustering Comparison and?Evaluation作者: CHOKE 時間: 2025-3-28 08:50 作者: 誘拐 時間: 2025-3-28 11:16
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/183302.jpg作者: Mettle 時間: 2025-3-28 15:00 作者: habile 時間: 2025-3-28 20:51
https://doi.org/10.1007/978-3-663-02582-5In this paper, we present a measure of Information Content (IC) of Basic Belief Assignments (BBAs), and we show how it can be easily calculated. This new IC measure is interpreted as the dual of the effective measure of uncertainty (i.e. generalized entropy) of BBAs developed recently.作者: 飛鏢 時間: 2025-3-29 00:55 作者: 一大塊 時間: 2025-3-29 06:42 作者: hieroglyphic 時間: 2025-3-29 11:02
https://doi.org/10.1007/978-3-031-17801-6Computer Science; Informatics; Conference Proceedings; Research; Applications作者: frenzy 時間: 2025-3-29 11:24 作者: 有角 時間: 2025-3-29 15:35 作者: fructose 時間: 2025-3-29 20:42 作者: 書法 時間: 2025-3-30 03:25
Themenmotivation und Gang der Untersuchung,o a competitive strategy. It has two-fold advantages: Firstly, with the help of the credal partition, it has a good ability to deal with noise objects since it can mine the ambiguity and uncertainty of the data structure; secondly, through a competitive strategy, it can automatically gain the number作者: fleeting 時間: 2025-3-30 05:41
https://doi.org/10.1007/978-3-8350-9088-0ing where users have partial knowledge and may answer with uncertainty or imprecision. This paper offers a way to deal with uncertain and imprecise labeled data using Dempster-Shafer theory and active learning. An evidential version of .-NN that classifies a new example by observing its neighbors wa作者: 稱贊 時間: 2025-3-30 08:19 作者: Fulminate 時間: 2025-3-30 12:42 作者: Cryptic 時間: 2025-3-30 18:54
