142 search results - page 5 / 29 » Using Relational Similarity between Word Pairs for Latent Re... |
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
We describe a method for finding ungapped conserved words in rRNA sequences that is effective, utilizes evolutionary information and does not depend on multiple sequence alignment...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We investigate the idea of finding semantically related search engine queries based on their temporal correlation; in other words, we infer that two queries are related if their p...
ACMICEC
2007
ACM
13 years 11 months ago
2007
ACM
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...
EWMF
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We show that eigenvector decomposition can be used to extract a term taxonomy from a given collection of text documents. So far, methods based on eigenvector decompositio...
CLEF
2010
Springer
13 years 8 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...