Sciweavers

540 search results - page 23 / 108
» Ranking with Uncertain Scores
Sort
View
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
15 years 4 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
16 years 1 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
CORR
2007
Springer
85views Education» more  CORR 2007»
14 years 11 months ago
Maximizing PageRank via outlinks
We analyze linkage strategies for a set I of webpages for which the webmaster wants to maximize the sum of Google’s PageRank scores. The webmaster can only choose the hyperlinks...
Cristobald de Kerchove, Laure Ninove, Paul Van Doo...
CIKM
2009
Springer
15 years 3 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
NIPS
2008
15 years 1 months ago
Structured ranking learning using cumulative distribution networks
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...
Jim C. Huang, Brendan J. Frey