Towards Exploiting Implicit Human Feedback for Improving RDF2vec Embeddings

• URL: http://arxiv.org/abs/2004.04423v1
• Date: Thu, 9 Apr 2020 08:39:19 GMT
• Title: Towards Exploiting Implicit Human Feedback for Improving RDF2vec Embeddings
• Authors: Ahmad Al Taweel and Heiko Paulheim
• Abstract summary: RDF2vec is a technique for creating vector space embeddings from an RDF knowledge graph. In this paper, we explore the use of external edge weights for guiding the random walks.
• Score: 2.3605348648054463
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: RDF2vec is a technique for creating vector space embeddings from an RDF knowledge graph, i.e., representing each entity in the graph as a vector. It first creates sequences of nodes by performing random walks on the graph. In a second step, those sequences are processed by the word2vec algorithm for creating the actual embeddings. In this paper, we explore the use of external edge weights for guiding the random walks. As edge weights, transition probabilities between pages in Wikipedia are used as a proxy for the human feedback for the importance of an edge. We show that in some scenarios, RDF2vec utilizing those transition probabilities can outperform both RDF2vec based on random walks as well as the usage of graph internal edge weights.

Related papers

• Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics [59.07903030446756]
  Graph neural networks are highly vulnerable to distribution shifts on graphs.<n>We present Gadget, the first framework for non-IID graph data.<n> Gadget can be seamlessly integrated with existing graph DA methods to handle large shifts on graphs.
  arXiv  Detail & Related papers  (2025-05-19T05:03:58Z)
• DPGAN: A Dual-Path Generative Adversarial Network for Missing Data Imputation in Graphs [17.847551850315895]
  This paper proposes a novel framework, called Dual-Pathrative Adversarial Network (DPGAN) DPGAN can deal simultaneously with missing data and avoid over-smoothing problems. Comprehensive experiments across various benchmark datasets substantiate that DPGAN consistently rivals, if not outperforms, existing state-of-the-art imputation algorithms.
  arXiv  Detail & Related papers  (2024-04-26T05:26:10Z)
• RD-VIO: Robust Visual-Inertial Odometry for Mobile Augmented Reality in Dynamic Environments [55.864869961717424]
  It is typically challenging for visual or visual-inertial odometry systems to handle the problems of dynamic scenes and pure rotation. We design a novel visual-inertial odometry (VIO) system called RD-VIO to handle both of these problems.
  arXiv  Detail & Related papers  (2023-10-23T16:30:39Z)
• Node Embedding for Homophilous Graphs with ARGEW: Augmentation of Random walks by Graph Edge Weights [2.2935273605606494]
  ARGEW is a novel augmentation method for random walks that expands the corpus in such a way that nodes with larger edge weights end up with closer embeddings. With several real-world networks, we demonstrate that with ARGEW, compared to not using it, the desired pattern that node pairs with larger edge weights have closer embeddings is much clearer.
  arXiv  Detail & Related papers  (2023-08-11T06:19:23Z)
• Collaborative likelihood-ratio estimation over graphs [55.98760097296213]
  Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We develop this idea in a concrete non-parametric method that we call Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We derive convergence rates for our collaborative approach that highlights the role played by variables such as the number of available observations per node, the size of the graph, and how accurately the graph structure encodes the similarity between tasks.
  arXiv  Detail & Related papers  (2022-05-28T15:37:03Z)
• Walk this Way! Entity Walks and Property Walks for RDF2vec [2.3605348648054463]
  RDF2vec is a knowledge graph embedding mechanism. We introduce two new flavors of walk extraction coined e-walks and p-walks. We conduct a preliminary evaluation with a total of 12 RDF2vec variants.
  arXiv  Detail & Related papers  (2022-04-05T14:51:34Z)
• Skip Vectors for RDF Data: Extraction Based on the Complexity of Feature Patterns [0.0]
  The Resource Description Framework (RDF) is a framework for describing metadata, such as attributes and relationships of resources on the Web. We propose a novel feature vector (called a Skip vector) that represents some features of each resource in an RDF graph by extracting various combinations of neighboring edges and nodes. The classification tasks can be performed by applying the low-dimensional Skip vector of each resource to conventional machine learning algorithms, such as SVMs, the k-nearest neighbors method, neural networks, random forests, and AdaBoost.
  arXiv  Detail & Related papers  (2022-01-06T10:07:49Z)
• Putting RDF2vec in Order [1.52292571922932]
  We argue that this might be a shortcoming when training RDF2vec. We show that using a word2vec variant which respects order yields considerable performance gains.
  arXiv  Detail & Related papers  (2021-08-11T15:27:55Z)
• NP-DRAW: A Non-Parametric Structured Latent Variable Modelfor Image Generation [139.8037697822064]
  We present a non-parametric structured latent variable model for image generation, called NP-DRAW. It sequentially draws on a latent canvas in a part-by-part fashion and then decodes the image from the canvas.
  arXiv  Detail & Related papers  (2021-06-25T05:17:55Z)
• Sketch-Based Anomaly Detection in Streaming Graphs [89.52200264469364]
  Given a stream of graph edges from a dynamic graph, how can we assign anomaly scores to edges and subgraphs in an online manner? Our method is the first streaming approach that incorporates dense subgraph search to detect graph anomalies in constant memory and time.
  arXiv  Detail & Related papers  (2021-06-08T16:10:36Z)
• Cloud2Curve: Generation and Vectorization of Parametric Sketches [109.02932608241227]
  We present Cloud2Curve, a generative model for scalable high-resolution vector sketches. We evaluate the generation and vectorization capabilities of our model on Quick, Draw! and KMNIST datasets.
  arXiv  Detail & Related papers  (2021-03-29T12:09:42Z)
• Uncertainty Inspired RGB-D Saliency Detection [70.50583438784571]
  We propose the first framework to employ uncertainty for RGB-D saliency detection by learning from the data labeling process. Inspired by the saliency data labeling process, we propose a generative architecture to achieve probabilistic RGB-D saliency detection. Results on six challenging RGB-D benchmark datasets show our approach's superior performance in learning the distribution of saliency maps.
  arXiv  Detail & Related papers  (2020-09-07T13:01:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.