Bypassing sluggishness: SWAP algorithm and glassiness in high dimensions
نویسندگان
چکیده
منابع مشابه
ahp algorithm and un-supervised clustering in auto insurance fraud detection
this thesis is a study on insurance fraud in iran automobile insurance industry and explores the usage of expert linkage between un-supervised clustering and analytical hierarchy process(ahp), and renders the findings from applying these algorithms for automobile insurance claim fraud detection. the expert linkage determination objective function plan provides us with a way to determine whi...
15 صفحه اولApproximation algorithm for the cyclic swap problem
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swaps needed to convert A into B, minimized over all rotations of B. We show that this distance may be approximated in O(n + k2) time.
متن کاملA Simple Algorithm for Nearest Neighbor Search in High Dimensions
The problem of finding the closest point in high-dimensional spaces is common in pattern recognition. Unfortunately, the complexity of most existing search algorithms, such as k-d tree and R-tree, grows exponentially with dimension, making them impractical for dimensionality above 15. In nearly all applications, the closest point is of interest only if it lies within a user-specified distance e...
متن کاملRandomized Algorithm for Approximate Nearest Neighbor Search in High Dimensions
A randomized algorithm employs a degree of randomness as part of its logic with uniform random bits as an auxiliary input to guide its behavior, in the hope of achieving good average runtime performance over all possible choices of the random bits. In this paper, we formulate a randomized algorithm capable of finding approximate nearest neighbors, specifically in high dimensional datasets. The ...
متن کاملA Simple Algorithm for Nearest Neighbor Search in High Dimensions
Finding the closest point in a high-dimensional space is a problem that often occurs in pattern recognition. Unfortunately, the complexity of most known search algorithms grows exponentially with dimension, which makes them unsuitable for high dimensions. However, for most applications, the closest point is of interest only if it is closer than some pre-defined distance. In the article ”A Simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.99.031301