Scalable Uncertainty Management 7th International Conference, SUM 2013, Washington, DC, USA, September 16-18, 2013, Proceedings
Saved in:
| Main Authors | , , |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Netherlands
Springer Nature
2013
Springer Berlin / Heidelberg |
| Edition | 1 |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783642403811 3642403816 3642403808 9783642403804 |
Cover
Loading…
| Author | Wijsen, Jef Liu, Weiru Subrahmanian, V. S |
|---|---|
| Author_xml | – sequence: 1 fullname: Liu, Weiru – sequence: 2 fullname: Subrahmanian, V. S – sequence: 3 fullname: Wijsen, Jef |
| BookMark | eNpdjslOwzAURY0YRCn9Bio2rCLZeX6JvYSoDFIRC4Zt9DyVQGqXOCz4eyKVFat7r3R0dM_YUUzRH7CFrhVUspQclBCH__YJmylUWnLB5Slb5PzB-dQFVxpn7OLZUk-m98vXaP0wUhfHn-UjRdr4rY_jOTsO1Ge_-Ms5e7tdvTT3xfrp7qG5XhcEONkLpY1y4BCRaqdLKYwUjhsr0ZIDFUwlREWkuAvBORRB1h4wSOROCwwIc3a1F--G9PXt89h6k9KnnT4M1Lermwa4hhL0RF7uSUuZ-i527TbFtBlo955blGLiavgF3qdNoQ |
| ContentType | eBook |
| DBID | I4C |
| DEWEY | 006 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISBN | 9783642403811 3642403816 |
| Edition | 1 |
| Editor | Subrahmanian, V S Wijsen, Jef Liu, Weiru |
| Editor_xml | – sequence: 1 fullname: Liu, Weiru – sequence: 2 fullname: Subrahmanian, V S – sequence: 3 fullname: Wijsen, Jef |
| ExternalDocumentID | EBC3093239 5413097 |
| GroupedDBID | -JY -K2 0D6 0DA 2HV 38. AABBV AARVG AAUBL AAWHR ABBVZ ABFTD ABMLC ABMNI AEDXK AEKFX AETDV AEZAY AFJMS ALMA_UNASSIGNED_HOLDINGS ARZOH AZZ BBABE CZZ I4C IEZ IX0 LDH MA. N2R NUC SAO SBO TPJZQ TSXQS Z5O Z7R Z7S Z7U Z7V Z7W Z7X Z7Y Z7Z Z81 Z82 Z83 Z84 Z85 Z87 Z88 ACPRQ ADHDZ ADNMO AEJLV AFPTF |
| ID | FETCH-LOGICAL-a35589-89b8d3d555a7d9241b41d0bc45cad38fb6116aa80dffdd51f47e35f450d915f53 |
| ISBN | 9783642403811 3642403816 3642403808 9783642403804 |
| IngestDate | Fri May 30 21:55:27 EDT 2025 Tue Nov 14 22:48:21 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a35589-89b8d3d555a7d9241b41d0bc45cad38fb6116aa80dffdd51f47e35f450d915f53 |
| OCLC | 858940104 |
| PQID | EBC3093239 |
| PageCount | 399 |
| ParticipantIDs | proquest_ebookcentral_EBC3093239 casalini_monographs_5413097 |
| PublicationCentury | 2000 |
| PublicationDate | 2013 |
| PublicationDateYYYYMMDD | 2013-01-01 |
| PublicationDate_xml | – year: 2013 text: 2013 |
| PublicationDecade | 2010 |
| PublicationPlace | Netherlands |
| PublicationPlace_xml | – name: Netherlands – name: Berlin, Heidelberg |
| PublicationYear | 2013 |
| Publisher | Springer Nature Springer Berlin / Heidelberg |
| Publisher_xml | – name: Springer Nature – name: Springer Berlin / Heidelberg |
| SSID | ssj0001010895 |
| Score | 1.9638448 |
| SourceID | proquest casalini |
| SourceType | Publisher |
| SubjectTerms | Special computer methods Uncertainty (Information theory)-Congresses |
| Subtitle | 7th International Conference, SUM 2013, Washington, DC, USA, September 16-18, 2013, Proceedings |
| TableOfContents | 3.4 Summary of the Plausibility Conflict -- 4 Pignistic Conflict of Belief Functions -- 4.1 Definitions of Pignistic Conflict -- 4.2 Relation of Pignistic Conflict Bet-C and of Liu's Degree ofConflict cf -- 5 Ideas for a Future Research -- 6 Conclusion -- References -- Bipolar Possibility Theory as a Basis for a Logic of Desires and Beliefs -- 1 Introduction -- 2 Background on Possibility Theory -- 3 Possibility Theory as Basis for a Logical Theory of Desires -- 3.1 Modeling Desire Using Δ Function -- 3.2 Modeling Potential Desire Using \nabla -- 3.3 Some Valid Inference Rules for Desires -- 3.4 Realistic Desires -- 4 Logics of Beliefs and Desires -- 4.1 Minimal Modal Logic of Beliefs and Desires MBDL -- 4.2 Outline of a Minimal Modal Logic of Graded Beliefs and Desires MGBDL -- 4.3 Multi-agentModal Logic of Graded Beliefs and Desires GBDLn -- Conclusive Remarks: Towards Emotions -- References -- Databases -- A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time -- 1 Introduction -- 2 Preliminaries -- 2.1 Classes of Chordal Graphs -- 2.2 Probability Computation Using Probabilistic Graph Models -- 2.3 Hypergraphs and Acyclicity -- 3 Disjoint Branch Acyclic Lineage (DBAL) Expressions -- 4 DBAL Expression Probability Computation -- 4.1 Illustrating Example -- 4.2 Factor Representation and Projection -- 4.3 Algorithm Description -- 5 Conclusions -- References -- The Semantics of Aggregate Queries in Data Exchange Revisited -- 1 Introduction -- 2 Preliminaries -- 3 Aggregate Most-Certain Answers -- 4 Semantics of Aggregate Queries Based on Retractions -- 4.1 Endomorphism-Based Semantics vs. Retraction-Based Semantics -- 5 Concluding Remarks -- References -- PossDB: An Uncertainty Database Management System -- 1 Introduction -- 2 PossDB and Conditional Tables -- 3 Features of PossDB -- 4 Implementation 6 Related Work -- 7 Conclusion -- References -- A Logical Theory about Dynamics in Abstract Argumentation -- 1 Introduction -- 2 Preliminaries -- 3 Belief States -- 4 Restoring Coherence through AF Expansion -- 5 Fallback Belief -- 6 Computing Fallback Beliefs with ASP -- 7 Additional Semantics -- 8 Related Work -- 9 Conclusion and Future Work -- References -- Belief Functions, Possibility Theory and their Applications -- Sound Source Localization from Uncertain Information Using the Evidential EM Algorithm -- 1 Introduction -- 2 Sound Source Localization via the EM Algorithm -- 2.1 Basic Description of the Model -- 2.2 The EM Algorithm -- 2.3 Model Estimation Using the EM Algorithm -- 3 Uncertainty Representation Using Belief Functions -- 3.1 Uncertain Measurements -- 3.2 Belief Functions -- 3.3 Uncertain Data Model Using Belief Functions -- 4 Sound Source Localization from Credal Data -- 4.1 Likelihood Function of a Credal Sample -- 4.2 The Evidential EM Algorithm -- 4.3 Sound Source Localization via the E2M Algorithm -- 5 Experiments -- 5.1 Data Generation -- 5.2 Results -- 6 Conclusions -- References -- An Improvement of Subject Reacquisition by Reasoning and Revision -- 1 Introduction -- 2 Face Recognition -- 3 Reasoning by Time-of-Flight -- 4 Example Scenario -- 5 Revision -- 5.1 Comparison Reasoning -- 5.2 Revision of Reacquisition Results -- 6 Conclusion -- References -- Belief Functions: A Revision of Plausibility Conflict and Pignistic Conflict -- 1 Introduction -- 2 State of the Art -- 2.1 General Primer on Belief Functions -- 2.2 Conflict of Belief Functions -- 3 Revision and Improvement of Plausibility Conflict -- 3.1 A Set of Conflicting Belief Functions with Empty ΩPlC -- 3.2 Four Variants of Correction of Conflicting Sets -- 3.3 Properties of Conflicting Sets ΩsmPlC, ΩspPlC, ΩcpPlC, ΩcbP lC 5 Experimental Results -- References -- Aggregate Count Queries in Probabilistic Spatio-temporal Databases -- 1 Introduction -- 2 SPOT Databases -- 2.1 Syntax -- 2.2 Semantics -- 3 Count Queries in SPOT -- 3.1 Expected Value Semantics -- 3.2 Extreme Values Semantics -- 3.3 Ranking Semantics -- 4 Computing Count Queries -- 4.1 Computing Expected Value Semantics -- 4.2 Computing Extreme Values Semantics -- 4.3 Computing Ranking Semantics -- 5 Related Work -- 6 Conclusion and Topics for Further Research -- References -- Intelligent Data Analytics -- Approximate Reasoning about Generalized Conditional Independence with Complete Random Variables -- 1 Introduction -- 2 Conditional Independence and Uncertainty -- 3 Axiomatization -- 4 Equivalence to Database Decompositions -- 5 Algorithm and Complexity -- 6 Non-extensibility of Findings -- 7 Conclusion and Future Work -- References -- Combinatorial Prediction Markets: An Experimental Study -- 1 Crowdsourcing, Predictions, and Combinatorial Markets -- 2 Scope of the Experiment -- 3 Experimental Design -- 4 Results and Observations -- 5 Conclusion -- References -- A Scalable Learning Algorithm for Kernel Probabilistic Classifier -- 1 Introduction -- 2 Probabilistic Loss Functions -- 3 Surface Probabilistic Kernel Classifier Learning -- 3.1 Definitions -- 3.2 Complexity Evaluation and Reformulation of Losssurf -- 4 Optimization Process -- 4.1 Nelder-Mead Implementation -- 4.2 Particle Swarm Implementation -- 5 Experimentation -- 5.1 Benchmark Dataset -- 5.2 KDD Cup 2012 Dataset -- 6 Conclusion and Future Works -- References -- Logics, Description Logic, and Semantic Web -- Privacy-Preserving Social Network PublicationBased on Positional Indiscernibility -- 1 Introduction -- 2 Social Networks and Positional Analysis -- 3 Description Logics -- 4 Privacy-Preserving Social Network Publishing 4.1 Problem Formulation 1 Introduction and Motivation -- 2 Preliminaries on R-DeLP -- 3 Computing the Set of Outputs for an R-DeLP Program -- 4 Empirical Results -- References -- A Formal Characterization of the Outcomes of Rule-Based Argumentation Systems -- 1 Introduction -- 2 Rule-Based Argumentation Systems -- 3 Postulates for Argumentation Systems -- 4 Outcomes of Argumentation Systems -- 4.1 Naive Semantics -- 4.2 Stable Semantics -- 4.3 Preferred Semantics -- 4.4 Grounded Semantics - Ideal Semantics -- 5 Conclusion -- References -- Meta-level Argumentation with Argument Schemes -- 1 Introduction -- 2 Related Work -- 3 Dung's Framework -- 4 Structured Argumentation -- 5 Bimodal Graphs -- 6 Meta-ASPIC -- 7 Argument Schemes -- 8 Discussion -- References -- Efficiently Estimating the Probability of Extensions in Abstract Argumentation -- 1 Introduction -- 2 Preliminaries -- 2.1 Abstract Argumentation -- 2.2 Probabilistic Abstract Argumentation -- 3 Estimating Extension Probability Using Monte-Carlo Simulation -- 3.1 The State-of-the-Art Approach -- 3.2 Estimating PrsemF (S) by Sampling AAFsWherein S Is Conflict-Free -- 3.3 Estimating PrsemF (S) by Sampling AAFsWherein S Is Admissible -- 4 Experimental Results -- 5 Related Work -- 6 Conclusions -- References -- AFs with Necessities: Further Semantics and Labelling Characterization -- 1 Introduction -- 2 Brief Reminder of Dung AFs -- 3 AFNs and Their Acceptability Semantics -- 3.1 AFNs and AFs -- 4 A Labelling Characterization -- 5 Labeling Algorithms for AFNs -- 5.1 Grounded Semantics -- 5.2 Preferred, Stable and Semi-stable Semantics -- 6 Concluding Remarks and Perspectives -- References -- Ranking-Based Semantics for Argumentation Frameworks -- 1 Introduction -- 2 Ranking-Based Semantics -- 3 Postulates for Semantics -- 4 Relationships between Postulates -- 5 Discussion-Based and Burden-Based Semantics Intro -- Preface -- Organization -- Table of Contents -- Argumentation -- Analysis of Dialogical Argumentation via Finite State Machines -- 1 Introduction -- 2 Propositional Executable Logic -- 3 Generation of Finite State Machines -- 4 Minimax Analysis of Finite State Machines -- 5 Implementation Study -- 6 Discussion -- References -- What Can Argumentation Do for Inconsistent Ontology Query Answering? -- 1 Introduction -- 2 Ontological Conjunctive Query Answering -- 2.1 Query Answering over Inconsistent Ontological Knowledge Bases -- 3 Argumentation over Inconsistent Ontological Knowledge Bases -- 4 Equivalence between Repairs and Extensions -- Semantics Equivalence -- 6 Postulates -- 7 Summary and Conclusion -- References -- Enforcement in Argumentation Is a Kind of Update -- 1 Introduction -- 2 Framework -- 2.1 Abstract Argumentation -- 2.2 Change in Argumentation -- 2.3 Enforcement -- 3 Towards Generalized Enforcement -- 4 Generalized Enforcement Postulates -- 4.1 Background on Belief Change Theory -- 4.2 Postulates Characterizing Enforcement on Graphs with Transition Constraints -- 5 Conclusion -- References -- A Conditional Logic-Based Argumentation Framework -- 1 Introduction -- 2 Conditional Logics -- 3 Conditional Contrariety -- 4 A Conditional-Logic Argumentation Framework -- 4.1 Arguments -- 4.2 Conflicts between Arguments -- 4.3 Argumentation Trees -- 5 Perspectives and Conclusion -- References -- Modelling Uncertainty in Persuasion -- 1 Introduction -- 2 Preliminaries -- 2.1 Abstract Argumentation -- 2.2 Probabilistic Logic -- 2.3 Logical Arguments -- 3 Good Arguments and Good Attacks -- 4 Participants -- 5 Dialogical Argumentation -- 6 Simple Dialogues -- 7 Bestfirst Dialogues -- 8 Insincere Dialogues -- 9 Discussion -- References -- On the Implementation of a Multiple Output Algorithm for Defeasible Argumentation |
| Title | Scalable Uncertainty Management |
| URI | http://digital.casalini.it/9783642403811 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3093239 |
| Volume | 8078 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTwIxEG4ELnpRUSPiYw_ezBJ22267RyUYQ9ATIDfSZ8QDJjwu_nqn-6AoJEazSbPbbLrZmUlnOu33DUK3nCmeMBGHQjEVklSKUGAlQ8fmBPG5iDVz4OTnl-RpSHpjOvZVsjJ0yVK21OdOXMl_tAp9oFeHkv2DZteDQgfcg36hBQ1D-yP4XT8W-A2QbIZ5GoLOsj19iKW3T7L0p6vsDJ2Zzld-9wfWx2-O9SJPfY5aPvv5On0vEjI9YzfzAa42w7d8QJkPvCvoshz5-S7KrAy-QRwbH8_r_5bToSOg985hfWSv-9Bxm6YxTiuowhivotp9t9cf-YQWXDylDj9TjstzhiP_Hef8xUI4zOeW78sc-uAI1YxDeRyjPTOro8OytkVQTHV1dLBB1HiCbkqBBxsCD7zAT9HosTvoPIVFaQmwREp5GvJUco01pVQwDWvQSJJIt6UiVAmNuZVJFCVC8La2VmsaWcIMppbQtk4jaik-Q9XZx8yco0AqWLUKbCNYjBJhDDfa6DjRXMRg6ThuoGb50xMwwJyJfDGhLnxIWQMFpRwm2f54cSh34gV-8fsrTbTvbeESVZfzlbmCaGkprws9fQFtqxTa |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Scalable+Uncertainty+Management&rft.au=Liu%2C+Weiru&rft.au=Subrahmanian%2C+V.+S&rft.au=Wijsen%2C+Jef&rft.date=2013-01-01&rft.pub=Springer+Berlin+%2F+Heidelberg&rft.isbn=9783642403804&rft.volume=8078&rft.externalDocID=EBC3093239 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783642403811/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783642403811/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783642403811/sc.gif&client=summon&freeimage=true |