5595 search results - page 21 / 1119 » Approximation Algorithms for Clustering Problems |
107
click to vote
KDD
2004
ACM
16 years 3 days ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
KDD
2008
ACM
16 years 3 days ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
SIGIR
2010
ACM
14 years 12 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
108
click to vote
DASFAA
2003
IEEE
15 years 5 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...