385 search results - page 9 / 77 » Probabilistic ranking over relations |
160
Voted
ILP
1999
Springer
15 years 8 months ago
1999
Springer
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
146
Voted
IDA
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
127
Voted
IMCSIT
2010
15 years 1 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
140
Voted
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
146
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to o...