Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Nellemann, Katrine Scheel"'
Autor:
Draganov, Andrew, Jørgensen, Jakob Rødsgaard, Nellemann, Katrine Scheel, Mottin, Davide, Assent, Ira, Berry, Tyrus, Aslay, Cigdem
tSNE and UMAP are popular dimensionality reduction algorithms due to their speed and interpretable low-dimensional embeddings. Despite their popularity, however, little work has been done to study their full span of differences. We theoretically and
Externí odkaz:
http://arxiv.org/abs/2305.07320
Autor:
Draganov, Andrew, Berry, Tyrus, Jørgensen, Jakob Rødsgaard, Nellemann, Katrine Scheel, Assent, Ira, Mottin, Davide
TSNE and UMAP are two of the most popular dimensionality reduction algorithms due to their speed and interpretable low-dimensional embeddings. However, while attempts have been made to improve on TSNE's computational complexity, no existing method ca
Externí odkaz:
http://arxiv.org/abs/2206.09689
Publikováno v:
Jørgensen, J R, Nellemann, K S & Assent, I 2021, ' GPU-INSCY: A GPU-Parallel Algorithm and Tree Structure for Efficient Density-based Subspace Clustering ', Paper presented at 24th International Conference on Extending Database Technology, 23/03/2021-26/03/2021 . https://doi.org/10.5441/002/edbt.2021.04
Subspace clustering is the task of grouping objects based on mutual similarity in subspaces of the full-dimensional space.The INSCY algorithm extends the well-known density-based clustering algorithm DBSCAN. It finds dimensionality-unbiased non-redun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d5a7ab962cd55d2009931a4b5fe68b17
https://pure.au.dk/portal/da/publications/gpuinscy-a-gpuparallel-algorithm-and-tree-structure-for-efficient-densitybased-subspace-clustering(9ae10a61-081b-4822-8489-dbe9d8993bc5).html
https://pure.au.dk/portal/da/publications/gpuinscy-a-gpuparallel-algorithm-and-tree-structure-for-efficient-densitybased-subspace-clustering(9ae10a61-081b-4822-8489-dbe9d8993bc5).html