SynsetRank: Degree-adjusted Random Walk for Relation Identification
In relation extraction, a key process is to obtain good detectors that find relevant sentences describing the target relation. To minimize the necessity of labeled data for refining detectors, previous work successfully made use of BabelNet, a semantic graph structure expressing relationships between synsets, as side information or prior knowledge. The goal of this paper is to enhance the use of graph structure in the framework of random walk with a few adjustable parameters. Actually, a straightforward application of random walk degrades the performance even after parameter optimization. With the insight from this unsuccessful trial, we propose SynsetRank, which adjusts the initial probability so that high degree nodes influence the neighbors as strong as low degree nodes. In our experiment on 13 relations in the FB15K-237 dataset, SynsetRank significantly outperforms baselines and the plain random walk approach.
Code (0)
등록된 구현이 없습니다.
Tasks
RelationRelation ExtractionSimilar Papers 제목 키워드 기반
Movement-Prediction-Adjusted Naïve Forecast
This study introduces a movement-prediction-adjusted na\"ive forecast for time series exhibiting symmetric random walk characteristics, which is applicable after accurate movement predictions are available. Specifically,…
Binary ClassificationPredictionregressionTime SeriesLearning Relationship between Quantum Walks and Underdamped Langevin Dynamics
Fast computational algorithms are in constant demand, and their development has been driven by advances such as quantum speedup and classical acceleration. This paper intends to study search algorithms based on quantum w…
On Random Walk Based Graph Sampling
Random walk based graph sampling has been recognized as a fundamental technique to collect uniform node samples from a large graph. In this paper, we first present a comprehensive analysis of the drawbacks of three widel…
Graph SamplingSynwalk -- Community Detection via Random Walk Modelling
Complex systems, abstractly represented as networks, are ubiquitous in everyday life. Analyzing and understanding these systems requires, among others, tools for community detection. As no single best community detection…
Community DetectionDegree-Based Random Walk Approach for Graph Embedding
Graph embedding, representing local and global neighborhood information by numerical vectors, is a crucial part of the mathematical modeling of a wide range of real-world systems. Among the embedding algorithms, random w…
Graph EmbeddingLink PredictionNode Classification