Published Articles >> Table of Contents >> Abstract

2001 IEEE International Conference on Multimedia and Expo (ICME'01)   p. 303
Clustered SS-Tree
Sakti Pramanik, Department of Computer Science Michigan State University
Jinhua Li, Department of Computer Science Michigan State University

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICME.2001.1237942
Send link to a friend

Abstract
We present an efficient indexing method called clustered SS-tree for high dimensional database for approximate nearest neighbor queries. The main idea of this approach is to cluster data before creating the index and then apply filtering of index nodes based on angle property in high dimension for efficient searching for clustered SS-tree provides several orders of magnitude better performance than exact nearest neighbor search of SS-tree and VA file.
Back to Top Additional Information
Citation:  Sakti Pramanik, Jinhua Li, "Clustered SS-Tree," icme, p. 303,  2001 IEEE International Conference on Multimedia and Expo (ICME'01),  2001