Arrow Research search

Author name cluster

Hengyang Wu

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

EAAI Journal 2024 Journal Article

Similarity propagation based semi-supervised entity alignment

  • Zhihuan Yan
  • Rong Peng
  • Hengyang Wu

Entity alignment aims to identify entities referring to the same real world object among multiple knowledge graphs. Current embedding based approaches suffer from the lack of labeled entity pairs as training data. Some works attempt to boost the training process with semi-supervised methods, which add confidently predicted entity pairs into training data iteratively. Though the effectiveness of this strategy has been confirmed, the current semi-supervised methods suffer from the problem of incorrect newly labeled entity pairs. This paper presents a novel semi-supervised entity alignment framework Similarity Propagation based Semi-supervised Entity Alignment (SPSEA), which improves the precision of labeled entity pairs by propagating alignment information from seed entity pairs to their direct neighbors. The key idea is to combine dependency between entities and entity embeddings to obtain entity similarities, which alleviates the problem of mislabeling when the entity embeddings are of low quality. And it finds aligned entities from direct neighbors of seed entity pairs with the help of relation alignment, which narrows the search space and not hurting the recall of true pairs. In addition, we propose novel deferred-acceptance algorithm and bilateral alignment strategy to further guarantee the quality of obtained entity pairs. Through extensive experiments, we show that the quality of labeled entity pairs obtained by SPSEA is high than current semi-supervised methods.

I&C Journal 2023 Journal Article

On divergence-sensitive weak probabilistic bisimilarity

  • Kangli He
  • Hengyang Wu
  • Yixiang Chen

Weak probabilistic bisimilarity is a well-established notion to equate concurrent probabilistic systems that behave observably equivalent. This notion can be pivotal in the model checking of large probabilistic systems, because the considered model can be replaced by an equivalent, but possibly much smaller one prior to model checking. The conventional work has thus far considered weak probabilistic bisimilarity while ignoring the divergent behavior (interpreted as infinite internal computations). However, we argue that divergence can have a remarkable influence on the equivalence of two concurrent probabilistic systems. We thus explore divergence-sensitive refinements of weak probabilistic bisimilarity. We work in the setting of probabilistic automata, and study the consistent feasible verification method for the notion of divergence-sensitivity that discriminates presence and absence of divergence in bisimilar states. We furthermore present a novel polynomial-time algorithm to compute divergence-sensitive bisimilarity. It intertwines partition-refinement and inductive verification steps in a highly non-trivial manner.

v2026.09.13