Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a novel end-to-end neural architecture for ranking candidate answers, that adapts a hierarchical recurrent neural network and a latent topic clustering module. With our proposed model, a text is encoded to a vector representation from an word-level to a chunk-level to effectively capture the entire meaning. In particular, by adapting the hierarchical structure, our model shows very small performance degradations in longer text comprehension while other state-of-the-art recurrent neural network models suffer from it. Additionally, the latent topic clustering module extracts semantic information from target samples. This clustering module is useful for any text related tasks by allowing each data sample to find its nearest topic cluster, thus helping the neural network model analyze the entire data. We evaluate our models on the Ubuntu Dialogue Corpus and consumer electronic domain question answering dataset, which is related to Samsung products. The proposed model shows state-of-the-art results for ranking question-answer pairs.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 2.
3 papers.
- 2023Unsupervised Dialogue Topic Segmentation with Topic-aware Utterance Representationcited by 11
- 2022Detecting Offensive Language on Social Networks: An End-to-end Detection Method based on Graph Attention Networkscited by 0
- 2023KeyGen2Vec: Learning Document Embedding via Multi-label Keyword Generation in Question-Answeringcited by 0
- 2023KeyGen2Vec: Learning Document Embedding via Multi-label Keyword Generation in Question-Answering30 Oct 2023
- 2023Unsupervised Dialogue Topic Segmentation with Topic-aware Utterance Representation4 May 2023
- 2022Detecting Offensive Language on Social Networks: An End-to-end Detection Method based on Graph Attention Networks4 Mar 2022