CIKM
2008
Springer
13 years 6 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Web textual advertising can be interpreted as a search problem over the corpus of ads available for display in a particular context. In contrast to conventional information retrie...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Statistical topic models provide a general data-driven framework for automated discovery of high-level knowledge from large collections of text documents. While topic models can p...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...