NDLI: A new index structure combines a cluster algorithm with block distance

Content Provider	IEEE Xplore Digital Library
Author	Yang, Lifang Di, Meng Huang, Xianglin Duan, Fengfeng
Copyright Year	2015
Description	Author affiliation: Faculty of Science and Technology, Communication University of China, Beijing, China (Yang, Lifang; Di, Meng; Huang, Xianglin; Duan, Fengfeng)
Abstract	Many index structures for high-dimensional data have become very complex and their complexity may not matched by the increase of performance. Block distance is widely used for similarity measurement, and it is very simple and efficient. The index structures that map the high-dimensional data to single dimension values are relative simple and efficient. But none of these index structures can directly support the use of block distance for similarity search. In this paper, a new simple and yet efficient index structure called CBlockB-Tree is proposed. Our approach uses the cluster algorithm to divide the high-dimensional space into several clusters. And then for each cluster, map the high-dimensional feature data in this cluster to single dimension key values by the block distance between each feature date and its cluster center, and use the compact B+-tree to manage these key values. This index structure can not only directly support the use of block distance for similarity search, but also can effectively support the use of Euclidean distance for similarity search. Moreover, experimental results show that our simple index structure outperforms the NB-Tree and the BlockB-Tree we proposed previously.
Starting Page	520
Ending Page	526
File Size	1813865
Page Count	7
File Format	PDF
e-ISBN	9781467390989
DOI	10.1109/CISP.2015.7407935
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-10-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis cluster high-dimensional Clustering algorithms Euclidean distance index structure Partitioning algorithms dimension reduction CBlockB-Tree Indexing block distance
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

BlockB-Tree: A new index structure combined compact B+-tree with block distance

The PU-Tree: A Partition-Based Uncertain High-Dimensional Indexing Algorithm

A min-max distance based external cluster validity index: MMI

High-dimensional indexing algorithm based on the hyperplane tree-structure

Comparison and analysis of clustering techniques

An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing

A New Fast Minimum Spanning Tree-Based Clustering Technique

A new solution of node splitting to the R Tree algorithm

An Efficient Dimension Reduction and Optimal Cluster Center Initialization Technique

A new index structure combines a cluster algorithm with block distance

Similar Documents

BlockB-Tree: A new index structure combined compact B+-tree with block distance

The PU-Tree: A Partition-Based Uncertain High-Dimensional Indexing Algorithm

A min-max distance based external cluster validity index: MMI

High-dimensional indexing algorithm based on the hyperplane tree-structure

Comparison and analysis of clustering techniques

An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing

A New Fast Minimum Spanning Tree-Based Clustering Technique

A new solution of node splitting to the R Tree algorithm

An Efficient Dimension Reduction and Optimal Cluster Center Initialization Technique

A new index structure combines a cluster algorithm with block distance