1756 search results - page 98 / 352 » Mining Query Logs |
102
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
107
click to vote
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
We build a probabilistic model to identify implicit local intent queries, and leverage user’s physical location to improve Web search results for these queries. Evaluation on co...
126
Voted
WWW
2011
ACM
14 years 7 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
96
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
111
click to vote
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...