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

• Main Authors: ZHANG, Ya, CHU, Chao-Hsien, JI, Xiang, ZHA, Hongyuan
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2004
• Subjects: Computer Sciences; Management Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/1791; http://dl.acm.org/citation.cfm?id=1046461
• Institution: Singapore Management University

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.