Corpus ID: 6311628

Graph Summarization in Annotated Data Using Probabilistic Soft Logic

  title={Graph Summarization in Annotated Data Using Probabilistic Soft Logic},
  author={Alex Memory and A. Kimmig and Stephen H. Bach and L. Raschid and L. Getoor},
  • Alex Memory, A. Kimmig, +2 authors L. Getoor
  • Published in URSW 2012
  • Computer Science
  • Annotation graphs, made available through the Linked Data initiative and Semantic Web, have significant scientific value. However, their increasing complexity makes it difficult to fully exploit this value. Graph summaries, which group similar entities and relations for a more abstract view on the data, can help alleviate this problem, but new methods for graph summarization are needed that handle uncertainty present within and across these sources. Here, we propose the use of probabilistic… CONTINUE READING
    20 Citations
    Knowledge Graph Identification
    • 182
    • PDF
    Analyzing Linked Data Quality with LiQuate
    • 23
    On Selecting a Conjunction Operation in Probabilistic Soft Logic
    • Highly Influenced
    • PDF
    Collective subjective logic: Scalable uncertainty-based opinion inference
    • 10
    CSL+: Scalable Collective Subjective Logic under Multidimensional Uncertainty
    • PDF
    Uncertainty-Based Opinion Inference on Network Data Using Graph Convolutional Neural Networks
    • PDF


    Link Prediction for Annotation Graphs Using Graph Summarization
    • 46
    • PDF
    Discovery-driven graph summarization
    • 124
    • PDF
    Efficient aggregation for graph summarization
    • 432
    • PDF
    Graph summarization with bounded error
    • 299
    • PDF
    Probabilistic Similarity Logic
    • 174
    • PDF
    Markov logic networks
    • 2,595
    • PDF
    A probabilistic framework for relational clustering
    • 126
    • PDF
    PR-OWL: A Framework for Probabilistic Ontologies
    • 155
    • PDF