Sciweavers

1088 search results - page 75 / 218
» Probabilistic query expansion using query logs
Sort
View
ACL
2006
13 years 11 months ago
Exploring Distributional Similarity Based Models for Query Spelling Correction
A query speller is crucial to search engine in improving web search relevance. This paper describes novel methods for use of distributional similarity estimated from query logs in...
Mu Li, Muhua Zhu, Yang Zhang, Ming Zhou
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 10 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
VLDB
2005
ACM
110views Database» more  VLDB 2005»
14 years 3 months ago
U-DBMS: A Database System for Managing Constantly-Evolving Data
In many systems, sensors are used to acquire information from external environments such as temperature, pressure and locations. Due to continuous changes in these values, and lim...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar
WWW
2006
ACM
14 years 11 months ago
Time-dependent semantic similarity measure of queries using historical click-through data
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of clickthrough data logged by Web search engines, which record the...
Qiankun Zhao, Steven C. H. Hoi, Tie-Yan Liu, Soura...
IJCAI
2007
13 years 11 months ago
An Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
Chandrasekar Ramachandran, Thanukrishnan Srinivasa...