Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2016, Article ID 1340973, 10 pages
Research Article

Mining Sequential Update Summarization with Hierarchical Text Analysis

1School of Computer Science and Technology, Shandong University of Finance and Economics, Jinan, Shandong 250014, China
2School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
3School of Computer Science and Technology, Shandong University, Jinan, Shandong 250014, China

Received 1 October 2015; Revised 21 December 2015; Accepted 5 January 2016

Academic Editor: Yassine Hadjadj-Aoul

Copyright © 2016 Chunyun Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The outbreak of unexpected news events such as large human accident or natural disaster brings about a new information access problem where traditional approaches fail. Mostly, news of these events shows characteristics that are early sparse and later redundant. Hence, it is very important to get updates and provide individuals with timely and important information of these incidents during their development, especially when being applied in wireless and mobile Internet of Things (IoT). In this paper, we define the problem of sequential update summarization extraction and present a new hierarchical update mining system which can broadcast with useful, new, and timely sentence-length updates about a developing event. The new system proposes a novel method, which incorporates techniques from topic-level and sentence-level summarization. To evaluate the performance of the proposed system, we apply it to the task of sequential update summarization of temporal summarization (TS) track at Text Retrieval Conference (TREC) 2013 to compute four measurements of the update mining system: the expected gain, expected latency gain, comprehensiveness, and latency comprehensiveness. Experimental results show that our proposed method has good performance.