17 citations · 45 across the 9 of their papers we have counts for
9 papers
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski +1
Shapley values are one of the main tools used to explain predictions of tree ensemble models. The main alternative to Shapley values are Banzhaf values that have not been understoo…
Improved approximate near neighbor search without false negatives for
Piotr Wygocki
We present a new algorithm for the --approximate nearest neighbor search without false negatives for . We enhance the dimension reduction method presented in \cite{wygos_…
Approximate nearest neighbors search without false negatives for for
Piotr Sankowski, Piotr Wygocki
In this paper, we report progress on answering the open problem presented by Pagh~[14], who considered the nearest neighbor search without false negatives for the Hamming distance.…
On fast bounded locality sensitive hashing
Piotr Wygocki
In this paper, we examine the hash functions expressed as scalar products, i.e., , for some bounded random vector . Such hash functions have numerous applications, b…
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…
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…
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…
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 …
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks
Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski +1
This paper summarizes the work on implementing few solutions for the Steiner Tree problem which we undertook in the PAAL project. The main focus of the project is the development o…