Font Size:
Improving KD-Tree Based Retrieval for Attribute Dependent Generalized Cases
Last modified: 2009-03-23
Abstract
Generalized cases are cases that cover a subspace rather than a point in the problem-solution space. Attribute dependent generalized cases are a subclass of generalized cases, which cause a high computational complexity during similarity assessment. We present a new approach for an efficient index-based retrieval of such generalized cases by an improved kd-tree approach. The experimental evaluation demonstrates a significant improvement in retrieval efficiency compared to previous methods.
Full Text:
PDF