Sciweavers

623 search results - page 3 / 125
» Text Retrieval by Using k-word Proximity Search
Sort
View
SPIRE
2005
Springer
13 years 11 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
CIKM
2008
Springer
13 years 7 months ago
Passage relevance models for genomics search
We present a passage relevance model for integrating syntactic and semantic evidence of biomedical concepts and topics using a probabilistic graphical model. Component models of t...
Jay Urbain, Ophir Frieder, Nazli Goharian
WWW
2008
ACM
14 years 6 months ago
Investigation of partial query proximity in web search
Proximity of query terms in a document is an important criterion in IR. However, no investigation has been made to determine the most useful term sequences for which proximity sho...
Jing Bai, Yi Chang, Hang Cui, Zhaohui Zheng, Gordo...
WWW
2007
ACM
14 years 6 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
VLDB
1998
ACM
144views Database» more  VLDB 1998»
13 years 10 months ago
Proximity Search in Databases
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas...