Focused Belief Measures for Uncertainty Quantification in High Performance Semantic Analysis

In web-scale semantic data analytics there is a great need for methods which aggregate uncertainty claims, on the one hand respecting the information provided as accurately as possible, while on the other still being tractable. Traditional statistical methods are more robust, but only represent distributional, additive uncertainty. Generalized information theory methods, including fuzzy systems and Dempster-Shafer (DS) evidence theory, represent multiple forms of uncertainty, but are computationally and methodologically difficult. We require methods which provide an effective balance between the complete representation of the full complexity of uncertainty claims in their interaction, while satisfying the needs of both computational complexity and human cognition. Here we build on J{\o}sang's subjective logic to posit methods in focused belief measures (FBMs), where a full DS structure is focused to a single event. The resulting ternary logical structure is posited to be able to capture the minimal amount of generalized complexity needed at a maximum of computational efficiency. We demonstrate the efficacy of this approach in a web ingest experiment over the 2012 Billion Triple dataset from the Semantic Web Challenge.

[1]  M Cliff Joslyn and Jane Booker,et al.  Generalized Information Theory for Engineering Modeling and Simulation , 2004 .

[2]  Osamu Yoshie,et al.  Web Knowledge Management and Decision Support , 2003, Lecture Notes in Computer Science.

[3]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[4]  Jeff Z. Pan,et al.  Resource Description Framework , 2020, Definitions.

[5]  Michel Grabisch,et al.  Belief functions on lattices , 2008, Int. J. Intell. Syst..

[6]  Jeremy J. Carroll,et al.  Resource description framework (rdf) concepts and abstract syntax , 2003 .

[7]  Peter Walley,et al.  Towards a unified theory of imprecise probability , 2000, Int. J. Approx. Reason..

[8]  James A. Hendler,et al.  Scalable reduction of large datasets to interesting subsets , 2010, J. Web Semant..

[9]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[10]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[11]  Matthew Richardson,et al.  Markov Logic , 2008, Probabilistic Inductive Logic Programming.

[12]  Audun Jøsang,et al.  A Logic for Uncertain Probabilities , 2001, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[13]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[14]  Jesse Weaver,et al.  Facebook Linked Data via the Graph API , 2013, Semantic Web.

[15]  Lawrence Hunter,et al.  An Ontological Representation of Biomedical Data Sources and Records , 2011 .

[16]  Pedro M. Domingos,et al.  Markov Logic: An Interface Layer for Artificial Intelligence , 2009, Markov Logic: An Interface Layer for Artificial Intelligence.

[17]  Jeff Z. Pan,et al.  SAOR: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples , 2010, SEMWEB.

[18]  James A. Hendler,et al.  TWC data-gov corpus: incrementally generating linked government data from data.gov , 2010, WWW '10.

[19]  Donald Nute,et al.  Defeasible Logic , 1994, INAP.

[20]  John Feo,et al.  High Performance Descriptive Semantic Analysis of Semantic Graph Databases , 2011 .