arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9904002cs.IRcs.DBcs.DS
收藏

相似性搜索建模的几何框架

A geometric framework for modelling similarity search

Vladimir Pestov

摘要:

本文的目的是提出一个几何框架,在大型和多维数据空间的一般性质,这似乎是足够灵活,以解决诸如分析的复杂性,可索引性,和`灾难的维度相似性搜索建模。这种框架由所谓的相似性工作负载的概念提供,其是具有区别有限子空间$X$(数据集)的概率度量空间$Ω$(查询域),以及概念、技术和来自度量几何的结果的集合。它们包括度量变换、$\e$ -熵和高维结构上的测度集中现象等概念。特别是,我们讨论了后者的相关性,以了解灾难的维度。由于数据库社区目前正在重新发明其中的一些概念和技术,因此似乎有必要尝试弥合数据库研究与几何和分析领域已经完成的相关工作之间的差距。

英文摘要:

The aim of this paper is to propose a geometric framework for modelling similarity search in large and multidimensional data spaces of general nature, which seems to be flexible enough to address such issues as analysis of complexity, indexability, and the `curse of dimensionality.' Such a framework is provided by the concept of the so-called similarity workload, which is a probability metric space $Ω$ (query domain) with a distinguished finite subspace $X$ (dataset), together with an assembly of concepts, techniques, and results from metric geometry. They include such notions as metric transform, $\e$-entropy, and the phenomenon of concentration of measure on high-dimensional structures. In particular, we discuss the relevance of the latter to understanding the curse of dimensionality. As some of those concepts and techniques are being currently reinvented by the database community, it seems desirable to try and bridge the gap between database research and the relevant work already done in geometry and analysis.

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

↑