Sciweavers

912 search results - page 72 / 183
» Inductive Databases as Ranking
Sort
View
CIKM
2009
Springer
15 years 7 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
119
Voted
BMCBI
2004
95views more  BMCBI 2004»
15 years 17 days ago
PCOGR: Phylogenetic COG ranking as an online tool to judge the specificity of COGs with respect to freely definable groups of or
Background: The rapidly increasing number of completely sequenced genomes led to the establishment of the COG-database which, based on sequence homologies, assigns similar protein...
Florian Meereis, Michael Kaufmann
SIGIR
2012
ACM
13 years 3 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
133
Voted
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 3 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
16 years 2 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu