Fitting a graph to vector data

We introduce a measure of how well a combinatorial graph fits a collection of vectors. The optimal graphs under this measure may be computed by solving convex quadratic programs and have many interesting properties. For vectors in d dimensional space, the graphs always have average degree at most 2( d + 1), and for vectors in 2 dimensions they are always planar. We compute these graphs for many standard data sets and show that they can be used to obtain good solutions to classification, regression and clustering problems.

Authors

• Samuel I. Daitch
• Jonathan A. Kelner
• Daniel A. Spielman

Keywords

No keywords are indexed for this paper.