scispace - formally typeset
N

Nicolas Kourtellis

Researcher at Telefónica

Publications -  165
Citations -  4299

Nicolas Kourtellis is an academic researcher from Telefónica. The author has contributed to research in topics: Computer science & Social media. The author has an hindex of 30, co-authored 140 publications receiving 2885 citations. Previous affiliations of Nicolas Kourtellis include Yahoo! & University of South Florida.

Papers
More filters
Proceedings ArticleDOI

Large scale crowdsourcing and characterization of twitter abusive behavior

TL;DR: The authors proposed an incremental and iterative methodology that leverages the power of crowdsourcing to annotate a large collection of tweets with a set of abuse-related labels and identified a reduced but robust set of labels to characterize abusive-related tweets.
Proceedings ArticleDOI

Mean Birds: Detecting Aggression and Bullying on Twitter

TL;DR: The authors proposed a robust methodology for extracting text, user, and network-based attributes, studying the properties of bullies and aggressors, and what features distinguish them from regular users, finding that bullies are relatively popular and tend to include more negativity in their posts.
Posted Content

Large Scale Crowdsourcing and Characterization of Twitter Abusive Behavior

TL;DR: This work proposes an incremental and iterative methodology, that utilizes the power of crowdsourcing to annotate a large scale collection of tweets with a set of abuse-related labels, and identifies a reduced but robust set of labels.
Proceedings ArticleDOI

The Power of Both Choices: Practical Load Balancing for Distributed Stream Processing Engines

TL;DR: In this article, partial key grouping (PKG) is proposed to adapt the classical power of two choices to a distributed streaming setting by leveraging two novel techniques: key splitting and local load estimation.
Journal ArticleDOI

Identifying high betweenness centrality nodes in large social networks

TL;DR: In this paper, a new metric, κ-path centrality, and a randomized algorithm for estimating it were proposed, and it was shown empirically that nodes with high path centrality have high node betweenness centrality.