Sciweavers

4553 search results - page 47 / 911
» Distributed Ranked Search
Sort
View
CIKM
2009
Springer
14 years 2 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
SEMWEB
2009
Springer
14 years 2 months ago
Using Naming Authority to Rank Data and Ontologies for Web Search
Abstract. The focus of web search is moving away from returning relevant documents towards returning structured data as results to user queries. A vital part in the architecture of...
Andreas Harth, Sheila Kinsella, Stefan Decker
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
13 years 9 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
CIKM
2008
Springer
13 years 10 months ago
CE2: towards a large scale hybrid search engine with integrated ranking support
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
Haofen Wang, Thanh Tran, Chang Liu
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
13 years 8 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...