51 search results - page 3 / 11 » K-medoid-style Clustering Algorithms for Supervised Summary ... |
ICDM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
ICTAI
2009
IEEE
13 years 12 months ago
2009
IEEE
Existing density-based data stream clustering algorithms use a two-phase scheme approach consisting of an online phase, in which raw data is processed to gather summary statistics...
EMNLP
2011
12 years 5 months ago
2011
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...
WEBI
2009
Springer
13 years 9 months ago
2009
Springer
— This paper presents a novel method of generating extractive summaries for multiple documents. Given a cluster of documents, we firstly construct a graph where each vertex repre...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
Document summarization plays an increasingly important role with the exponential growth of documents on the Web. Many supervised and unsupervised approaches have been proposed to ...