Sciweavers

638 search results - page 86 / 128
» Applications of Approximate Word Matching in Information Ret...
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 2 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
NIPS
2008
15 years 1 months ago
Structured ranking learning using cumulative distribution networks
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...
Jim C. Huang, Brendan J. Frey
CIKM
2006
Springer
15 years 3 months ago
Representing documents with named entities for story link detection (SLD)
Several information organization, access, and filtering systems can benefit from different kind of document representations than those used in traditional Information Retrieval (I...
Chirag Shah, W. Bruce Croft, David Jensen
NIPS
2008
15 years 1 months ago
Global Ranking Using Continuous Conditional Random Fields
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
AND
2009
14 years 9 months ago
Accessing the content of Greek historical documents
In this paper, we propose an alternative method for accessing the content of Greek historical documents printed during the 17th and 18th centuries by searching words directly in d...
Anastasios L. Kesidis, Eleni Galiotou, Basilios Ga...