با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
Binary Hashing for Approximate Nearest Neighbor Search on Big Data: A Survey
هش دودویی برای جستجوی نزدیکترین همسایگی تقریبی در داده های بزرگ: یک مرور-2018 Nearest neighbor search is a fundamental problem in various domains, such as computer
vision, data mining, and machine learning. With the explosive growth of data on the Internet, many new data
structures using spatial partitions and recursive hyperplane decomposition (e.g., k-d trees) are proposed to
speed up the nearest neighbor search. However, these data structures are facing big data challenges. To meet
these challenges, binary hashing-based approximate nearest neighbor search methods attract substantial
attention due to their fast query speed and drastically reduced storage. Since the most notably locality
sensitive hashing was proposed, a large number of binary hashing methods have emerged. In this paper,
we first illustrate the development of binary hashing research by proposing an overall and clear classification
of them. Then we conduct extensive experiments to compare the performance of these methods on five
famous and public data sets. Finally, we present our view on this topic.
INDEX TERMS : Approximate nearest neighbor search, large-scale database, hashing based methods,overview |
مقاله انگلیسی |