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

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 sel...

Full description

Bibliographic Details
Other Authors: Ben Amor, Nahla (Editor), Quost, Benjamin (Editor), Theobald, Martin (Editor)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2019, 2019
Edition:1st ed. 2019
Series:Lecture Notes in Artificial Intelligence
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 04575nmm a2200385 u 4500
001 EB001889047
003 EBX01000000000000001052408
005 00000000000000.0
007 cr|||||||||||||||||||||
008 200117 ||| eng
020 |a 9783030355142 
100 1 |a Ben Amor, Nahla  |e [editor] 
245 0 0 |a Scalable Uncertainty Management  |h Elektronische Ressource  |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 
260 |a Cham  |b Springer International Publishing  |c 2019, 2019 
300 |a XI, 452 p. 220 illus., 57 illus. in color  |b online resource 
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 --  
505 0 |a 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 --  
505 0 |a On learning evidential contextual corrections from soft labels using a measureof 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 
653 |a Mathematical statistics 
653 |a Computer Science Logic and Foundations of Programming 
653 |a Computer science 
653 |a Computer science / Mathematics 
653 |a Probability and Statistics in Computer Science 
653 |a Artificial Intelligence 
653 |a Artificial intelligence 
700 1 |a Quost, Benjamin  |e [editor] 
700 1 |a Theobald, Martin  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Lecture Notes in Artificial Intelligence 
028 5 0 |a 10.1007/978-3-030-35514-2 
856 4 0 |u https://doi.org/10.1007/978-3-030-35514-2?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 006.3 
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