Zobrazeno 1 - 10
of 6 682
pro vyhledávání: '"Neighbor search"'
Autor:
Amorim, Lucas L. a, ⁎, Mutz, Filipe a, Paixão, Thiago M. b, Rampinelli, Vinicius c, De Souza, Alberto F. a, Badue, Claudine a, Oliveira-Santos, Thiago a
Publikováno v:
In Engineering Applications of Artificial Intelligence 1 February 2025 141
Publikováno v:
大数据, Vol 10, Pp 17-34 (2024)
Approximate nearest neighbor search (ANNS) is an important technique in the field of computer science for efficient similarity search, enabling fast information retrieval in large-scale datasets.With the increasing demand for high-precision informati
Externí odkaz:
https://doaj.org/article/f5ccf8a500bb4c7e957acd1e4a028cfe
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Electronic Research Archive, Vol 31, Iss 9, Pp 5845-5865 (2023)
With the rapid development of network technology and small handheld devices, the amount of data has significantly increased and various kinds of data can be supplied to us at the same time. Recently, hashing technology has become popular in executing
Externí odkaz:
https://doaj.org/article/d2f8744d080f47afa8c4749931984cf1
Autor:
Xinye Chen, Stefan Güttel
Publikováno v:
PeerJ Computer Science, Vol 10, p e1929 (2024)
Fixed-radius near neighbor search is a fundamental data operation that retrieves all data points within a user-specified distance to a query point. There are efficient algorithms that can provide fast approximate query responses, but they often have
Externí odkaz:
https://doaj.org/article/1099e8a1869348728fd42b4aa25ba3f0
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 36, Iss 3, Pp 102002- (2024)
Density-peak clustering (DPC) is a novel clustering algorithm that has received much attention from researchers. Its principle is to identify the cluster center of the data by density and distance. However, the density-peak clustering algorithm still
Externí odkaz:
https://doaj.org/article/a53c0d172f344168891330f9cdc01473
Autor:
Huixia Liu, Zhihong Qin
Publikováno v:
Electronic Research Archive, Vol 31, Iss 7, Pp 4232-4247 (2023)
Approximate nearest neighbor (ANN) search has become an essential paradigm for large-scale image retrieval. Conventional ANN search requires the categories of query images to been seen in the training set. However, facing the rapid evolution of newly
Externí odkaz:
https://doaj.org/article/b026252b8eb644b38d7df27eed240a35
Autor:
Wu Xunhua
Publikováno v:
Applied Mathematics and Nonlinear Sciences, Vol 9, Iss 1 (2024)
This paper achieves high-quality sharing of preschool educational resources among learners based on a matrix model. Through the shared resource matrix analysis method, the symmetry of the matrix about this educational resource is judged so that the r
Externí odkaz:
https://doaj.org/article/3b1fee43c46e4e35baa519ee12dbbbf9
Publikováno v:
Jisuanji kexue, Vol 50, Iss 4, Pp 32-39 (2023)
Nearest neighbor search has become a significant research problem due to its wide applications.Traditional spatial index structures such as R-tree and KD-tree can efficiently return accurate nearest neighbor search results in low-dimensional space,bu
Externí odkaz:
https://doaj.org/article/10a628b4a20643e69759417ee03bff23
Autor:
Jia Liu, Wang Yinchai, Fengrui Wei, Qing Han, Yunting Tao, Liping Zhao, Xinjin Li, Hongbo Sun
Publikováno v:
IEEE Access, Vol 11, Pp 109027-109037 (2023)
As one fundamental data-mining problem, ANN (approximate nearest neighbor search) is widely used in many industries including computer vision, information retrieval, and recommendation system. $LSH$ (Local sensitive hashing) is one of the most popula
Externí odkaz:
https://doaj.org/article/1378a8fd29374dba90825023694ef2d2