國立虎尾科技大學 |

Scalable Uncertainty Management = 13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Scalable Uncertainty Management/ edited by Nahla Ben Amor, Benjamin Quost, Martin Theobald.
其他題名:	13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings /
其他作者:	Ben Amor, Nahla.
面頁冊數:	XI, 452 p. 220 illus., 57 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Artificial intelligence. -
電子資源:	https://doi.org/10.1007/978-3-030-35514-2
ISBN:	9783030355142

Scalable Uncertainty Management = 13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings /
Scalable Uncertainty Management13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings /[electronic resource] :edited by Nahla Ben Amor, Benjamin Quost, Martin Theobald. - 1st ed. 2019. - XI, 452 p. 220 illus., 57 illus. in color.online resource. - Lecture Notes in Artificial Intelligence ;11940. - Lecture Notes in Artificial Intelligence ;9285.

An Experimental Study on the Behaviour of Inconsistency Measures -- Inconsistency Measurement Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study -- The Hidden Elegance of Causal Interaction Models -- Computational Models for Cumulative Prospect Theory: Application to the Knapsack Problem Under Risk -- On a new evidential C-Means algorithm with instance-level constraints -- Hybrid Reasoning on a Bipolar Argumentation Framework -- Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra -- Selecting Relevant Association Rules From Imperfect Data -- Evidential classification of incomplete data via imprecise relabelling: Application to plastic sorting -- An analogical interpolation method for enlarging a training dataset -- Towards a reconciliation between reasoning and learning - A position paper -- CP-nets, π-pref nets, and Pareto dominance -- Measuring Inconsistency through Subformula Forgetting Explaining Hierarchical Multi-Linear Models -- Assertional Removed Sets Merging of DL-Lite Knowledge Bases -- An Interactive Polyhedral Approach for Multi-Objective Combinatorial Optimization with Incomplete Preference Information -- Open-Mindedness of Gradual Argumentation Semantics -- Approximate Querying on Property Graphs -- Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants -- On cautiousness and expressiveness in interval-valued logic -- Preference Elicitation with Uncertainty: Extending Regret Based Methods with Belief Functions -- Evidence Propagation and Consensus Formation in Noisy Environments -- Order-Independent Structure Learning of Multivariate Regression Chain Graphs -- l Comparison of analogy-based methods for predicting preferences -- Using Convolutional Neural Network in Cross-Domain Argumentation Mining Framework -- ConvNet and Dempster-Shafer Theory for Object Recognition -- On learning evidential contextual corrections from soft labels using a measure of discrepancy between contour functions -- Efficient Mo ̈bius Transformations and their applications to D-S Theory -- From shallow to deep interactions between knowledge representation, reasoning and machine learning -- Dealing with Continuous Variables in Graphical Models -- Towards Scalable and Robust Sum-Product Networks -- Learning Models over Relational Data:A Brief Tutorial -- Subspace Clustering and Some Soft Variants -- Algebraic Approximations for Weighted Model Counting.

This book constitutes the refereed proceedings of the 13th International Conference on Scalable Uncertainty Management, SUM 2019, which was held in Compiègne, France, in December 2019. The 25 full, 4 short, 4 tutorial, 2 invited keynote papers presented in this volume were carefully reviewed and selected from 44 submissions. The conference is dedicated to the management of large amounts of complex, uncertain, incomplete, or inconsistent information. New approaches have been developed on imprecise probabilities, fuzzy set theory, rough set theory, ordinal uncertainty representations, or even purely qualitative models.

ISBN: 9783030355142

Standard No.: 10.1007/978-3-030-35514-2doiSubjects--Topical Terms:

559380
Artificial intelligence.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

Scalable Uncertainty Management = 13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings /
LDR:04629nam a22004095i 4500 001 1015002
003 DE-He213
005 20200701025724.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030355142 $9 978-3-030-35514-2
024 7 $a 10.1007/978-3-030-35514-2 $2 doi
035 $a 978-3-030-35514-2
050 4 $a Q334-342
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
245 1 0 $a Scalable Uncertainty Management $h [electronic resource] : $b 13th International Conference, SUM 2019, Compiègne, France, December 16–18, 2019, Proceedings / $c edited by Nahla Ben Amor, Benjamin Quost, Martin Theobald.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XI, 452 p. 220 illus., 57 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Artificial Intelligence ; $v 11940
505 0 $a An Experimental Study on the Behaviour of Inconsistency Measures -- Inconsistency Measurement Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study -- The Hidden Elegance of Causal Interaction Models -- Computational Models for Cumulative Prospect Theory: Application to the Knapsack Problem Under Risk -- On a new evidential C-Means algorithm with instance-level constraints -- Hybrid Reasoning on a Bipolar Argumentation Framework -- Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra -- Selecting Relevant Association Rules From Imperfect Data -- Evidential classification of incomplete data via imprecise relabelling: Application to plastic sorting -- An analogical interpolation method for enlarging a training dataset -- Towards a reconciliation between reasoning and learning - A position paper -- CP-nets, π-pref nets, and Pareto dominance -- Measuring Inconsistency through Subformula Forgetting Explaining Hierarchical Multi-Linear Models -- Assertional Removed Sets Merging of DL-Lite Knowledge Bases -- An Interactive Polyhedral Approach for Multi-Objective Combinatorial Optimization with Incomplete Preference Information -- Open-Mindedness of Gradual Argumentation Semantics -- Approximate Querying on Property Graphs -- Learning from Imprecise Data: Adjustments of Optimistic and Pessimistic Variants -- On cautiousness and expressiveness in interval-valued logic -- Preference Elicitation with Uncertainty: Extending Regret Based Methods with Belief Functions -- Evidence Propagation and Consensus Formation in Noisy Environments -- Order-Independent Structure Learning of Multivariate Regression Chain Graphs -- l Comparison of analogy-based methods for predicting preferences -- Using Convolutional Neural Network in Cross-Domain Argumentation Mining Framework -- ConvNet and Dempster-Shafer Theory for Object Recognition -- On learning evidential contextual corrections from soft labels using a measure of discrepancy between contour functions -- Efficient Mo ̈bius Transformations and their applications to D-S Theory -- From shallow to deep interactions between knowledge representation, reasoning and machine learning -- Dealing with Continuous Variables in Graphical Models -- Towards Scalable and Robust Sum-Product Networks -- Learning Models over Relational Data:A Brief Tutorial -- Subspace Clustering and Some Soft Variants -- Algebraic Approximations for Weighted Model Counting.
520 $a This book constitutes the refereed proceedings of the 13th International Conference on Scalable Uncertainty Management, SUM 2019, which was held in Compiègne, France, in December 2019. The 25 full, 4 short, 4 tutorial, 2 invited keynote papers presented in this volume were carefully reviewed and selected from 44 submissions. The conference is dedicated to the management of large amounts of complex, uncertain, incomplete, or inconsistent information. New approaches have been developed on imprecise probabilities, fuzzy set theory, rough set theory, ordinal uncertainty representations, or even purely qualitative models.
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer logic. $3 786340
650 0 $a Mathematical statistics. $3 527941
650 1 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Probability and Statistics in Computer Science. $3 669886
700 1 $a Ben Amor, Nahla. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1309138
700 1 $a Quost, Benjamin. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1309139
700 1 $a Theobald, Martin. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1279468
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030355135
776 0 8 $i Printed edition: $z 9783030355159
830 0 $a Lecture Notes in Artificial Intelligence ; $v 9285 $3 1253845
856 4 0 $u https://doi.org/10.1007/978-3-030-35514-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)