268 search results - page 26 / 54 » Full-Subtopic Retrieval with Keyphrase-Based Search Results ... |
TALG
2010
14 years 4 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
SIGIR
2004
ACM
15 years 3 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
142
Voted
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
This paper reports the estimated number of spam blogs in order to assess their current state in the blogosphere. To extract spam blogs, I developed a traversal method among co-cit...
WWW
2006
ACM
15 years 3 months ago
2006
ACM
This paper proposes a novel approach to measuring XML document similarity by taking into account the semantics between XML elements. The motivation of the proposed approach is to ...