MEAD Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". ==" to ". ==") |
m (Text replacement - "]].↵↵== References ==" to "]]. ---- ---- == References ==") |
||
| Line 1: | Line 1: | ||
<B>See:</B> [[Multi-Document Summarization Algorithm]], [[Clustering Algorithm]], [[Cluster Centroid]], [[Extractive Summarization Algorithm]]. | <B>See:</B> [[Multi-Document Summarization Algorithm]], [[Clustering Algorithm]], [[Cluster Centroid]], [[Extractive Summarization Algorithm]]. | ||
---- | |||
---- | |||
== References == | == References == | ||
Latest revision as of 03:23, 10 February 2024
See: Multi-Document Summarization Algorithm, Clustering Algorithm, Cluster Centroid, Extractive Summarization Algorithm.
References
2004
- (Radev et al., 2004) ⇒ Dragomir Radev, Hongyan Jing, Malgorzata Styś, and Daniel Tam. (2004). “Centroid-based Summarization of Multiple Documents.” In: Information Processing and Management, 40 doi:10.1016/j.ipm.2003.10.006
- QUOTE: We present a multi-document summarizer, MEAD, which generates summaries using cluster centroids produced by a topic detection and tracking system.