2695 search results - page 93 / 539 » Learning Graph Matching |
134
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
147
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
125
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
156
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
152
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Virtually all currently available microRNA target site prediction algorithms require the presence of a (conserved) seed match to the 5' end of the microRNA. Recen...