Graph Metric Learning Via Gershgorin Disc Alignment

This video program is a part of the Premium package:

Graph Metric Learning Via Gershgorin Disc Alignment


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Graph Metric Learning Via Gershgorin Disc Alignment

4 views
  • Share
Create Account or Sign In to post comments
We propose a fast general projection-free metric learning framework, where the minimization objective $min_{M in cS} Q(M)$ is a convex differentiable function of the metric matrix $M$, and $M$ resides in the set $cS$ of generalized graph Laplacian
We propose a fast general projection-free metric learning framework, where the minimization objective $min_{M in cS} Q(M)$ is a convex differentiable function of the metric matrix $M$, and $M$ resides in the set $cS$ of generalized graph Laplacian