Search Results for author: Piotr Bielak

Found 8 papers, 6 papers with code

Representation learning in multiplex graphs: Where and how to fuse information?

1 code implementation27 Feb 2024 Piotr Bielak, Tomasz Kajdanowicz

In recent years, unsupervised and self-supervised graph representation learning has gained popularity in the research community.

Graph Representation Learning

Unveiling the Potential of Probabilistic Embeddings in Self-Supervised Learning

no code implementations27 Oct 2023 Denis Janiak, Jakub Binkowski, Piotr Bielak, Tomasz Kajdanowicz

In recent years, self-supervised learning has played a pivotal role in advancing machine learning by allowing models to acquire meaningful representations from unlabeled data.

Out-of-Distribution Detection Self-Supervised Learning

Graph-level representations using ensemble-based readout functions

1 code implementation3 Mar 2023 Jakub Binkowski, Albert Sawczyn, Denis Janiak, Piotr Bielak, Tomasz Kajdanowicz

Graph machine learning models have been successfully deployed in a variety of application areas.

RAFEN -- Regularized Alignment Framework for Embeddings of Nodes

1 code implementation3 Mar 2023 Kamil Tagowski, Piotr Bielak, Jakub Binkowski, Tomasz Kajdanowicz

A well-defined node embedding model should reflect both node features and the graph structure in the final embedding.

Graph Barlow Twins: A self-supervised representation learning framework for graphs

1 code implementation4 Jun 2021 Piotr Bielak, Tomasz Kajdanowicz, Nitesh V. Chawla

The self-supervised learning (SSL) paradigm is an essential exploration area, which tries to eliminate the need for expensive data labeling.

Contrastive Learning Graph Representation Learning +1

AttrE2vec: Unsupervised Attributed Edge Representation Learning

no code implementations29 Dec 2020 Piotr Bielak, Tomasz Kajdanowicz, Nitesh V. Chawla

Representation learning has overcome the often arduous and manual featurization of networks through (unsupervised) feature learning as it results in embeddings that can apply to a variety of downstream learning tasks.

Clustering Edge Classification +1

FILDNE: A Framework for Incremental Learning of Dynamic Networks Embeddings

1 code implementation6 Apr 2019 Piotr Bielak, Kamil Tagowski, Maciej Falkiewicz, Tomasz Kajdanowicz, Nitesh V. Chawla

Experimental results on several downstream tasks, over seven real-world data sets, show that FILDNE is able to reduce memory and computational time costs while providing competitive quality measure gains with respect to the contemporary methods for representation learning on dynamic graphs.

Dynamic graph embedding Incremental Learning +2

Cannot find the paper you are looking for? You can Submit a new open access paper.