Walk this Way! Entity Walks and Property Walks for RDF2vec

• URL: http://arxiv.org/abs/2204.02777v1
• Date: Tue, 5 Apr 2022 14:51:34 GMT
• Title: Walk this Way! Entity Walks and Property Walks for RDF2vec
• Authors: Jan Portisch, Heiko Paulheim
• Abstract summary: 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.
• Score: 2.3605348648054463
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: RDF2vec is a knowledge graph embedding mechanism which first extracts sequences from knowledge graphs by performing random walks, then feeds those into the word embedding algorithm word2vec for computing vector representations for entities. In this poster, we introduce two new flavors of walk extraction coined e-walks and p-walks, which put an emphasis on the structure or the neighborhood of an entity respectively, and thereby allow for creating embeddings which focus on similarity or relatedness. By combining the walk strategies with order-aware and classic RDF2vec, as well as CBOW and skip-gram word2vec embeddings, we conduct a preliminary evaluation with a total of 12 RDF2vec variants.

Related papers

• Node Embeddings via Neighbor Embeddings [11.841966603069865]
  We introduce graph t-SNE and graph CNE, a contrastive neighbor embedding method that produces high-dimensional node representations. We show that both graph t-SNE and graph CNE strongly outperform state-of-the-art algorithms in terms of local structure preservation.
  arXiv  Detail & Related papers  (2025-03-31T08:16:03Z)
• LEAF: Unveiling Two Sides of the Same Coin in Semi-supervised Facial Expression Recognition [56.22672276092373]
  Semi-supervised learning has emerged as a promising approach to tackle the challenge of label scarcity in facial expression recognition. We propose a unified framework termed hierarchicaL dEcoupling And Fusing to coordinate expression-relevant representations and pseudo-labels. We show that LEAF outperforms state-of-the-art semi-supervised FER methods, effectively leveraging both labeled and unlabeled data.
  arXiv  Detail & Related papers  (2024-04-23T13:43:33Z)
• Structured Dialogue Discourse Parsing [79.37200787463917]
  discourse parsing aims to uncover the internal structure of a multi-participant conversation. We propose a principled method that improves upon previous work from two perspectives: encoding and decoding. Experiments show that our method achieves new state-of-the-art, surpassing the previous model by 2.3 on STAC and 1.5 on Molweni.
  arXiv  Detail & Related papers  (2023-06-26T22:51:01Z)
• Unified Mask Embedding and Correspondence Learning for Self-Supervised Video Segmentation [76.40565872257709]
  We develop a unified framework which simultaneously models cross-frame dense correspondence for locally discriminative feature learning. It is able to directly learn to perform mask-guided sequential segmentation from unlabeled videos. Our algorithm sets state-of-the-arts on two standard benchmarks (i.e., DAVIS17 and YouTube-VOS)
  arXiv  Detail & Related papers  (2023-03-17T16:23:36Z)
• Correspondence Matters for Video Referring Expression Comprehension [64.60046797561455]
  Video Referring Expression (REC) aims to localize the referent objects described in the sentence to visual regions in the video frames. Existing methods suffer from two problems: 1) inconsistent localization results across video frames; 2) confusion between the referent and contextual objects. We propose a novel Dual Correspondence Network (dubbed as DCNet) which explicitly enhances the dense associations in both the inter-frame and cross-modal manners.
  arXiv  Detail & Related papers  (2022-07-21T10:31:39Z)
• 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)
• Semi-Supervised Semantic Segmentation with Cross Pseudo Supervision [56.950950382415925]
  We propose a novel consistency regularization approach, called cross pseudo supervision (CPS) The CPS consistency has two roles: encourage high similarity between the predictions of two perturbed networks for the same input image, and expand training data by using the unlabeled data with pseudo labels. Experiment results show that our approach achieves the state-of-the-art semi-supervised segmentation performance on Cityscapes and PASCAL VOC 2012.
  arXiv  Detail & Related papers  (2021-06-02T15:21:56Z)
• Keyphrase Extraction with Dynamic Graph Convolutional Networks and Diversified Inference [50.768682650658384]
  Keyphrase extraction (KE) aims to summarize a set of phrases that accurately express a concept or a topic covered in a given document. Recent Sequence-to-Sequence (Seq2Seq) based generative framework is widely used in KE task, and it has obtained competitive performance on various benchmarks. In this paper, we propose to adopt the Dynamic Graph Convolutional Networks (DGCN) to solve the above two problems simultaneously.
  arXiv  Detail & Related papers  (2020-10-24T08:11:23Z)
• The R Package stagedtrees for Structural Learning of Stratified Staged Trees [1.9199289015460215]
  stagedtrees is an R package which includes several algorithms for learning the structure of staged trees and chain event graphs from data. The capabilities of stagedtrees are illustrated using mainly two datasets both included in the package or bundled in R.
  arXiv  Detail & Related papers  (2020-04-14T13:02:59Z)
• Towards Exploiting Implicit Human Feedback for Improving RDF2vec Embeddings [2.3605348648054463]
  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.
  arXiv  Detail & Related papers  (2020-04-09T08:39:19Z)
• Vertex-reinforced Random Walk for Network Embedding [42.99597051744645]
  We study the fundamental problem of random walk for network embedding. We introduce an exploitation-exploration mechanism to help the random walk jump out of the stuck set. Experimental results show that our proposed approach reinforce2vec can outperform state-of-the-art random walk based embedding methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-11T15:58:31Z)

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.