Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 1495 for “"Nearest neighbor"”.
-
Differential Privacy for Nearest Neighbor Queries
… problem of providing differential privacy for nearest neighbor queries. Very few mechanisms exist that achieve this, most notable geo-indistinguishability in the context of location privacy. However it uses an extended definition of differential privacy and restricts the sensitivity of queries. …
-
Approximate Nearest Neighbor Search with Filters
Approximate nearest neighbor search (ANNS) on high-dimensional vectors is a fundamental primitive used widely for search over neural embeddings of unstructured data. Prior work on ANNS has produced indices which provide fast and accurate search on datasets up to billions of points, but are not well …
-
Two new nearest neighbor classification rules
Nearest Neighbor (NN) classification is a non-parametric discrimination and classification technique. In NN classification a test item is compared by some similarity measure of its multiple variables (usually a distance metric) with all the items in a training set. The class of the item to which it …
-
Searching nearest neighbor in high dimensional space
Searching nearest neighbor in high dimensional space is an interesting and complex problem in computer science. As the dimension increases, the complexity to find the nearest neighbor also increases. In one dimension we can find the nearest point very efficiently. But when the dimension increases, …
-
Scalable Nearest Neighbor Search with Compact Codes
… primitive for analyzing large datasets is the Nearest Neighbor Search problem in which the goal is to preprocess a set of objects, so that later, given a query object, one can find the data object closest to the query. In most situations involving high-dimensional objects, the exhaustive search …
-
Algorithms for Constructing Exact Nearest Neighbor Graphs
Nearest neighbor graphs (NNGs) contain the set of closest neighbors, and their similarities, for each of the objects in a set of objects. They are widely used in many real-world applications, such as clustering, online advertising, recommender systems, data cleaning, and query refinement. A …
-
New paradigms for approximate nearest-neighbor search
Nearest-neighbor search is a very natural and universal problem in computer science. Often times, the problem size necessitates approximation. In this thesis, I present new paradigms for nearest-neighbor search (along with new algorithms and theory in these paradigms) that make nearest-neighbor …
-
Preserving nearest neighbor consistency in cluster analysis
<p>The two main streams in finding cluster structure from data could be to identify the number of natural clusters and, of course, to group the objects in a reasonable way. In order to achieve good results for these two, measuring goodness of clustering is required prior to beginning any related …
-
Content-based Information Retrieval via Nearest Neighbor Search
… the stored information in the database through nearest neighbor search. Finally, the system will return the most similar items. We contribute to the CBIR research the following: firstly, Distance Metric Learning (DML) is studied to improve retrieval accuracy of nearest neighbor search. …
-
Linear Nearest Neighbor Flocks With All Distinct Agents
… dynamics of 1-dimensional agent arrays with nearest neighbor linear couplings. The equations of motion are second order linear ODE's with constant coefficients. The novel part of this research is that the couplings are different for each agent. We allow the forces to depend on the relative …
-
Near Memory Accelerators for Approximate Nearest Neighbor Search
Approximate Nearest Neighbor (ANN) search has become a critical component in modern retrieval systems, supporting applications such as recommendation engines, semantic search, and large language models. Despite the effectiveness of embedding-based methods, performing ANN search over billion-scale, …
-
On the risk of the nearest neighbor rules
… approach using Laplace's method. Finally nearest neighbor distances are treated again for unbounded support.
-
Rozpoznávání ručně psaných číslic metodou K-nearest neighbor
Tato práce se zabývá problematikou rozpoznávání ručně psaných číslic. Rozebírá problémy při řešení rozpoznávání metodou K-nejbližších sousedů. Část práce popisuje postup při návrhu a implementaci této metody.
-
Advances in the theory of nearest neighbor distributions
… it has been shown that the moments of the nearest neighbor distance distributions for a set of independent identically distributed random variables are asymptotically characterized by the Rényi entropies of the underlying probability density. As entropy estimation is a problem of major …
-
Exact L∞-Nearest-Neighbor Search in High Dimensions
In this thesis we consider the nearest-neighbor problem, which is defined as follows: given a fixed set P of n data points in some metric space X, build a data structure such that for each given query point q a data point from P closest to q can be found efficiently. The underlying metric space is …
-
NEAREST NEIGHBOR REGRESSION ESTIMATORS IN RAINFALL-RUNOFF FORECASTING
… a nonparametric technique referred to as the k-nearest neighbor (k-NN) methods to flood warning and least squares forecasting. The motivation of this method stems from recent results in statistics which extends nonparametric methods for inferring regression functions in a time series setting. …
-
Nearest neighbor search for cyro-electron microscopy images
… part of the thesis, we try four different k-nearest neighbors search (KNNS) algorithms on cryo-EM projection images classifying them based on the viewing directions. Brute force search (BFS) could be very time consuming when the dataset is large. Therefore, strategies like locality sensitive …
Page 1 of 75