A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Proximity Graph Maintenance for Fast Online Nearest Neighbor Search
[article]
2022
arXiv
pre-print
Preserved Fulltext
Approximate Nearest Neighbor (ANN) search is a fundamental technique for (e.g.,) the deployment of recommender systems. ...
To tackle the challenge, we propose an incremental proximity graph maintenance (IPGM) algorithm for online ANN. IPGM supports both vertex deletion and insertion on proximity graphs. ...
This paper presents a proximity graph maintenance algorithm for online ANN search. ...
arXiv:2206.10839v1
fatcat:lr54xpgz65a5jh47padl35ptaq
LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose LANNS, an end-to-end platform for Approximate Nearest Neighbor Search, which scales for web-scale datasets. ...
Library for Large Scale Approximate Nearest Neighbor Search (LANNS) is deployed in multiple production systems for identifying topK (100 ≤ topK ≤ 200) approximate nearest neighbors with a latency of a ...
ACKNOWLEDGMENTS We thank Liang Zhang for helping us get this project off ground. ...
arXiv:2010.09426v1
fatcat:36tf5775q5dxpdpuez2omdzjlu
Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph
2009
2009 Second International Workshop on Similarity Search and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Retrieving the k-nearest neighbors of a query object is a basic primitive in similarity searching. ...
Then, we show how to use our approximate k-nearest neighbor queries to construct (an approximation of) the k-nearest neighbor graph when we have a fixed dataset. ...
Thus, the ultimate goal is to build offline an index in order to speed up online queries. 2) k-Nearest neighbors: Due to its importance in several application fields, the literature on kNN searching is ...
doi:10.1109/sisap.2009.33
dblp:conf/sisap/FigueroaP09
fatcat:wieiyzyfdngdlarrn5rg2bjv6m
Case-Based Reasoning Using The Nearest Neighbor Method For Detection Of Equipment Damage To PLN Power Plant
2020
IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Furthermore, the test results of the equipment damage detection test data at the PLN plant with a threshold value of 0.75 using the nearest neighbor, the system has a performance with a 95% sensitivity ...
According to an expert or PdM owner that maintenance analysis is not appropriate and efficiency has an impact on maintenance costs that are not small. ...
Case-Based Reasoning Using The Nearest Neighbor Method For... (Riska Amalia Praptiwi) 379
Case-Based Reasoning Using The Nearest Neighbor Method For... ...
doi:10.22146/ijccs.57434
fatcat:5ydl6qsoobevzke5w22zkcrnmi
Natural Variability
[chapter]
2017
Encyclopedia of GIS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
SESSION: Research sessions: spatial data, pp 695-706 Chavez E, Figueroa K, et al: A fast algorithm for the all k nearest neighbors problem in general metric spaces Google. ...
The first NN algorithm for R-trees (Roussopoulos et al. 1995) , named depth-first search (DFS), recursively visits index nodes to search for nearest neighbor candidates. ...
For example, the Google Earth online mapping application is supported by thousands to millions of computers (or CPUs). ...
doi:10.1007/978-3-319-17885-1_101534
fatcat:aj3jjedtq5ezbpoakmsuxw7pba
2018 Index IEEE Transactions on Knowledge and Data Engineering Vol. 30
2019
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
., þ, TKDE Sept. 2018 1741-1755 Reverse Approximate Nearest Neighbor Queries. ...
., þ, TKDE Aug. 2018 1602-1615 Information technology Reverse Approximate Nearest Neighbor Queries. ...
doi:10.1109/tkde.2018.2882359
fatcat:asiids266jagrkx5eac6higrlq
Online Clustering Algorithms for Semantic-Rich Network Trajectories
2011
Journal of Computing Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This type of computing also provides motivation for online mining of trajectory data, to fit user-specific preferences or context (e.g., time of the day). ...
In clear contrast, we study an efficient clustering algorithm for Boolean + Clustering queries using a pre-materialized and summarized data structure. ...
This problem can be abstracted as a graph problem, by denoting each trajectory as a node connected to another node that is the nearest neighbor. ...
doi:10.5626/jcse.2011.5.4.346
fatcat:qyytulr3xnhvpnovtsjgjxk3um
CLODA: A Crowdsourced Linked Open Data Architecture
2013
2013 IEEE 14th International Conference on Mobile Data Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
a blend of in-house technologies, particularly our indoor positioning framework, coined Airplace, our trajectory similarity framework, coined SmartTrace, our neighborhood detection framework, coined Proximity ...
startup grant, funded by the University of Cyprus, EU's FP7 Planetdata NoE (2007-2013), the EU's FP7 "Mobility, Data Mining, and Privacy" project and the COST Action IC903 (MOVE) "Knowledge Discovery for ...
The server has the overall picture of the users whereabouts and can compute the k nearest neighbors for each user.
E. ...
doi:10.1109/mdm.2013.76
dblp:conf/mdm/LarkouMCZ13
fatcat:lu5l2iitdjadpo5wxcckrh73dm
Fast geometric learning with symbolic matrices
2020
Neural Information Processing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
nearest neighbor search -with the added benefit of flexibility. ...
We perform an extensive evaluation on a broad class of problems: Gaussian modelling, K-nearest neighbors search, geometric deep learning, non-Euclidean embeddings and optimal transport theory. ...
Exact and approximate nearest neighbor search. ...
dblp:conf/nips/FeydyGCB20
fatcat:nlshkb3bt5hs7otmwf5gkgx6hm
Memory constrained face recognition
2012
2012 IEEE Conference on Computer Vision and Pattern Recognition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We focus on computation of the expected value of information with nearest neighbor classifiers for online face recognition. ...
Real-time recognition may be limited by scarce memory and computing resources for performing classification. ...
Modern approaches have included Modified Condensed Nearest Neighbor (MCNN) [9] , which is order independent, and more recently, Fast Condensed Nearest Neighbor (FCNN) [2] , which takes a similar approach ...
doi:10.1109/cvpr.2012.6247971
dblp:conf/cvpr/KapoorBBH12
fatcat:ndqs23dufrgsrgwgscz3aypbhm
Efficient Sorting and Searching in Rendering Algorithms
[article]
2006
Eurographics State of the Art Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
For each problem we mention its specific issues such as dimensionality of the search domain or online versus offline searching. ...
We will provide both theoretical and empirical evidence that for many rendering techniques most time is spent by sorting and searching. ...
IST-2-004363 (GameTools) and by the Ministry of Education, Youth and Sports of the Czech Republic under the research program LC-06008 (Center for Computer Graphics). ...
doi:10.2312/egt.20061061
fatcat:nhf62nzo2jczbhksy3h7oywrs4
Peer-to-Peer Clustering of Web-browsing Users
2009
Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
For most users, Web-based centralized search engines are the access point to distributed resources such as Web pages, items shared in file sharing-systems, etc. ...
Unfortunately, existing search engines compute their results on the basis of structural information only, e.g., the Web graph structure or query-document similarity estimations. ...
This information are critical to allow fast and fair community creations and maintenance. ...
dblp:conf/sigir/DazziFALM0RR09
fatcat:fs45erz6szfbznsmdyi6lublwa
Joint search by social and spatial proximity
2016
2016 IEEE 32nd International Conference on Data Engineering (ICDE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We develop highly scalable algorithms for its processing, and enhance them with elaborate optimizations. ...
We show how applications like company and friend recommendation could significantly benefit from incorporating social and spatial proximity, and study a query type that captures these two-fold semantics ...
Mohamed Sarwat for providing datasets and suggestions. ...
doi:10.1109/icde.2016.7498434
dblp:conf/icde/MouratidisLTM16
fatcat:gki55isi2zd4naygui6cd52v5a
Alleviating the topology mismatch problem in distributed overlay networks: A survey
2016
Journal of Systems and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Peer-to-peer (P2P) systems have enjoyed immense attention and have been widely deployed on the Internet for well over a decade. ...
Finally, we offer an analysis as well as pictorial comparisons of the reviewed approaches since we aim to offer a comprehensive reference for developers, system architects and researchers in the field. ...
Figure 15 : 15 Proximity neighbor selection dictates that proximity is taken into account during routing table maintenance. ...
doi:10.1016/j.jss.2015.11.038
fatcat:ghyhlwk2e5hl3akiydfnwyctlu
Using geometrical routing for overlay networking in MMOGs
2009
Multimedia tools and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
___________________________________________ At a first glance, transmitting update information to a geographic region in the virtual space seems to be an attractive primitive in Massively Multiplayer Online ...
Fundamentally speaking, update message exchange is mostly based on users' visibility range, which is mainly affected by proximity; i.e., avatars are interested in nodes within a specific distance around ...
One of the main applications of LSH is its fast and efficient nearest neighbor search algorithm. ...
doi:10.1007/s11042-009-0312-x
fatcat:2gcjuoxuajditpmliwpebegyfa
« Previous
Showing results 1 — 15 out of 1,577 results