A two-stage entity event deduplication method based on graph node selection and node optimization strategy

doi:10.1007/s00500-023-09623-6

A two-stage entity event deduplication method based on graph node selection and node optimization strategy

2024-02-07

0

PRE

AI

DOI：10.1007/s00500-023-09623-6

Original

Original request for help

Save

Abstract

En 中文

Entity event deduplication is the task of identifying all duplication entity events that have described the same entity within a set of events. However, the traditional entity event deduplication method has two challenges. First, the traditional method usually used global comparison when finding the duplication entity event, are all entity events in the dataset need to be compared, leading to low performance. Second, when the entity event evolves, the traditional method does not identify it well and reduces the effectiveness. To address these two problems and improve the performance and effectiveness, we propose a two-stage deduplication method based on graph node selection and optimization (TS-NSNO) strategy. In the first stage (TS-NS), we propose a graph node selection strategy, which transforms the global comparison into a local comparison by selecting the leader node, greatly reduces the number of calculations and improves the performance. In the second stage (TS-NO), we propose a graph node optimization strategy, by combining the spatiotemporal distance and entity event importance change of the event evolution, which optimizes the entity event with incorrect judgment to improve the effectiveness. We conduct extensive experiments on real entity event datasets of different sizes, and the results show that our method performs better in terms of performance and effectiveness.

Keywords:

Deduplication

Entity event

Event evolution

Entity event connected subgraph

A two-stage entity event deduplication method based on graph node selection and node optimization strategy

Abstract

Journal

Organization