Zobrazeno 1 - 10
of 3 805
pro vyhledávání: '"Approximate similarity"'
Autor:
Garcia-Morato, Elena, Algar, Maria Jesus, Alfaro, Cesar, Ortega, Felipe, Gomez, Javier, Moguerza, Javier M.
Similarity search is a central problem in domains such as information management and retrieval or data analysis. Many similarity search algorithms are designed or specifically adapted to metric distances. Thus, they are unsuitable for alternatives li
Externí odkaz:
http://arxiv.org/abs/2405.13795
Publikováno v:
ICDE 2024
The generation and collection of big data series are becoming an integral part of many emerging applications in sciences, IoT, finance, and web applications among several others. The terabyte-scale of data series has motivated recent efforts to desig
Externí odkaz:
http://arxiv.org/abs/2404.09637
Autor:
Aleo, P. D., Engel, A. W., Narayan, G., Angus, C. R., Malanchev, K., Auchettl, K., Baldassare, V. F., Berres, A., de Boer, T. J. L., Boyd, B. M., Chambers, K. C., Davis, K. W., Esquivel, N., Farias, D., Foley, R. J., Gagliano, A., Gall, C., Gao, H., Gomez, S., Grayling, M., Jones, D. O., Lin, C. -C., Magnier, E. A., Mandel, K. S., Matheson, T., Raimundo, S. I., Shah, V. G., Soraisam, M. D., de Soto, K. M., Vicencio, S., Villar, V. A., Wainscoat, R. J.
We present LAISS (Lightcurve Anomaly Identification and Similarity Search), an automated pipeline to detect anomalous astrophysical transients in real-time data streams. We deploy our anomaly detection model on the nightly ZTF Alert Stream via the AN
Externí odkaz:
http://arxiv.org/abs/2404.01235
Similarity join finds all pairs of close points within a given distance threshold. Many similarity join methods have been proposed, but they are usually not efficient on high-dimensional space due to the curse of dimensionality and data-unawareness.
Externí odkaz:
http://arxiv.org/abs/2402.13397
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.
Similarity search based on a distance function in metric spaces is a fundamental problem for many applications. Queries for similar objects lead to the well-known machine learning task of nearest-neighbours identification. Many data indexing strategi
Externí odkaz:
http://arxiv.org/abs/2208.02734
Search engines and recommendation systems are built to efficiently display relevant information from those massive amounts of candidates. Typically a three-stage mechanism is employed in those systems: (i) a small collection of items are first retrie
Externí odkaz:
http://arxiv.org/abs/2210.14958
Autor:
Alqhtani, Manal1 (AUTHOR) mmalqahtany@nu.edu.sa, Srivastava, Rekha2 (AUTHOR) rekhasrivastava@uvic.ca, Abdel-Gawad, Hamdy I.3 (AUTHOR) hamdyig@yahoo.com, Macías-Díaz, Jorge E.4,5 (AUTHOR) jemacias@correo.uaa.mx, Saad, Khaled M.1 (AUTHOR) kmalhamam@nu.edu.sa, Hamanah, Waleed M.6 (AUTHOR) waleed.hamanah@kfupm.edu.sa
Publikováno v:
Mathematics (2227-7390). Nov2023, Vol. 11 Issue 22, p4569. 21p.
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:
In Information Sciences January 2023 619:208-234