mlsanityData to 7 Oct 2026

Where Did the President Visit Last Week? Detecting Celebrity Trips from News Articles

arXiv 2307.08721 ↗First posted 17 Jul 2023cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Celebrities' whereabouts are of pervasive importance. For instance, where politicians go, how often they visit, and who they meet, come with profound geopolitical and economic implications. Although news articles contain travel information of celebrities, it is not possible to perform large-scale and network-wise analysis due to the lack of automatic itinerary detection tools. To design such tools, we have to overcome difficulties from the heterogeneity among news articles: 1)One single article can be noisy, with irrelevant people and locations, especially when the articles are long. 2)Though it may be helpful if we consider multiple articles together to determine a particular trip, the key semantics are still scattered across different articles intertwined with various noises, making it hard to aggregate them effectively. 3)Over 20% of the articles refer to the celebrities' trips indirectly, instead of using the exact celebrity names or location names, leading to large portions of trips escaping regular detecting algorithms. We model text content across articles related to each candidate location as a graph to better associate essential information and cancel out the noises. Besides, we design a special pooling layer based on attention mechanism and node similarity, reducing irrelevant information from longer articles. To make up the missing information resulted from indirect mentions, we construct knowledge sub-graphs for named entities (person, organization, facility, etc.). Specifically, we dynamically update embeddings of event entities like the G7 summit from news descriptions since the properties (date and location) of the event change each time, which is not captured by the pre-trained event representations. The proposed CeleTrip jointly trains these modules, which outperforms all baseline models and achieves 82.53% in the F1 metric.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 74 references that are in the map. First posted on arXiv 17 Jul 2023.

Builds on

17 of 74 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  5. 2018Datasheets for Datasetscited by 1,371
  6. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
  7. 2019Self-Attention Graph Poolingcited by 421
  8. 2019Composition-based Multi-Relational Graph Convolutional Networkscited by 395
  9. 2018Graph Convolutional Networks for Text Classificationcited by 345
  10. 2017Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphscited by 307
  11. 2018A Survey on Deep Learning for Named Entity Recognitioncited by 281
  12. 2015Diffusion-Convolutional Neural Networkscited by 268
5 more
  1. 2020Relational Graph Attention Network for Aspect-based Sentiment Analysiscited by 104
  2. 2020Heterogeneous Graph Neural Networks for Extractive Document Summarizationcited by 90
  3. 2019Inter-sentence Relation Extraction with Document-level Graph Convolutional Neural Networkcited by 51
  4. 2019Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networkscited by 23
  5. 2018Graph Based Semi-supervised Learning with Convolution Neural Networks to Classify Crisis Related Tweetscited by 9

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.