IRCLJul 2, 2016

Representation learning for very short texts using weighted word embedding aggregation

arXiv:1607.00570v1197 citations
Originality Incremental advance
AI Analysis

This work addresses the challenge of semantic representation for short texts in applications such as event detection and opinion mining, though it is incremental as it builds on existing word embedding techniques.

The paper tackled the problem of representing very short, noisy texts like tweets by developing a weighted word embedding aggregation method with a median-based loss function, which outperformed baseline approaches on Wikipedia and Twitter data and generalized well across different word embeddings without retraining.

Short text messages such as tweets are very noisy and sparse in their use of vocabulary. Traditional textual representations, such as tf-idf, have difficulty grasping the semantic meaning of such texts, which is important in applications such as event detection, opinion mining, news recommendation, etc. We constructed a method based on semantic word embeddings and frequency information to arrive at low-dimensional representations for short texts designed to capture semantic similarity. For this purpose we designed a weight-based model and a learning procedure based on a novel median-based loss function. This paper discusses the details of our model and the optimization methods, together with the experimental results on both Wikipedia and Twitter data. We find that our method outperforms the baseline approaches in the experiments, and that it generalizes well on different word embeddings without retraining. Our method is therefore capable of retaining most of the semantic information in the text, and is applicable out-of-the-box.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes