activity
20132025
most citedMultidimensional Social Network in the Social Recommender System

201 citations · 724 across the 34 of their papers we have counts for

collaborators
Showing cs.SIShow all

9 papers · 1 filter

cs.SI2021

Spatial Data Mining of Public Transport Incidents reported in Social Media

Kamil Raczycki, Marcin Szymański, Yahor Yeliseyenka +2

Public transport agencies use social media as an essential tool for communicating mobility incidents to passengers. However, while the short term, day-to-day information about tran…

cs.SI2018★ 12 cited

Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures

Mikołaj Morzy, Tomasz Kajdanowicz

Graph energy is the energy of the matrix representation of the graph, where the energy of a matrix is the sum of singular values of the matrix. Depending on the definition of a mat…

cs.SI2018★ 1 cited

Priority Attachment: a Comprehensive Mechanism for Generating Networks

Mikołaj Morzy, Tomasz Kajdanowicz, Przemysław Kazienko +2

We claim that networks are created according to the priority attachment mechanism and we show a simple model which uses the priority attachment to generate both synthetic and close…

cs.SI2017

Spatio-temporal profiling of public transport delays based on large scale vehicle positioning data from GPS in Wrocław

Piotr Szymański, Michał Żołnieruk, Piotr Oleszczyk +2

In recent years many studies of urban mobility based on large data sets have been published: most of them based on crowdsourced GPS data or smart-card data. We present, what is to…

cs.SI2016★ 3 cited

Balancing Speed and Coverage by Sequential Seeding in Complex Networks

Jarosław Jankowski, Piotr Bródka, Przemysław Kazienko +3

Information spreading in complex networks is often modeled as diffusing information with certain probability from nodes that possess it to their neighbors that do not. Information…

cs.SI2014★ 62 cited

Seed Selection for Spread of Influence in Social Networks: Temporal vs. Static Approach

Radosław Michalski, Tomasz Kajdanowicz, Piotr Bródka +1

The problem of finding optimal set of users for influencing others in the social network has been widely studied. Because it is NP-hard, some heuristics were proposed to find sub-o…