Sciweavers

144 search results - page 17 / 29
» Query dependent ranking using K-nearest neighbor
Sort
View
CIKM
2010
Springer
13 years 5 months ago
Modeling reformulation using passage analysis
Query reformulation modifies the original query with the aim of better matching the vocabulary of the relevant documents, and consequently improving ranking effectiveness. Previou...
Xiaobing Xue, W. Bruce Croft, David A. Smith
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
14 years 2 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
WWW
2005
ACM
14 years 8 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
TACAS
2004
Springer
135views Algorithms» more  TACAS 2004»
14 years 29 days ago
Liveness with Incomprehensible Ranking
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
14 years 5 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft