Exécution de notre outil de synthèse sur un nouvel article
Vérifiez l’article ci-dessous, puis lancez sa synthèse.
Machine learning friendly set version of Johnson–Lindenstrauss lemma
Mieczysław A. Kłopotek (Institute of Computer Science, Polish Academy of Sciences)
Knowledge and Information Systems
DOI: 10.1007/s10115-019-01412-8 (Computer Science)
Licence : CC BY
Résumé : Abstract The widely discussed and applied Johnson–Lindenstrauss (JL) Lemma has an existential form saying that for each set of data points Q in n-dimensional space, there exists a transformation f into an $$n'$$ n′ -dimensional space ( $$n' n′
Publié le 14 Oct. 2019