Correlating Summarization of Multi-source News with K-Way Graph Bi-clustering

Publication Type

Journal Article

Publication Date

2004

Abstract

With the emergence of enormous amount of online news, it is desirable to construct text mining methods that can extract, compare and highlight similarities of them. In this paper, we explore the research issue and methodology of correlated summarization for a pair of news articles. The algorithm aligns the (sub)topics of the two news articles and summarizes their correlation by sentence extraction. A pair of news articles are modelled with a weighted bipartite graph. A mutual reinforcement principle is applied to identify a dense subgraph of the weighted bipartite graph. Sentences corresponding to the subgraph are correlated well in textual content and convey the dominant shared topic of the pair of news articles. As a further enhancement for lengthy articles, a k-way bi-clustering algorithm can first be used to partition the bipartite graph into several clusters, each containing sentences from the two news reports. These clusters correspond to shared subtopics, and the above mutual reinforcement principle can then be applied to extract topic sentences within each subtopic group.

Discipline

Computer Sciences | Management Information Systems

Research Areas

Information Systems and Management

Publication

ACM SIGKDD Explorations Newsletter

Volume

6

Issue

2

First Page

34

Last Page

42

ISSN

1931-0145

Identifier

10.1145/1046456.1046461

Publisher

ACM

Comments

Special Issue on Web Content Mining

Additional URL

http://dx.doi.org/10.1145/1046456.1046461

Link to Full Text

Share

COinS