NDLI: Regression analysis for Rival Penalized Competitive Learning Binary Tree

Content Provider	IEEE Xplore Digital Library
Author	Xue Qun Li King, I.
Copyright Year	2000
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong, Shatin, China (Xue Qun Li)
Abstract	The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penalized Competitive Learning Binary Tree (RPCL-b-tree). RPCL-b-tree is a hierarchical indexing structure built with a hierarchical RPCL clustering implementation, which transforms the feature space into a sequence of nested clusters. Based on the RPCL-b-tree, the efficient Nearest-Neighbor search for a query can be performed with the branch-and-bound algorithm. The index efficiency of a RPCL-b-tree relates to a set of parameters: leaf node size of the tree, number of retrieved objects per search, feature dimensionality and database size. To formulate this relationship, we develop a nonlinear regression model in this paper. This regression model includes two components. One is used to describe the relationship between index efficiency and the number of retrieved objects per search; another is to describe the relationship between index efficiency and leaf node size of a RPCL-b-tree. In both of these two components, we consider the influence from the database size and the feature dimensionality. Our experimental results show that the proposed regression model has a high convergibility and high generalization ability. Moreover, this regression model is explainable on its coefficients, whose values directly reflect the index efficiency of a RPCL-b-tree. Depending on the regression model and its estimated coefficients, we can easily analyze the index efficiency of a RPCL-b-tree to be built. Because the parameters of the different kinds of indexing structures are very similar, this model also is suitable to analyze the other kinds of indexing structures. Thus, it is a powerful tool to construct the optimal RPCL-b-tree or other kinds of indexing structures for a database.
Starting Page	290
Ending Page	295
File Size	508413
Page Count	6
File Format	PDF
ISBN	0769506194
ISSN	10987576
DOI	10.1109/IJCNN.2000.859411
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-07-27
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Regression analysis Binary trees Indexing Information retrieval Spatial databases Nearest neighbor searches Indexes Deductive databases Clustering algorithms Computer science
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

Learning integrated online indexing for image databases

ClusterTree: integration of cluster representation and nearest neighbor search for image databases

Nearest neighbor search for relevance feedback

Rival penalized competitive learning for content-based indexing (1998).

Non-Hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval (1999)

Research for the nearest neighbor query based on $R^{BRT}$ tree

Improved deletions in dynamic spatial approximation trees

Performance analysis of AB-tree

Group nearest neighbor queries

Regression analysis for Rival Penalized Competitive Learning Binary Tree

Similar Documents

Learning integrated online indexing for image databases

ClusterTree: integration of cluster representation and nearest neighbor search for image databases

Nearest neighbor search for relevance feedback

Rival penalized competitive learning for content-based indexing (1998).

Non-Hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval (1999)

Research for the nearest neighbor query based on $R^{BRT}$ tree

Improved deletions in dynamic spatial approximation trees

Performance analysis of AB-tree

Group nearest neighbor queries

Regression analysis for Rival Penalized Competitive Learning Binary Tree