Sciweavers

353 search results - page 21 / 71
» Query Expansion Based on Clustered Results
Sort
View
SKG
2005
IEEE
14 years 2 months ago
DLOnto: A Semantic Information Model for Digital Libraries
In this paper, we propose the Semantic Information Model for Digital Libraries - DLOnto based on the theory of the Semantic Web, and give the formalized definition of and relative ...
Ming Zhang, Zhi-Hong Deng, Shukai Ding, Dongqing Y...
SIGIR
2008
ACM
13 years 8 months ago
Analyzing web text association to disambiguate abbreviation in queries
We introduce a statistical model for abbreviation disambiguation in Web search, based on analysis of Web data resources, including anchor text, click log and query log. By combini...
Xing Wei, Fuchun Peng, Benoît Dumoulin
EDBT
2006
ACM
159views Database» more  EDBT 2006»
14 years 8 months ago
Fast Nearest Neighbor Search on Road Networks
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...
Haibo Hu, Dik Lun Lee, Jianliang Xu
CIKM
2005
Springer
14 years 2 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
TREC
2004
13 years 10 months ago
Juru at TREC 2004: Experiments with Prediction of Query Difficulty
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. We developed two prediction alg...
Elad Yom-Tov, Shai Fine, David Carmel, Adam Darlow...