Computer Science – Information Retrieval
Scientific paper
1999-04-07
Proc. 10-th Int. Workshop on Database and Expert Systems Applications (DEXA'99), Sept. 1-3, 1999, Florence, Italy, IEEE Comp.
Computer Science
Information Retrieval
11 pages, LaTeX 2.e
Scientific paper
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 $\Omega$ (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.
No associations
LandOfFree
A geometric framework for modelling similarity search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A geometric framework for modelling similarity search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A geometric framework for modelling similarity search will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-196565