51 search results - page 6 / 11 » K-medoid-style Clustering Algorithms for Supervised Summary ... |
JODL
2006
13 years 7 months ago
2006
Recent advances in technology have made tremendous amount of multimedia information available to the general population. An efficient way of dealing with this new development is t...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Query-oriented summarization aims at extracting an informative summary from a document collection for a given query. It is very useful to help users grasp the main information rel...
SBACPAD
2003
IEEE
14 years 23 days ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
A common task in many text mining applications is to generate a multi-faceted overview of a topic in a text collection. Such an overview not only directly serves as an informative...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...