1658 search results - page 19 / 332 » Learning Unknown Graphs |
126
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
We consider learning in a Markov decision process where we are not explicitly given a reward function, but where instead we can observe an expert demonstrating the task that we wa...
87
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
102
Voted
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
118
Voted
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
121
click to vote
NIPS
2004
15 years 3 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...