Coresets for Vector Summarization with Applications to Network Graphs

Dan Feldman, Sedat Ozer, Daniela Rus

We provide a deterministic data summarization algorithm that approximates the mean $\bar{p}=\frac{1}{n}{\sum }_{p\in P}p$ of a set $P$ of $n$ vectors in $\REAL^d$, by a weighted mean…