Sciweavers

1889 search results - page 115 / 378
» Re-ranking search results using query logs
Sort
View
WISE
2000
Springer
14 years 3 months ago
Searching the Web Using a Map
Most Internet search engines are keyword-based. They are not efficient for the queries where geographical location is important, such as finding hotels within an area or close to ...
Joseph D. Yates, Xiaofang Zhou
CCGRID
2003
IEEE
14 years 4 months ago
Peer-to-Peer Keyword Search Using Keyword Relationship
Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither...
Kiyohide Nakauchi, Yuichi Ishikawa, Hiroyuki Morik...
WEBI
2010
Springer
13 years 8 months ago
Using Relational Similarity between Word Pairs for Latent Relational Search on the Web
Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as a...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...
WWW
2010
ACM
14 years 5 months ago
Large-scale bot detection for search engines
In this paper, we propose a semi-supervised learning approach for classifying program (bot) generated web search traffic from that of genuine human users. The work is motivated by...
Hongwen Kang, Kuansan Wang, David Soukal, Fritz Be...
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
14 years 4 months ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
Zhixiang Chen, Bin Fu