arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.02200math.COmath.STstat.TH
收藏

基于排名的链接 I:三元组比较与定向单纯复形

Rank-based linkage I: triplet comparisons and oriented simplicial complexes

National Security Agency(国家安全局);Tutte Institute for Mathematics and Computing(图特数学与计算研究所)

R. W. R. Darling, Will Grilliette, Adam Logan

AI总结:

本文提出基于排名的链接方法,通过三元组比较和定向单纯复形对对象关系进行总结,构建了基于排名系统的边加权链接图,并探讨了其在聚类分析中的应用。

摘要:

基于排名的链接是一种新的工具,用于根据对象间的关系总结对象集合S。这些对象不映射为向量,'相似性'之间不需要是数值或对称的。所有对象只需通过比较器对附近对象进行排名,该比较器是传递的,但不一定与整个集合上的度量一致。称为S上的排名系统。基于排名系统应用K-最近邻有向图。计算发生在二维抽象定向单纯复形上,其面是点、边和三角形的线图中的元素。在|S|K²步内构建边加权链接图(S, L, σ),其中σ({x, y})称为对象x和y之间的内摇。令L_t为内摇至少为t的链接,对(S, L_t)图进行分割,对于变化的t。基于排名的链接是从“出序”有向图到分区集的范畴的函子,其实际后果是通过保持排名的方式扩展对象集可以得到新的聚类,不会破坏之前的聚类。对于度量空间中的单链接聚类也具有相同的效果,但不适用于典型的优化方法。定向sheaves在其中起根本作用,确保部分重叠的数据集可以被“粘合”在一起。最后一节提出了开放的组合问题。

英文摘要:

Rank-based linkage is a new tool for summarizing a collection $S$ of objects according to their relationships. These objects are not mapped to vectors, and ``similarity'' between objects need be neither numerical nor symmetrical. All an object needs to do is rank nearby objects by similarity to itself, using a Comparator which is transitive, but need not be consistent with any metric on the whole set. Call this a ranking system on $S$. Rank-based linkage is applied to the $K$-nearest neighbor digraph derived from a ranking system. Computations occur on a 2-dimensional abstract oriented simplicial complex whose faces are among the points, edges, and triangles of the line graph of the undirected $K$-nearest neighbor graph on $S$. In $|S| K^2$ steps it builds an edge-weighted linkage graph $(S, \mathcal{L}, σ)$ where $σ(\{x, y\})$ is called the in-sway between objects $x$ and $y$. Take $\mathcal{L}_t$ to be the links whose in-sway is at least $t$, and partition $S$ into components of the graph $(S, \mathcal{L}_t)$, for varying $t$. Rank-based linkage is a functor from a category of ``out-ordered'' digraphs to a category of partitioned sets, with the practical consequence that augmenting the set of objects in a rank-respectful way gives a fresh clustering which does not ``rip apart'' the previous one. The same holds for single linkage clustering in the metric space context, but not for typical optimization-based methods. Orientation sheaves play in a fundamental role and ensure that partially overlapping data sets can be ``glued'' together. Open combinatorial problems are presented in the last section.

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

↑