Abstract
The optimum compatibility of search strategies in multidimensional databanks is investigated, where the optimality of some ``natural'' search strategies, for example, those based on some desired property values, on the one hand, and those based on similarity evaluations with respect to some individual ``lead'' entry, on the other hand, show different dependences on the dimension of the search in the space of the descriptors. The advantages of modifying these strategies to make them more compatible with one another in a dimension-dependent way is discussed, and a volume-constrained hypersphere- hypercube combination is explored if a switch of strategy might become desirable.
Keywords
Get full access to this article
View all access options for this article.
