5046 search results - page 249 / 1010 » Non-redundant data clustering |
192
click to vote
JMLR
2006
15 years 6 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
142
click to vote
KES
2010
Springer
15 years 5 months ago
2010
Springer
Document clustering is a powerful technique that has been widely used for organizing data into smaller and manageable information kernels. Several approaches have been proposed...
192
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
167
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
We propose to use MapReduce to quickly test new retrieval approaches on a cluster of machines by sequentially scanning all documents. We present a small case study in which we use ...
167
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...