2-d embedding of large and high-dimensional data with minimal memory and computational time requirements

W Dzwinel, R Wcislo, S Matwin - arXiv preprint arXiv:1902.01108, 2019 - arxiv.org
In the advent of big data era, interactive visualization of large data sets consisting of M* 10^
5+ high-dimensional feature vectors of length N (N~ 10^ 3+), is an indispensable tool for …

Relation order histograms as a network embedding tool

R Łazarz, M Idzik - Computational Science–ICCS 2021: 21st International …, 2021 - Springer
In this work, we introduce a novel graph embedding technique called NERO (Network
Embedding based on Relation Order histograms). Its performance is assessed using a …

[PDF][PDF] Semantic analysis of multidimensional graph descriptors with applications for structural data mining

R Łazarz - 2022 - researchgate.net
Because of their overall versatility, complex networks remain the most widely adopted
approach to structure representation—and the recent breakthroughs in graph-based pattern …

[PDF][PDF] Relation order histograms as a network embedding tool

R law Lazarz, M l Idzik - iccs-meeting.org
In this work, we introduce a novel graph embedding technique called NERO (Network
Embedding based on Relation Order histograms). Its performance is assessed using a …

[引用][C] Algorithmic advances for parallel architectures

R Wyrzykowski, BK Szymanski - Concurrency and Computation …, 2017 - Wiley Online Library
PPAM is a biennial series of international conferences dedicated to exchanging ideas
between researchers involved in parallel and distributed computing, including theory and …