3133 search results - page 54 / 627 » Representing clusters for retrieval |
122
click to vote
ICAI
2004
14 years 11 months ago
2004
This paper centers on the discussion of k-medoid-style clustering algorithms for supervised summary generation. This task requires clustering techniques that identify class-unifor...
CIVR
2008
Springer
14 years 11 months ago
2008
Springer
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
CIVR
2007
Springer
15 years 4 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a novel formulation and approach to the minimal document set retrieval problem. Minimal Document Set Retrieval (MDSR) is a promising information retrieval task...
113
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...