Andrzej Pacuk
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Andrzej Pacuk has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Karol Węgrzycki
MPI-INF, Saarbrücken, Germany
4 shared publications Piotr Sankowski
University of Warsaw, Warsaw, Poland
3 shared publicationsPiotr Wygocki
University of Warsaw, Warsaw, Poland
3 shared publicationsAdam Witkowski
University of Warsaw, Poland
1 shared publication- Piotr Sankowski
Faculty of Mathematics, Informatics and Mechanics University of Warsaw, MIM Solutions
1 shared publication - Piotr Wygocki
Institute of Informatics University of Warsaw Poland
1 shared publication
Latest Publications
- Open Access
- 3 April 2017
- Published by Association for Computing Machinery (ACM)
- p. 569-576
Why Do Cascade Sizes Follow a Power-Law?
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 et al. [19]. Until now only empirical studies of this model were done. In this paper, we present the first theoretical proof that the sizes of cascades generated by the CGM follow the power-law distribution, which is consistent with multiple empirical analysis of the large social networks. We compared the assumptions of our model with the Twitter social network and tested the goodness of approximation.
- 3 April 2017
- Published by Association for Computing Machinery (ACM)
- p. 569-576
Open AccessWhy Do Cascade Sizes Follow a Power-Law?
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 et al. [19]. Until now only empirical studies of this model were done. In this paper, we present the first theoretical proof that the sizes of cascades generated by the CGM follow the power-law distribution, which is consistent with multiple empirical analysis of the large social networks. We compared the assumptions of our model with the Twitter social network and tested the goodness of approximation.
- Open Access
- 15 September 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-4
RecSys Challenge 2016
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 Xing.com. Our two phase algorithm consists of candidate selection followed by the candidate ranking. We ranked the candidates by the predicted probability that the user will positively interact with the job offer. We have used Gradient Boosting Decision Trees as the regression tool.
- 15 September 2016
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessRecSys Challenge 2016
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 Xing.com. Our two phase algorithm consists of candidate selection followed by the candidate ranking. We ranked the candidates by the predicted probability that the user will positively interact with the job offer. We have used Gradient Boosting Decision Trees as the regression tool.
- 20 July 2016
- Published by Springer Nature
- p. 105-118
Locality-Sensitive Hashing Without False Negatives for $l_p$- 20 July 2016
- Published by Springer Nature
- p. 105-118
Locality-Sensitive Hashing Without False Negatives for $l_p$- Open Access
- 10 July 2016
- Published by Association for Computing Machinery (ACM)
- p. 279-284
There is Something Beyond the Twitter Network
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 models of information flow? These are the basic questions we address in this work. We focus on meticulous comparison of various, well-known models of rumor propagation in the social network. We introduce the model incorporating mass media and effects of absent nodes. In this model the information appears spontaneously in the graph. Using the most conservative metric, we showed that the distribution of cascades sizes generated by this model fits the real data much better than the previously considered models.
- 10 July 2016
- Published by Association for Computing Machinery (ACM)
- p. 279-284
Open AccessThere is Something Beyond the Twitter Network
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 models of information flow? These are the basic questions we address in this work. We focus on meticulous comparison of various, well-known models of rumor propagation in the social network. We introduce the model incorporating mass media and effects of absent nodes. In this model the information appears spontaneously in the graph. Using the most conservative metric, we showed that the distribution of cascades sizes generated by this model fits the real data much better than the previously considered models.