581 search results - page 6 / 117 » Fast Hierarchical Clustering Based on Compressed Data |
IM
2007
13 years 7 months ago
2007
This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by A...
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
: Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data ...
BMCBI
2008
13 years 7 months ago
2008
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
ISPASS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we study the properties of a new packet trace compression method based on clustering of TCP flows. With our proposed method, the compression ratio that we achieve i...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...