University of Cambridge > > NLIP Seminar Series > Labelling Topics Using Neural Networks

Labelling Topics Using Neural Networks

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Anita Verő.

Much of the information in large digital libraries is often stored in an unstructured way and is not organised using any automated system. That is usually overwhelming for users in a way that makes it difficult to find specific information or explore such data collections. A particular set of unsupervised statistical methods, namely topic models have been extensively used in Natural Language Processing and Information Retrieval for automatically analysing and organising document collections. Topics generated by topic models are typically presented as a list of terms. Automatic topic labelling is the task of generating a succinct label that summarises the theme or subject of a topic, with the intention of reducing the cognitive load of end-users when interpreting these topics. In this talk, I will present neural network approaches to labelling topics with text and images showcasing their effectiveness on providing meaningful representations of the topics.

Bio: I am an Applied Scientist at Amazon Research Cambridge. Prior to that, I worked as a Research Associate at the Department of Computer Science at UCL and I completed a PhD in NLP at the Department of Computer Science at the University of Sheffield. My main research interests are in Natural Language Processing and Machine Learning. More specifically, I’m interested in applying statistical methods for detecting and interpreting the underlying topics in large volumes of text data. I also develop methods to analyse text and uncover patterns in data to solve problems in other scientific areas such as social and legal science.

This talk is part of the NLIP Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity