| 
|
QuoteRef: bohmC9_2001
topics >
all references >
ThesaHelp:
ACM references a-e
ThesaHelp:
references a-b
Topic:
information retrieval by relevance
Topic:
problem of classifying information
Topic:
geometry
Topic:
full-text indexing
Reference
Bohm, C., Berchtold, S., Keim, D.A., "Searching in high-dimensional spaces--Index structures for improving the performance of multimedia databases", ACM Computing Surveys, 33, 3, September 2001, pp. 322-373. Google
abstract ;;Quote: survey on querying multimedia databases; similarity search via feature transformation into a high dimensional space
325 ;;Quote: curse of dimensionality; space behaves differently above 10-d; volume and area depend exponentially on dimension
326 ;;Quote: in higher dimensions, most of the volume of a cube is near its surface; volume grows exponentially with dimension
326 ;;Quote: an index partition in high-dimensional space spans most of the space in most dimensions, from border to border; coarse partitioning
326 ;;Quote: reasonably selective range and nearest-neighbor queries have a huge extension in each dimension
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references a-b (396 items)
Topic: information retrieval by relevance (32 items)
Topic: problem of classifying information (41 items)
Topic: geometry (33 items)
Topic: full-text indexing (35 items)