Sciweavers

304 search results - page 21 / 61
» Mining query subtopics from search log data
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
15 years 10 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
15 years 10 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
ACL
2009
14 years 7 months ago
Exploiting Bilingual Information to Improve Web Search
Web search quality can vary widely across languages, even for the same information need. We propose to exploit this variation in quality by learning a ranking function on bilingua...
Wei Gao, John Blitzer, Ming Zhou, Kam-Fai Wong
CLEF
2010
Springer
14 years 10 months ago
SINAI at LogCLEF 2010
The SINAI1 research group presents some results obtained after performing a brief analysis to the query logs from The European Library2 (TEL). The objective of the LogCLEF task is ...
José M. Perea-Ortega, Arturo Montejo R&aacu...
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
15 years 10 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson