The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-organizing maps (SOMs) provide mapping ...

The SOM-based R*-tree combines a Self-organizing Map. (SOM) [23,44] and an R*-tree [3] to achieve search perfor- mance more scalable to high dimensionalities.

The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-organizing maps (SOMs) provide mapping ...

In this paper, we propose a SOM-based R*-tree(SBR-Tree) as a new indexing method for high-dimensional feature vectors. The SBR-Ttree combines SOM and R*-tree to ...

A SOM-based R*-tree is proposed as a new indexing method for high-dimensional feature vectors and the retrieval time cost is compared to that of an SOM and ...

The SOM-based R*-Tree combines SOM and R*-Tree to achieve search performance more scalable to high-dimensionalities. Self-Organizing Maps (SOMs) provide mapping ...

The SOM-based R-tree combines SOM and R tree to achieve search performance more scalable to highdimensionalities.

The SOM-based R*-tree combines SOM and R*-tree to achieve search performance more scalable to high dimensionalities. Self-organizing maps (SOMs) provide mapping ...

The result show that the SOM-based R*-tree outperforms both the SOM and R*-tree due to the reduction of the number of nodes required to build R*-tree and ...

Contents. DASFAA '01: Proceedings of the 7th International Conference on Database Systems for Advanced Applications. SOM-Based R*-tree for Similarity Retrieval.