Exploiting the structure of furthest neighbor search for fast approximate results
Authors:
- 1 February 2019
- journal article
- conference paper
- Published by Elsevier in Information Systems
- Vol. 80, 124-135
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Dual‐tree fast exact max‐kernel searchStatistical Analysis and Data Mining: An ASA Data Science Journal, 2014
- The Role of Hubness in Clustering High-Dimensional DataIEEE Transactions on Knowledge and Data Engineering, 2013
- Hubness-aware shared neighbor distances for high-dimensional $k$ -nearest neighbor classificationKnowledge and Information Systems, 2013
- The Fifth ACM International Conference on Web Search and Data Mining (WSDM 2012)ACM SIGWEB Newsletter, 2012
- Introducing mothur: Open-Source, Platform-Independent, Community-Supported Software for Describing and Comparing Microbial CommunitiesApplied and Environmental Microbiology, 2009
- Computing farthest neighbors on a convex polytopeTheoretical Computer Science, 2003
- A maximum variance cluster algorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- An efficient algorithm for a complete link methodThe Computer Journal, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975