Abstract:

This paper modifies the traditional fuzzy c-means(FCM),and gives a analysis of high-dimensional indexing structure.combining the modified FCM to tree-like indexing structure,this paper introduce a novel dynamic high-dimensional indexing structure based on metric space,called HC-Tree.The insertion methods of HC-Tree make the tree balance and dynamic.We give a method to determine whether a node reach the qualification of splitting operation.Then we give the methods of nodes splitting strategy,which make the nodes of HC-Tree are much more compact,uniform and symmetrical,and then make much less overlaps.We implement the K-NN queries and Range queries.The experimental results show that the HC-Tree outperforms the M-Tree and Slim-Tree with more efficient retrieval and browsing.

Key words: computer application, metric space, dynamic, high-dimensional indexing