157 search results - page 1 / 32 » Optimal meta search results clustering |
SIGIR
2010
ACM
13 years 4 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...
EUROCAST
2009
Springer
13 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
ICDM
2006
IEEE
13 years 10 months ago
2006
IEEE
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...
EDBT
2002
ACM
14 years 4 months ago
2002
ACM
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
UM
2009
Springer
13 years 11 months ago
2009
Springer
Clustering of search results has been shown to be advantageous over the simple list presentation of search results. However, in most clustering interfaces, the clusters are not ada...