116 citations · 626 across the 37 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.AI2009★ 2 cited
Elkan's k-Means for Graphs
Brijnesh J. Jain, Klaus Obermayer
This paper extends k-means algorithms from the Euclidean domain to the domain of graphs. To recompute the centroids, we apply subgradient methods for solving the optimization-based…
cs.AI2009
A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem
Brijnesh Jain, Klaus Obermayer
This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived a…
stat.ML2009
The Optimal Unbiased Value Estimator and its Relation to LSTD, TD and MC
Steffen Grünewälder, Klaus Obermayer
In this analytical study we derive the optimal unbiased value estimator (MVU) and compare its statistical risk to three well known value estimators: Temporal Difference learning (T…