Sciweavers

1286 search results - page 144 / 258
» A General Framework for Searching in Distributed Data Reposi...
Sort
View
CIKM
2006
Springer
13 years 12 months ago
A probabilistic relevance propagation model for hypertext retrieval
A major challenge in developing models for hypertext retrieval is to effectively combine content information with the link structure available in hypertext collections. Although s...
Azadeh Shakery, ChengXiang Zhai
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
13 years 11 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...
WWW
2009
ACM
14 years 8 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 8 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
WWW
2010
ACM
14 years 3 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He