Sciweavers

1889 search results - page 22 / 378
» Re-ranking search results using query logs
Sort
View
FSTTCS
2004
Springer
14 years 3 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
WWW
2007
ACM
14 years 10 months ago
Sliding window technique for the web log analysis
The results of the Web query log analysis may be significantly shifted depending on the fraction of agents (non-human clients), which are not excluded from the log. To detect and ...
Nikolai Buzikashvili
EMNLP
2009
13 years 7 months ago
Using Word-Sense Disambiguation Methods to Classify Web Queries by Intent
Three methods are proposed to classify queries by intent (CQI), e.g., navigational, informational, commercial, etc. Following mixed-initiative dialog systems, search engines shoul...
Emily Pitler, Ken Ward Church
AIRWEB
2008
Springer
14 years 2 days ago
Cleaning search results using term distance features
The presence of Web spam in query results is one of the critical challenges facing search engines today. While search engines try to combat the impact of spam pages on their resul...
Josh Attenberg, Torsten Suel
CIKM
2004
Springer
14 years 3 months ago
Optimizing web search using web click-through data
The performance of web search engines may often deteriorate due to the diversity and noisy information contained within web pages. User click-through data can be used to introduce...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Yong Yu, W...