1,414 research outputs found
Leveraging 2-hop Distant Supervision from Table Entity Pairs for Relation Extraction
Distant supervision (DS) has been widely used to automatically construct
(noisy) labeled data for relation extraction (RE). Given two entities, distant
supervision exploits sentences that directly mention them for predicting their
semantic relation. We refer to this strategy as 1-hop DS, which unfortunately
may not work well for long-tail entities with few supporting sentences. In this
paper, we introduce a new strategy named 2-hop DS to enhance distantly
supervised RE, based on the observation that there exist a large number of
relational tables on the Web which contain entity pairs that share common
relations. We refer to such entity pairs as anchors for each other, and collect
all sentences that mention the anchor entity pairs of a given target entity
pair to help relation prediction. We develop a new neural RE method REDS2 in
the multi-instance learning paradigm, which adopts a hierarchical model
structure to fuse information respectively from 1-hop DS and 2-hop DS.
Extensive experimental results on a benchmark dataset show that REDS2 can
consistently outperform various baselines across different settings by a
substantial margin
Analytical controllability of deterministic scale-free networks and Cayley trees
According to the exact controllability theory, the controllability is
investigated analytically for two typical types of self-similar bipartite
networks, i.e., the classic deterministic scale-free networks and Cayley trees.
Due to their self-similarity, the analytical results of the exact
controllability are obtained, and the minimum sets of driver nodes (drivers)
are also identified by elementary transformations on adjacency matrices. For
these two types of undirected networks, no matter their links are unweighted or
(nonzero) weighted, the controllability of networks and the configuration of
drivers remain the same, showing a robustness to the link weights. These
results have implications for the control of real networked systems with
self-similarity.Comment: 7 pages, 4 figures, 1 table; revised manuscript; added discussion
about the general case of DSFN; added 3 reference
- …