Sciweavers

1940 search results - page 45 / 388
» Optimizing search engines using clickthrough data
Sort
View
SIGIR
2011
ACM
12 years 11 months ago
Find it if you can: a game for modeling different types of web search success using interaction data
A better understanding of strategies and behavior of successful searchers is crucial for improving the experience of all searchers. However, research of search behavior has been s...
Mikhail Ageev, Qi Guo, Dmitry Lagun, Eugene Agicht...
KDD
1995
ACM
98views Data Mining» more  KDD 1995»
14 years 12 days ago
Optimization and Simplification of Hierarchical Clusterings
Clustering is often used to discover structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to se...
Douglas Fisher
SEMWEB
2009
Springer
14 years 3 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker
WEBI
2009
Springer
14 years 3 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
14 years 2 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi