activity
20162022
most citedRecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting

17 citations · 26 across the 4 of their papers we have counts for

collaborators

5 papers

cs.IR2022

Improving Ads-Profitability Using Traffic-Fingerprints

Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski +2

This paper introduces the concept of traffic-fingerprints, i.e., normalized 24-dimensional vectors representing a distribution of daily traffic on a web page. Using k-means cluster…

cs.SI2017

Why Do Cascade Sizes Follow a Power-Law?

Karol Węgrzycki, Piotr Sankowski, Andrzej Pacuk +1

We introduce random directed acyclic graph and use it to model the information diffusion network. Subsequently, we analyze the cascade generation model (CGM) introduced by Leskovec…

cs.AI2016★ 17 cited

RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting

Andrzej Pacuk, Piotr Sankowski, Karol Węgrzycki +2

We present the Mim-Solution's approach to the RecSys Challenge 2016, which ranked 2nd. The goal of the competition was to prepare job recommendations for the users of the website X…

cs.SI2016★ 2 cited

There is Something Beyond the Twitter Network

Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki +1

How information spreads through a social network? Can we assume, that the information is spread only through a given social network graph? What is the correct way to compare the mo…

cs.DS2016★ 7 cited

Locality-Sensitive Hashing without False Negatives for l_p

Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki +1

In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius …