KI-Beratung Beta

  • Produktbild: The Semantic Web – ISWC 2019
  • Produktbild: The Semantic Web – ISWC 2019
Band 11778

The Semantic Web – ISWC 2019 18th International Semantic Web Conference, Auckland, New Zealand, October 26–30, 2019, Proceedings, Part I

52,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

22.09.2019

Abbildungen

XLIV, 754 p. 601 illus., 96 illus. in color.

Herausgeber

Chiara Ghidini + weitere

Verlag

Springer

Seitenzahl

754

Maße (L/B/H)

23,5/15,5/4,3 cm

Gewicht

1188 g

Auflage

19001 Auflage 1st edition 2019

Sprache

Englisch

ISBN

978-3-030-30792-9

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

22.09.2019

Abbildungen

XLIV, 754 p. 601 illus., 96 illus. in color.

Herausgeber

Verlag

Springer

Seitenzahl

754

Maße (L/B/H)

23,5/15,5/4,3 cm

Gewicht

1188 g

Auflage

19001 Auflage 1st edition 2019

Sprache

Englisch

ISBN

978-3-030-30792-9

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: The Semantic Web – ISWC 2019
  • Produktbild: The Semantic Web – ISWC 2019

  • Research Track.-
    Decentralized Indexing over a Network of RDF Peers.- Datalog Materialisation in Distributed RDF Stores with Dynamic Data Exchange.- How to make latent factors interpretable by feeding Factorization machines with knowledge graphs.- Observing LOD using Equivalent Set Graphs: it is mostly flat and sparsely linked.- Optimizing Horn-SHIQ Reasoning for OBDA.- Using a KG-Copy Network for Non-Goal Oriented Dialogues.- Canonicalizing Knowledge Base Literals.- Bag Semantics of DL-Lite with Functionality Axioms.- Validating SHACL constraints over a SPARQL endpoint.- Mapping Factoid Adjective Constraints to Existential Restrictions over Knowledge Bases.- Mining Significant Maximum Cardinalities in Knowledge Bases.- HapPenIng: Happen, Predict, Infer - Event Series Completion in a Knowledge Graph.- Uncovering the Semantics of Wikipedia Categories.- Qsearch: Answering Quantity Queries from Text.- A Worst-Case Optimal Join Algorithm for SPARQL.- Knowledge Graph Consolidationby Unifying Synonymous Relationships.- Skyline Queries over Knowledge Graphs.- Detecting Influences of Ontology Design Patterns in Biomedical Ontologies.- Popularity-driven Ontology Ranking using Qualitative Features.- Incorporating Literals into Knowledge Graph Embeddings.- Extracting Novel Facts from Tables for Knowledge Graph Completion.- Difficulty-controllable Multi-hop Question Generation From Knowledge Graphs.- Type Checking Program Code using SHACL.- Decentralized Reasoning on a Network of Aligned Ontologies with Link Keys.- Ontology Completion Using Graph Convolutional Networks.- Non-Parametric Class Completeness Estimators for Collaborative Knowledge Graphs - The Case of Wikidata.- Pretrained Transformers for Simple Question Answering over Knowledge Graphs.- Learning to Rank Query Graphs for Complex Question Answering over Knowledge Graphs.- THOTH: Neural Translation and Enrichment of Knowledge Graphs.- Entity Enabled Relation Linking.- SHACL Constraints with Inference Rules.- Query-Based Entity Comparison in Knowledge Graphs Revisited.- Anytime Large-Scale Analytics of Linked Open Data.- Absorption-Based Query Answering for Expressive Description Logics.- TransEdge: Translating Relation-contextualized Embeddings for Knowledge Graphs.- Unsupervised Discovery of Corroborative Paths for Fact Validation.- RDF Explorer: A Visual SPARQL Query Builder.- Capturing Semantic and Syntactic Information for Link Prediction in Knowledge Graphs.- A Framework for Evaluating Snippet Generation for Dataset Search.- Summarizing News Articles using Question-and-Answer Pairs via Learning.- Product Classification Using Microdata Annotations.- Truthful Mechanisms for Multi Agent Self-Interested Correspondence Selection.