Improving KD-Tree Based Retrieval for Attribute Dependent Generalized Cases

Ralph Bergmann, Alexander Tartakovski · The Florida AI Research Society · 2009

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 indexbased retrieval of such generalized cases by an improved kdtree approach. The experimental evaluation demonstrates a significant improvement in retrieval efficiency compared to previous methods.

Read the paper · More papers on PaperTik