In most practical applications of image retrieval, high-dimensional feature vectors are required, but current multi-dimensional indexing structures lose their efficiency with growth of dimensions. Our goal is to propose a divisive hierarchical clustering-based multi-dimensional indexing structure which is efficient in high-dimensional feature spaces. A projection pursuit method has been used for finding a component of the data, which data's projections onto it maximizes the approximation of negentropy for preparing essential information in order to partitioning of the data space. Various tests and experimental results on high-dimensional datasets indicate the performance of proposed method in comparison with others.
Reductive Clustering: An Efficient Linear-time Graph-based Divisive Cluster Analysis Approach
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Nanyang Technological University(南洋理工大学);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Shandong University(山东大学)
GEM: A Native Graph-based Index for Multi-Vector Retrieval
The Hong Kong University of \;Hong Kong Generative AI Research \& Development Center Hong Kong China;The Hong Kong University of Science;Hong Kong Generative AI Research \& Development Center