arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.11096stat.MLcs.LGmath.FA
收藏

用凸聚类恢复树

Recovering Trees with Convex Clustering

North Carolina State University(北卡罗来纳州立大学);Yale University(耶鲁大学)

Eric C. Chi, Stefan Steinerberger

摘要:

对于给定的$\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^p$,凸聚类是指\begin{eqnarray*} u(γ) & = & \underset{u_1, \dots, u_n }{\arg\min}\;\sum_{i=1}^{n}{\lVert x_i - u_i \rVert^2} + γ\sum_{i,j=1}^{n}{w_{ij} \lVert u_i - u_j\rVert},\\ \end{eqnarray*}的最小化,其中$w_{ij} \geq 0$是量化$x_i$和$x_j$之间的相似性的亲和力。我们证明了,如果仿射$w_{ij}$反映了树结构的$\left\{x_1, \dots, x_n\right\}$,那么凸聚类解决方案的路径重建树。主要技术成分意味着以下组合副产品:对于$n \geq 2$不同点的每个集合$\left\{x_1, \dots, x_n \right\} \subset \mathbb{R}^p$,存在至少$n/6$点,其具有以下性质:对于这些点$x$中的任何一个,存在单位向量$v \in \mathbb{R}^p$,使得当从$x$观察时,“大多数”点位于方向$v$ \begin{eqnarray*} \frac{1}{n-1}\sum_{i=1 \atop x_i \neq x}^{n}{ \left\langle \frac{x_i - x}{\lVert x_i - x \rVert}, v \right\rangle} & \geq & \frac{1}{4}. \end{eqnarray*}上

英文摘要:

Convex clustering refers, for given $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^p$, to the minimization of \begin{eqnarray*} u(γ) & = & \underset{u_1, \dots, u_n }{\arg\min}\;\sum_{i=1}^{n}{\lVert x_i - u_i \rVert^2} + γ\sum_{i,j=1}^{n}{w_{ij} \lVert u_i - u_j\rVert},\\ \end{eqnarray*} where $w_{ij} \geq 0$ is an affinity that quantifies the similarity between $x_i$ and $x_j$. We prove that if the affinities $w_{ij}$ reflect a tree structure in the $\left\{x_1, \dots, x_n\right\}$, then the convex clustering solution path reconstructs the tree exactly. The main technical ingredient implies the following combinatorial byproduct: for every set $\left\{x_1, \dots, x_n \right\} \subset \mathbb{R}^p$ of $n \geq 2$ distinct points, there exist at least $n/6$ points with the property that for any of these points $x$ there is a unit vector $v \in \mathbb{R}^p$ such that, when viewed from $x$, `most' points lie in the direction $v$ \begin{eqnarray*} \frac{1}{n-1}\sum_{i=1 \atop x_i \neq x}^{n}{ \left\langle \frac{x_i - x}{\lVert x_i - x \rVert}, v \right\rangle} & \geq & \frac{1}{4}. \end{eqnarray*}

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑