Search

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 like the cosine distance, which has become quite common, for example, with embeddings and in text mining. This paper presents GDASC (General Distributed Approximate Similarity search with Clustering), a general framework for distributed approximate similarity search that accepts arbitrary distances. This framework can build a multilevel index structure, by selecting a clustering algorithm, the number of prototypes in each cluster and any arbitrary distance function. As a result, this framework effectively overcomes the limitation of using metric distances and can address situations involving cosine similarity or other non-standard similarity measures. Experimental results using k-medoids clustering in GDASC with real datasets confirm the applicability of this approach for approximate similarity search, improving the performance of extant algorithms for this purpose.

We report on the discovery and validation of a two-planet system around a bright (V = 8.85 mag) early G dwarf (1.43 $R_{\odot}$, 1.15 $M_{\odot}$, TOI 2319) using data from NASA's Transiting Exoplanet Survey Satellite (TESS). Three transit events from two planets were detected by citizen scientists in the month-long TESS light curve (sector 25), as part of the Planet Hunters TESS project. Modelling of the transits yields an orbital period of \Pb\ and radius of $3.41 _{ - 0.12 } ^ { + 0.14 }$ $R_{\oplus}$ for the inner planet, and a period in the range 19.26-35 days and a radius of $5.83 _{ - 0.14 } ^ { + 0.14 }$ $R_{\oplus}$ for the outer planet, which was only seen to transit once. Each signal was independently statistically validated, taking into consideration the TESS light curve as well as the ground-based spectroscopic follow-up observations. Radial velocities from HARPS-N and EXPRES yield a tentative detection of planet b, whose mass we estimate to be $11.56 _{ - 6.14 } ^ { + 6.58 }$ $M_{\oplus}$, and allow us to place an upper limit of $27.5$ $M_{\oplus}$ (99 per cent confidence) on the mass of planet c. Due to the brightness of the host star and the strong likelihood of an extended H/He atmosphere on both planets, this system offers excellent prospects for atmospheric characterisation and comparative planetology., Comment: Accepted for publication in MNRAS (15 pages, 10 figures, 3 tables)

Functional complex networks have meant a pivotal change in the way we understand complex systems, being the most outstanding one the human brain. These networks have classically been reconstructed using a frequentist approach that, while simple, completely disregards the uncertainty that derives from data finiteness. We here provide an alternative solution based on Bayesian inference, with link weights treated as random variables described by probability distributions, from which ensembles of networks are sampled. By using both statistical and topological considerations, we prove that the role played by links' uncertainty is equivalent to the introduction of a random rewiring, whose omission leads to a consistent overestimation of topological structures. We further show that this bias is enhanced in short time series, suggesting the existence of a theoretical time resolution limit for obtaining reliable structures. We also propose a simple sampling process for correcting topological values obtained in frequentist networks. We finally validate these concepts through synthetic and real network examples, the latter representing the brain electrical activity of a group of people during a cognitive task., Comment: 16 pages, 5 figures