NDLI: High-Dimensional Nearest Neighbor Search with Remote Data Centers

Content Provider	Springer Nature Link
Author	Wang, Changzhou Wang, Xiaoyang Sean
Copyright Year	2002
Abstract	Many data centers have archived a tremendous amount of data and begun to publish them on the Web. Due to limited resources and large amount of service requests, data centers usually do not directly support high-cost queries. On the other hand, users are often overwhelmed by the huge data volume and cannot afford to download the whole data sets and search them locally. To support high-dimensional nearest neighbor searches in this environment, the paper develops a multi-level approximation scheme. The coarsest-level approximations are stored locally and searched first. The result is then refined gradually via accesses to remote data centers. Data centers need only to deliver data items or their precomputed finer level approximations by their identifiers.The searching process is usually long in this environment, since it involves remote sites. This paper describes an online search process: the system periodically reports a data item and a positive integer M. The reported item is guaranteed to be one of the M nearest neighbors of the query one. The paper proposes two algorithms to minimize M in each period. Experiments show that one of them performs similarly as a theoretical a posteriori algorithm and significantly outperforms the online extensions of two state-of-the-art nearest neighbor search methods.
Starting Page	440
Ending Page	465
Page Count	26
File Format	PDF
ISSN	02191377
Journal	Knowledge and Information Systems
Volume Number	4
Issue Number	4
Language	English
Publisher	Springer-Verlag London Limited
Publisher Date	2002-09-27
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Information Systems Human-Computer Interaction Hardware and Architecture Software

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

A new approach for maximizing bichromatic reverse nearest neighbor search

Effectiveness of NAQ-tree in handling reverse nearest-neighbor queries in high-dimensional metric space

Hubness-aware shared neighbor distances for high-dimensional $$k$$ -nearest neighbor classification

High-dimensional clustering: a clique-based hypergraph partitioning framework

Effective optimizations of cluster-based nearest neighbor search in high-dimensional space

Query-Sensitive Similarity Measures for Information Retrieval

Composite Distance Transformation for Indexing and k-Nearest-Neighbor Searching in High-Dimensional Spaces

Classifying imbalanced data in distance-based feature space

Indexing expensive functions for efficient multi-dimensional similarity search

High-Dimensional Nearest Neighbor Search with Remote Data Centers

Similar Documents

A new approach for maximizing bichromatic reverse nearest neighbor search

Effectiveness of NAQ-tree in handling reverse nearest-neighbor queries in high-dimensional metric space

Hubness-aware shared neighbor distances for high-dimensional $$k$$ -nearest neighbor classification

High-dimensional clustering: a clique-based hypergraph partitioning framework

Effective optimizations of cluster-based nearest neighbor search in high-dimensional space

Query-Sensitive Similarity Measures for Information Retrieval

Composite Distance Transformation for Indexing and k-Nearest-Neighbor Searching in High-Dimensional Spaces

Classifying imbalanced data in distance-based feature space

Indexing expensive functions for efficient multi-dimensional similarity search

High-Dimensional Nearest Neighbor Search with Remote Data Centers