This repository implements the system described in "Growing Story Forest Online from Massive Breaking News"
We describe our experience of implementing a news content organization system at Tencent that discovers events from vast streams of breaking news and evolves news story structures in an online fashion. Our real-world system has distinct requirements in contrast to previous studies on topic detection and tracking (TDT) and event timeline or graph generation, in that we 1) need to accurately and quickly extract distinguishable events from massive streams of long text documents that cover diverse topics and contain highly redundant information, and 2) must develop the structures of event stories in an online manner, without repeatedly restructuring previously formed stories, in order to guarantee a consistent user viewing experience. In solving these challenges, we propose Story Forest, a set of online schemes that automatically clusters streaming documents into events, while connecting related events in growing trees to tell evolving stories. We conducted extensive evaluation based on 60 GB of real-world Chinese news data, although our ideas are not language-dependent and can easily be extended to other languages, through detailed pilot user experience studies. The results demonstrate the superior capability of Story Forest to accurately identify events and organize news text into a logical structure that is appealing to human readers, compared to multiple existing algorithm frameworks.READ FULL TEXT VIEW PDF
Following a particular news story online is an important but difficult t...
Clustering news across languages enables efficient media monitoring by
Many methods have been proposed for detecting emerging events in text st...
The news coverage of events often contains not one but multiple incompat...
Twitter is often the most up-to-date source for finding and tracking bre...
Early detection and precise characterization of emerging topics in text
The volume of news content has increased significantly in recent years a...
This repository implements the system described in "Growing Story Forest Online from Massive Breaking News"
With information explosion in the fast-paced modern society, tremendous volumes of articles on trending and breaking news are being generated on a daily basis by various Internet media providers, e.g., Yahoo! News, CNN, Tencent News, Sina News, etc. In the meantime, it becomes increasingly difficult for normal readers to digest such a large amount of streaming news information. Search engines perform document retrieval from large corpora based on user-defined queries that specify what are interesting to the user. However, they do not provide a natural way for users to view what is going on. Furthermore, search engines return a list of ranked documents and do not provide structural summaries of trending topics or breaking news.
An emerging alternative way to visualize news corpora without pre-specified queries is to organize and present news articles through event timelines (Yan et al., 2011; Wang et al., 2016), event threads (Nallapati et al., 2004), event evolution graphs (Yang et al., 2009), or information maps (Shahaf et al., 2012; Shahaf et al., 2013; Xu et al., 2013). However, till today few existing news information organization techniques are turned into large-scale deployment due to several reasons:
First of all, despite research efforts in Topic Detection and Tracking (TDT) (Yang et al., 2002; Allan et al., 1998), it remains challenging to extract distinguishable “events” at a proper granularity, as building blocks of the news graph, from today’s vast amount of open-domain daily news. The news articles may cover extremely diverse topics and contain redundant information about a same conceptual event published by different sources. For example, simply connecting individual articles (Shahaf et al., 2012) or named entities (Faloutsos et al., 2004) in a graph will lead to redundant and entangled information. On the other hand, connecting co-occuring keyword sets in an information map (Shahaf et al., 2013) can greatly reduce the fine details of news graphs. But even with the keyword graph, a user still needs to put additional efforts to understand the large number of articles associated with each keyword set.
Second, many recently proposed event graphs or information maps try to link events in an arbitrary evolution graph (Yang et al., 2009) or permitting intertwining branches in the information map (Shahaf et al., 2013). However, we would like to point out that such overly complex graph structures do not make it easy for users to quickly visualize and understand news data. In fact, unlike a novel or a complex story about a celebrity queried from a search engine, most breaking news stories follow one of a few typical developing structures. In fact, for breaking news summary that will appeal to commercial uses, simple story structures are preferred.
Most importantly, most existing event timeline or event graph generation schemes are based on offline optimization over the entire news corpora, while for a system that visualizes breaking news, it is desirable to “grow” the stories in an online fashion without disrupting or restructuring the previously generated stories. On one hand, online computation can prevent repeated processing of older documents. On the other hand, an online scheme can deliver a consistent story development structure to users, so that users can quickly visualize what’s new in the hot events that they are trying to follow. Furthermore, given the vast amount of collected daily news data, the entire online computation to identify new events and extend the existing story graphs will incur less delay.
In this paper, we present our experience of implementing StoryForest, which is a comprehensive system to organize vast amounts of breaking news data into easily readable story trees of events in an online fashion. We make careful design choices for each component in this large system, with the following contributions:
First, our system can accurately cluster massive amounts of long news documents into conceptually clean events through a novel two-layer document clustering procedure that leverages a wide range of feature engineering and machine learning techniques, mainly including keyword extraction, keyword community detection, a pre-trained classifier to detect whether two documents are talking about the same event, and a graph-based document clustering procedure. On a labeled news dataset, our proposed text clustering procedure significantly outperforms a number of existing text clustering schemes.
Second, our system further groups the discovered events into stories, where each story is represented by a tree
of events. A link between two events indicates the temporal migration or a causal relationship between two events. Compared with existing story generation systems such as StoryGraph(Yang et al., 2009) and MetroMap (Shahaf et al., 2012), we propose an online algorithm to evolve story trees incrementally based on daily news, without any churn of reforming the graph when new data arrive. As a result, each story is presented in one of several easy-to-view structures, i.e., either a linear timeline, a flat structure, or a tree with branches, which we believe are sufficient to represent story structures of most breaking news.
Finally, we evaluated the performance of our system based on 60 GB of Chinese news documents collected from all the major Internet news providers in China (including Tencent, Sina, WeChat, Sohu, etc.) in a three-month period from October 1, 2016 to December 31, 2016, covering extremely diverse topics in the open domain. We also conducted a detailed and extensive pilot user experience study for (long) news document clustering and news story generation to evaluate how our system as well as several baseline schemes conform to the habit of human readers.
According to the pilot user experience study, our system outperforms multiple state-of-the-art news clustering and story structure generation systems such as KeyGraph (Sayyadi and Raschid, 2013) and StoryGraph (Yang et al., 2009) in terms of logical validity of the generated story structures, as well as the conceptual purity of each identified event and story. Experiments show that the average time for our Java-based system to finish event clustering and story structure generation based on the daily data is less than seconds on a MacBook Pro with a 2 GHz Intel Core i7 processor, and 8 GB memory. Therefore, our system proves to be highly efficient and practical.
It is worth mentioning that our work represents the first system that is able to efficiently process vast amounts of Chinese news data into organized story structures, although our proposed algorithms and schemes are also applicable to news data in English (and other languages) by simply replacing the word segmentation and NLP tools with the counterparts for the corresponding language.
We first present some definitions of key concepts in the top-down hierarchy: topic story event to be used in this paper.
Event: an event is a set of one or several documents that contain highly similar information.
Story: a story is a tree of events that revolve around a group of specific persons and happen at certain places during specific times. A directed edge from event to indicates a temporal evolution or a logical connection from to .
Topic: a topic consists of a set of stories that are highly correlated or similar to each other.
Each topic may contain multiple story trees, and each story tree consists of multiple logically connected events. In our work, events (instead of news documents) are the smallest atomic units. Each event is also assumed to belong to a single story and contains partial information about that story. For instance, considering the topic American presidential election, 2016 U.S. presidential election is a story within this topic, and Trump and Hilary’s first television debate is an event within this story.
We now introduce some notations and describe our problem formally. Given a news document stream , where is the set of news documents collected on time period , our objective is to: a) cluster all news documents into a set of events , and b) connect the extracted events to form a set of stories . Each story contains a set of events and a set of links , where denotes a directed link from event to , which indicates a temporal evolution or logical connection relationship.
Furthermore, we require the events and story trees to be extracted in an online or incremental manner. That is, we extract events from each individually when the news corpus arrives in time period , and merge the discovered events into the existing story trees that were found at time . This is a unique strength of our scheme as compared to prior work, since we do not need to repeatedly process older documents and can deliver a set of evolving yet logically consistent story trees to users.
For example, Fig. 1 illustrates the story tree of “2016 U.S. presidential election”. The story contains nodes, where each node indicates an event in 2016 U.S. election, and each link indicates a temporal evolution or a logical connection between two events. The index number on each node represents the event sequence over the timeline. There are paths within this story tree, where the path indicates the whole presidential election process, branch is about Hilary’s health conditions, branch talks about television debates, depicts the investigation into Hilary’s “mail door”, etc. As we can see, by modeling the evolutionary and logical structure of a story into a story tree, users can easily grasp the logic of news stories and learn the main information quickly.
Let us represent each story by an empty root node from which the story is originated, and denote each event by an event node . The events in a story can be organized in one of the following four structures shown in Fig. 2: a) a flat structure that does not include dependencies between events; b) a timeline structure that organizes events by their timestamps; c) a graph structure that checks the connection between all pairs of events and maintains a subset of most strong connections; d) a tree structure, which represents a story’s evolving structure by a tree.
Compared with a tree structure, sorting events by timestamps omits the logical connection between events, while using directed acyclic graphs to model event dependencies without considering the evolving consistency of the whole story can leads to unnecessary connections between events. Through extensive user experience studies in Sec. 4, we show that tree structures are the most effective way to represent breaking news stories as compared to other structures, including the more complex graph structures.
An overview of our Story Forest system is shown in Fig. 3, which mainly consists of three components: preprocessing, document clustering and story tree update, divided into 5 steps. First, the input news document stream will be processed by a variety of NLP and machine learning tools, mainly including document filtering, word segmentation and keyword extraction. Second, steps 2–3 will cluster documents into events in a novel 2-layer procedure as follows. For news corpus in each time period , we form a keyword graph (Sayyadi and Raschid, 2013) from these documents based on keyword co-occurrence, and extract topics as subgraphs from the keyword graph using community detection algorithms. The topics with few keywords will be discarded. After each topic is found, we find all the documents associated with the topic, and further cluster these documents into events through a semi-supervised document clustering procedure aided by a pre-trained document-pair relationship classifier. Finally, in steps 4–5 we update the story trees (formed previously) by either inserting each discovered event into an existing story tree at the right place, or creating a new story tree if the event does not belong to any existing story. Note that each topic may contain multiple story trees and each story tree consists of logically connected events. We will explain the design choices of each component in detail in the following.
When a new set of news documents arrives, we need to clean, filter documents, and extract features that will be helpful to the steps that follow. Our preprocessing module mainly includes the following three steps, which are critical to the overall system performance:
Document filtering: unimportant documents with content length smaller than a threshold (20 characters) will be discarded.
Word segmentation: we segment the title and body of each document using Stanford Chinese Word Segmenter Version 3.6.0 (Chang et al., 2008), which has proved to yield excellent performance on Chinese word segmentation tasks. Note that for data in a different language, the corresponding word segmentation tool in that language can be used instead.
Keyword extraction: extracting keywords from each document to represent the main concepts of the document is quite critical to the performance and efficiency of the entire system. We found that traditional keyword extraction approaches, such as TF-IDF based keyword extraction and TextRank (Mihalcea and Tarau, 2004), are not sufficient to achieve good performance for real-world news data. For example, the TF-IDF based method measures each word’s importance by frequency information; it cannot detect keywords that yet have a relatively low frequency. The TextRank algorithm utilizes the word co-occurrence information and is able to handle such cases. However, its efficiency is relatively low, with time cost increasing significantly as the document length increases.
|Word feature||Named entity or not, location name or not, contains angle brackets or not.|
|Structural feature||TF-IDF, whether appear in title, first occurrence position in document, average occurrence position in document, distance between first and last occurrence positions, average distance between word adjacent occurrences, percentage of sentences that contains the word, TextRank score.|
|Semantic feature||LDA222We trained a -dimensional LDA model based on news data collected from January 1, 2016 to May 31, 2016 that contains documents.|
To efficiently and accurately extract keywords, we constructed a supervised learning system to classify whether a word is a keyword or not for a document. In particular, we manually labeled the keywords ofdocuments, including positive keyword samples and negative samples. Table 1 lists the main features that we found critical to the binary classifier.
A straightforward idea is to input the raw features listed above to a Logistic Regression (LR). However, as a linear classifier, LR relies on careful feature engineering. To reduce the impact of human judgement in feature engineering, we combine a Gradient Boosting Decision Tree (GBDT) with the LR classifier to get the binary yes/no classification result, as shown in Fig.4
. GBDT, as a nonlinear model, can automatically discover useful cross features or feature combinations from raw features and discretize continuous features. The output of the GBDT will serve as the input of the LR classifier. Finally, the LR classifier will determine whether a word is a keyword or not for the document in question. We also tried SVM as the classifier in the second layer instead of LR and observed similar performance. Our final keyword extraction precision and recall rate areand , while they are and respectively if we don’t add the GBDT component.
After document preprocessing, we need to extract events. Event extraction here is essentially a fine-tuned document clustering procedure to group conceptually similar documents into events. Although clustering studies are often subjective in nature, we show that our carefully designed procedure can significantly improve the accuracy of event clustering, conforming to human understanding, based on a manually labeled news dataset. To handle the high accuracy requirement for long news text clustering, we propose a -layer clustering approach based on both keyword graphs and document graphs.
First, we construct a large keyword co-occurrence graph (Sayyadi and Raschid, 2013) . Each node in is a keyword extracted by the scheme described in Sec. 3.1, and each undirected edge indicates that and have ever co-occured in a same document. Edges that satisfy two conditions will be kept and other edges will be dropped: the times of co-occurrence shall be above a minimum threshold (we use
in our system), and the conditional probabilities of the occurrenceand also need to be bigger than a predefined threshold (we use ), where the conditional probability represents the probability that occurs in a document if the document contains word .
Second, we perform community detection in the constructed keyword graph. This step aims to split the whole keyword graph into communities , where each community contains the keywords for a certain topic (to which multiple stories may be associated). The benefit of using community detection in the keyword graph is that each keyword can appear in multiple communities, which makes sense in reality. We also tried another method of clustering keywords by Word2Vec
. However, the performance is worse than community detection based on co-occurrence graphs. The reason is that using word vectors tends to cluster the words with similar semantic meanings. However, unlike articles in a specialized domain, in long news documents in the open domain, it is highly possible that keywords with different semantic meanings can co-occur in the same event.
To detect keyword communities, we utilize the betweenness centrality score (Sayyadi and Raschid, 2013) of edges to measure the strength of each edge in the keyword graph. An edge’s betweenness score is defined as the number of shortest paths between all pairs of nodes that pass through it. An edge between two communities is expected to achieve a high betweenness score. Edges with high betweenness score will be removed iteratively to extract communities. The iterative splitting process will stop until the number of nodes in each sub-graph is smaller than a predefined threshold, or until the maximum betweenness score of all edges in the sub-graph is smaller than a threshold that depends on the sub-graph’s size. We refer interested readers to (Sayyadi and Raschid, 2013) for more details about community detection.
After we obtain the keyword communities, we calculate the cosine similarity between each document and a keyword community. The documents are represented by TF-IDF vectors. As a keyword community is a bag of words, it can also be considered as a document. We assign each document to the keyword community which gives the highest similarity and the similarity is above a predefined threshold. Up to now, we have finished document clustering in the first layer, i.e., the documents are grouped according to topics.
Third, we further perform the second-layer document clustering within each topic to obtain fine-grained events. We also call this process event clustering
. An event only contains documents that talk about the same semantic event. To yield fine-grained event clustering, unsupervised learning is not sufficient. Instead, we adopt a supervised-learning-guided clustering procedure in the second layer.
Specifically, we train an SVM classifier to determine whether a pair of documents are talking about the same event or not using a bunch of document-pair features as the input, including the cosine similarities of content TF-IDF and TF vectors, the cosine similarities of title TF-IDF and TF vectors, the similarity of the first sentences in the two documents, etc.
For each pair of documents within a same topic, we decide whether to connect them or not according to the prediction made by the document-pair relationship classifier mentioned above. Hence, the documents in each topic will form a document graph. We then apply the same community detection algorithm mention above to such document graphs. Note that the graph-based clustering on the second layer is highly efficient, since the number of documents contained in each topic is significantly smaller after the first-layer document clustering.
In a nutshell, our 2-layer scheme groups documents into topics based on keyword community detection and further groups the documents within each topic into fine-grained events. For each event , we also record the set of keywords of the topic (keyword community) which it belongs to, which will be helpful in the subsequent story tree development.
Given the set of extracted events for a particular topic, we further organize these events into multiple stories under this topic in an online manner. Each story is represented by a Story Tree to characterize the evolving structure of that story. Upon the arrival of a new event and given an existing story forest, our online algorithm to grow the story forest mainly involves two steps: a) identifying the story tree to which the event belongs; b) updating the found story tree by inserting the new event at the right place. If this event does not belong to any existing story, we create a new story tree.
a) Identifying the related story tree. Given a set of new events at time period and an existing story forest that has been formed during previous time periods, our objective is to assign each new event to an existing story tree . If no story in the current story forest matches that event, a new story tree will be created and added to the story forest.
We apply a two-step strategy to decide whether a new event belongs to an existing story tree formed previously. First, as described at the end of Sec. 3.2, event has its own keyword set . Similarly, for the existing story tree , there is an associated keyword set that is a union of all the keyword sets of the events in that tree.
Then, we can calculate the compatibility between event and story tree as the Jaccard similarity coefficient between and : If the compatibility is bigger than a threshold, we further check whether at least a document in event and at least a document in story tree share or more common words in their titles (with stop words removed). If yes, we assign event to story tree . Otherwise, they are not related. In our experiments, we set . If the event is not related to any existing story tree, a new story tree will be created.
b) Updating the related story tree. After a related story tree has been identified for the incoming event , we perform one of the 3 types of operations to place event in the tree: merge, extend or insert, as shown in Fig. 5. The merge operation merges the new event into an existing event node in the tree. The extend operation will append event as a child node to an existing event node in the tree. Finally, the insert operation directly appends event to the root node of story tree . Our system chooses the most appropriate operation to process the incoming event based on the following procedures.
Merge: we merge with an existing event in the tree, if they essentially talk about the same event. This can be achieved by checking whether the centroid documents of the two events are talking about the same thing using the document-pair relationship classifier described in Sec. 3.2. The centroid document of an event is simply the concatenation of all the documents in the event.
Extend and Insert: if event does not overlap with any existing event, we will find the parent event node in to which it should be appended. We calculate the connection strength between the new event and each existing event based on three factors: 1) the time distance between and , 2) the compatibility of the two events, and 3) the storyline coherence if is appended to in the tree, i.e.,
Now we explain the three components in the above equation one by one. First, the compatibility between two events and is given by
where is the centroid document of event .
Furthermore, the storyline of is defined as the path in starting from the root node of ending at itself, denoted by . Similarly, the storyline of appended to is denoted by . For a storyline represented by a path , where , its coherence (Xu et al., 2013) measures the theme consistency along the storyline, and is defined as
Finally, the bigger the time gap between two events, the less possible that the two events are connected. We thus calculate time penalty by
where and are the timestamps of event and respectively. The timestamp of an event is the minimum timestamp of all the documents in the event.
We calculate the connection strength between the new event and every event node using (1), and append event to the existing that leads to the maximum connection strength. If the maximum connection strength is lower than a threshold value, we insert into story tree by directly appending it to the root node of . In other words, insert is a special case of extend.
We evaluate the performance of our system based on 60 GB of Chinese news documents collected from all the major Internet news providers in China, such as Tencent and Sina, in a three-month period from October 1, 2016 to December 31, 2016 covering different topics in the open domain. Fig. 6 shows the amounts of documents on different days in the dataset. The average number of documents in one day during that period is . For the following experiments, we use the data in the first days for parameter tuning. The remaining data serves as the test set.
We first evaluate the performance of our two-layer graph-based document clustering procedure for event extraction. We manually annotated a test dataset that consists of news documents with ground-truth event labels, and compare our algorithm with the following methods:
LDA + Affinity Propagation: extract the 1000-dimensional LDA vector of each document, and cluster them by the Affinity Propagation clustering algorithm (Guan et al., 2011).
KeyGraph: the original KeyGraph algorithm (Sayyadi and Raschid, 2013) for document clustering, without the second-layer clustering based on document graphs and document-pair relationship classifier.
We use the homogeneity, completeness, and V-measure score (Rosenberg and Hirschberg, 2007)
as the evaluation metrics of clustering results. Homogeneity is larger if each cluster contains only members from a single class. The completeness is maximized if all members of a ground true class are assigned to the same cluster. The V-measure is the harmonic mean between homogeneity and completeness:
|LDA + AP|
Table 2 shows that our approach achieves the best V-measure compared with other methods, partly due to the fact that our method achieves the highest homogeneity score, which is . This implies that most of the document clusters (events) we obtain are pure: each event only contains documents that talk about the same event. In comparison, the homogeneity for the other two methods is much lower. The reason is that we adopt two layers of graph-based clustering to group documents into events with more appropriate granularity.
Yet, the completeness of our approach is a little bit smaller than that of KeyGraph, which is reasonable, as we further split the clusters with the second layer document-graph-based clustering supervised by the document-pair relationship classifier. Considering the significant improvement in homogeneity, the loss in completeness is ignorable.
We evaluate different event timeline and story generation algorithms on the large 3-month news dataset through pilot user evaluation. To make fair comparisons, the same preprocessing and event extraction procedures before developing story structures are adopted for all methods, with 261 stories detected from the dataset. The only difference is how to construct the story structure given a set of event nodes. We compare our online Story Forest system with the following existing algorithms:
Story Graph (Graph): this method calculates a connection strength for every pair of events and connect the pair if the score exceeds a threshold (Yang et al., 2009).
Event Threading (Thread): this algorithm appends each new event to its most similar earlier event (Nallapati et al., 2004). The similarity between two events is measured by the TF-IDF cosine similarity of the event centroids.
We enlisted human reviewers, including product managers, software engineers and senior undergraduate students, to blindly evaluate the results given by different approaches. Each individual story was reviewed by different reviewers. When the reviewers’ opinions are different, they will discuss to give a final result. For each story, the reviewers answered the following questions for each of the different structures generated by different schemes:
Do all the documents in each story cluster truly talk about the same story (yes or no)? Continue if yes.
Do all the documents in each event node truly talk about the same event (yes or no)? Continue if yes.
For each story structure given by different algorithms, how many edges correctly represent the event connections?
For each story structure given by story forest, event threading and story timeline, how many paths from ROOT to any leaf node exist in the graph? And how many such paths are logically coherent?
Which algorithm generates the structure that is the best in terms of revealing the story’s underlying logical structure?
Note that for question (3), the total number of edges for each tree equals to the number of events in that tree. Therefore, to make a fair comparison, for the story graph algorithm, we only retain the edges with the top scores, where is the number of events in that story graph.
We first report the clustering effectiveness of our system in the pilot user evaluation on the -month dataset. Among the 261 stories, 234 of them are pure story clusters (yes to question ), and furthermore there are 221 stories only contains pure event nodes (yes to question ). Therefore, the final accuracy to extract events (yes to both question and ) is .
Next, we compare the output story structures given by different algorithms from three aspects: the correct edges between events, the logical coherence of paths, and the overall readability of different story structures. Fig. 7(a) compares the CDFs of incorrect edge percentage under different algorithms. As we can see, Story Forest significantly outperforms the other baseline approaches. As shown in Table 3, for story trees, all the edges in each tree are reviewed as correct, and the average percentage of correct edges for all the story trees is . In contrast, the average correct edge percentage given by the story graph algorithm is .
An interesting observation is that the average percentage of correct edges given by the simple flat structure is , which is a special case of our tree structures. This can be explained by the fact that most real-world breaking news that last for a constrained time period are not as complicated as a novel with rich logical structure, and a flat structure is often enough to depict their underlying logic. However, for stories with richer structures and a relatively longer timeline, Story Forest gives better result than other algorithms by comprehensively considering the event similarity, path coherence and time gap, while other algorithms only consider parts of all the factors.
For path coherence, Fig. 7(b) shows the CDFs of percentages of inconsistent paths under different algorithms. Story Forest gives significantly more coherent paths: the average percentage of coherent paths is for our algorithm, and is and , respectively, for event threading and story timeline. Note that path coherence is meaningless for flat or graph structure.
Fig. 7(c) plots overall readability of different story structures. Among the stories, the tree-based Story Forest system gives the best readability on stories, which is much better than all other approaches. Different algorithms can generate the same structure. For example, the Story Forest system can also generate a flat structure, a timeline, or a same structure as the event threading algorithm does. Therefore, the sum of the numbers of best results given by different approaches is bigger than . It’s worth noting that the flat and timeline algorithms also give and most readable results, which again indicates that the logic structures of a large portion of real-world news stories can be characterized by simple flat or timeline structures, which are special cases of story trees. And complex graphs are often an overkill.
We further inspect the story structures generated by Story Forest. Fig. 8(a) and Fig. 8(b) plot the distributions of the number of events and the number of paths in each story tree, respectively. The average numbers of events and paths are and , respectively. Although the tree structure includes the flat and timeline structures as special cases, among the stories, Story Forest generates flat structures and timelines, while the remaining structures generated are still story trees. This implies that Story Forest is versatile and can generate diverse structures for real-world news stories, depending on the logical complexity of each story.
In this section, we discuss the complexity of each step in our system. For a time slot (e.g., in our case is one day), let be the number of documents, the number of unique words in corpora, note , the number of different events, the number of different stories, and represents the maximum number of unique keywords in a document.
As discussed in (Sayyadi and Raschid, 2013), building keyword graph requires complexity, and community detection based on betweenness centrality requires . The complexity of assigning documents to keyword communities is . So by far the total complexity is . There exist other community detection algorithms requiring only , such as the algorithm in (Radicchi et al., 2004). Thus we can further improve efficiency by using faster community detection algorithms.
After clustering documents by keyword communities, for each cluster the average number of documents is . The pair-wise document relation classification is implemented in . The complexity of the next document graph splitting operation is . Therefore, the total complexity is . Our experiments show that usually . Combining with , the complexity is now approximately .
To grow story trees with new events, the complexity of finding the related story tree for each event is of , where is the history length to keep existing stories and delete older stories. If no existing related story, creating a new story requires operations. Otherwise, the complexity of updating a story tree is . In summary, the complexity of growing story trees is , as our experience on the Tencent news dataset shows that . Our online algorithm to update story structure requires complexity and delivers a consistent story development structure, while most existing offline optimization based story structure algorithms require at least complexity and disrupt the previously generated story structures.
Fig. 9 shows the running time of our Story Forest system on the months news dataset. The average time of processing each day’s news is around seconds, and increases linearly with number of days. For the offline keyword extraction module, the processing efficiency is approximately documents per second. The performance of keyword extraction module is consistent with time and doesn’t require frequently retraining. The LDA model is incrementally retrained every day to handle new words. For keyword extraction, the efficiency of event clustering and story structure generation can be further improved by a parallel implementation.
There are mainly two research lines that are highly related to our work: Text Clustering and Story Structure Generation.
. The most popular way is first extracting specific text features, such as TF-IDF, from documents, and then apply general clustering algorithms such as k-means. The selection of different feature and setting of algorithm parameters plays a key role in the final performance of clustering(Liu et al., 2005). There are also approaches which utilize the document keywords co-occurrence information to construct a keyword graph, and clustering documents by applying community detection techniques on the keyword graph (Sayyadi and Raschid, 2013). (Mele and Crestani, 2017)
combines topic modeling, named-entity recognition, and temporal analysis to detect event clusters from news streams.(Chakrabarti et al., 2010) proposed an evolutionary clustering framework to cluster data over time. A more comprehensive study of different text clustering algorithms can be found in (Aggarwal and Zhai, 2012).
The Topic Detection and Tracking (TDT) research spot news events and group by topics, and track previously spotted news events by attaching related new events into the same cluster (Allan et al., 1998; Allan, 2012; Yang et al., 2009; Sayyadi and Raschid, 2013). However, the associations between related events are not defined or interpreted by TDT techniques. To help users capture the developing structure of events, different approaches have been proposed. (Nallapati et al., 2004) proposed the concept of Event Threading, and tried a series of strategies based on similarity measure to capture the dependencies among events. (Yang et al., 2009) combines the similarity measure between events, temporal sequence and distance between events, and document distribution along the timeline to score the relationship between events, and models the event evolution structure by a directed acyclic graph (DAG).
The above research works measure and model the relationship between events in a pairwise manner. However, the overall story consistency is not considered. The Metro Map model proposed in (Shahaf et al., 2013) defines metrics such as coherence and diversity for story quality evaluation, and identifies lines of documents by solving an optimization problem to maximize the topic diversity of storylines while guarantee the coherence of each storyline. However, new documents are being generated all the time, and systems that are able to catch related news and update story structures in an online manner are desired.
As studies based on unsupervised clustering techniques (Yan et al., 2011) perform poorly in distinguishing storylines with overlapped events (Hua et al., 2016), more recent works introduce different Bayesian models to generate storyline. However, they often ignore the intrinsic structure of a story (Huang and Huang, 2013) or fail to properly model the hidden relations (Zhou et al., 2015). (Hua et al., 2016) proposes a hierarchical Bayesian model for storyline generation, and utilize twitter hashtags to “supervise” the generation process. However, the Gibbs sampling inference of the model is time consuming, and such twitter data is not always available for every news stories.
In this paper, we describe our experience of implementing Story Forest, a news content organization system at Tencent, which is designed to discover events from vast streams of trending and breaking news and organize events in sensible story trees in an online manner. Our system is specifically tailored for fast processing massive amounts of breaking news data, whose story structures can most likely be captured by either a tree, a timeline or a flat structure. We propose a two-layer graph-based document clustering algorithm to extract fine-grained events from vast long documents. Our system further organizes the events into story trees with efficient online algorithms upon the arrival of daily news data. We conducted extensive performance evaluation based on 60 GB of real-world (Chinese) news data, although our ideas are not language-dependent and can easily be extended to other languages, through detailed pilot user experience studies.
Extensive results suggest that our clustering procedure is significantly more effective at accurate event extraction than existing algorithms. 83% of the event links generated by Story Forest are logically correct as compared to an accuracy of 33% generated by more complex story graphs, demonstrating the ability of our system to organize trending news events into a logical structure that appeals to human readers.
A comparative study on unsupervised feature selection methods for text clustering. InNatural Language Processing and Knowledge Engineering, 2005. IEEE NLP-KE’05. Proceedings of 2005 IEEE International Conference on. IEEE, 597–601.