2100 search results - page 317 / 420 » Learning to rank on graphs |
202
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...
185
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
175
click to vote
AMAI
2004
Springer
15 years 12 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
157
click to vote
AIPS
2008
15 years 8 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
194
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Document summarization plays an increasingly important role with the exponential growth of documents on the Web. Many supervised and unsupervised approaches have been proposed to ...