Scalable Uncertainty Management
13th International Conference, SUM 2019, Compiègne, France, December 16¿18, 2019, Proceedings
Herausgegeben:Ben Amor, Nahla; Quost, Benjamin; Theobald, Martin
Scalable Uncertainty Management
13th International Conference, SUM 2019, Compiègne, France, December 16¿18, 2019, Proceedings
Herausgegeben:Ben Amor, Nahla; Quost, Benjamin; Theobald, Martin
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
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.…mehr
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty37,99 €
- Logic Programming and Nonmonotonic Reasoning37,99 €
- Scalable Uncertainty Management37,99 €
- Scalable Uncertainty Management38,99 €
- Logics in Artificial Intelligence66,99 €
- Logic and Argumentation37,99 €
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty88,99 €
-
-
-
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.
- Produktdetails
- Lecture Notes in Computer Science 11940
- Verlag: Springer / Springer International Publishing / Springer, Berlin
- Artikelnr. des Verlages: 978-3-030-35513-5
- 1st ed. 2019
- Seitenzahl: 464
- Erscheinungstermin: 21. November 2019
- Englisch
- Abmessung: 235mm x 155mm x 25mm
- Gewicht: 698g
- ISBN-13: 9783030355135
- ISBN-10: 3030355136
- Artikelnr.: 57921754
- Lecture Notes in Computer Science 11940
- Verlag: Springer / Springer International Publishing / Springer, Berlin
- Artikelnr. des Verlages: 978-3-030-35513-5
- 1st ed. 2019
- Seitenzahl: 464
- Erscheinungstermin: 21. November 2019
- Englisch
- Abmessung: 235mm x 155mm x 25mm
- Gewicht: 698g
- ISBN-13: 9783030355135
- ISBN-10: 3030355136
- Artikelnr.: 57921754
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 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.
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 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.