5046 search results - page 335 / 1010 » Non-redundant data clustering |
177
click to vote
NAACL
2004
15 years 8 months ago
2004
We present a technique for augmenting annotated training data with hierarchical word clusters that are automatically derived from a large unannotated corpus. Cluster membership is...
184
click to vote
NIPS
2001
15 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
172
click to vote
ICCD
2003
IEEE
16 years 3 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 ...
232
click to vote
SISAP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
163
click to vote
ICDM
2005
IEEE
16 years 12 days ago
2005
IEEE
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...