Sciweavers

403 search results - page 60 / 81
» A search for positive storage functions
Sort
View
SIGIR
2010
ACM
15 years 2 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
106
Voted
CIKM
2010
Springer
15 years 12 days ago
Reverted indexing for feedback and expansion
Traditional interactive information retrieval systems function by creating inverted lists, or term indexes. For every term in the vocabulary, a list is created that contains the d...
Jeremy Pickens, Matthew Cooper, Gene Golovchinsky
WWW
2008
ACM
16 years 2 months ago
Model bloggers' interests based on forgetting mechanism
Blogs have been expanded at an incredible speed in recent years. Plentiful personal information makes blogs a popular way mining user profiles. In this paper, we propose a novel b...
Yuan Cheng, Guang Qiu, Jiajun Bu, Kangmiao Liu, Ye...
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
16 years 2 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
SAC
2009
ACM
15 years 8 months ago
Automatic discovery of technology trends from patent text
Patent text is a rich source to discover technological progresses, useful to understand the trend and forecast upcoming advances. For the importance in mind, several researchers h...
Youngho Kim, Yingshi Tian, Yoonjae Jeong, Jihee Ry...