Laplacian eigenmaps for automatic news story segmentation

Zihan Liu, Lei Xie, Lilei Zheng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a novel lexical-similarity-based approach to automatic story segmentation in broadcast news. When measuring the connection between a pair of sentences, we take two factors into consideration, i.e. the lexical similarity and the distance between them in the text stream. Further investigation of pairwise connections between sentences is based on the technique of Laplacian Eigenmaps (LE). Taking advantage of the LE algorithm, we construct a Euclidean space in which each sentence is mapped to a vector. The original connective strength between sentences is reflected by the Euclidean distances between the corresponding vectors in the target space of the map. Further analysis of the map leads to a straightforward criterion for optimal segmentation. Then we formalize story segmentation as a minimization problem and give a dynamic programming solution to it. Experimental results on the TDT2 corpus show that the proposed method outperforms several state-of-the-art lexical-similarity-based methods.

Original languageEnglish
Title of host publicationICALIP 2010 - 2010 International Conference on Audio, Language and Image Processing, Proceedings
Pages419-424
Number of pages6
DOIs
StatePublished - 2010
Event2010 International Conference on Audio, Language and Image Processing, ICALIP 2010 - Shanghai, China
Duration: 23 Nov 201025 Nov 2010

Publication series

NameICALIP 2010 - 2010 International Conference on Audio, Language and Image Processing, Proceedings

Conference

Conference2010 International Conference on Audio, Language and Image Processing, ICALIP 2010
Country/TerritoryChina
CityShanghai
Period23/11/1025/11/10

Fingerprint

Dive into the research topics of 'Laplacian eigenmaps for automatic news story segmentation'. Together they form a unique fingerprint.

Cite this