62 citations · 99 across the 11 of their papers we have counts for
11 papers
Crowd-Labeling Fashion Reviews with Quality Control
Iurii Chernushenko, Felix A. Gers, Alexander Löser +1
We present a new methodology for high-quality labeling in the fashion domain with crowd workers instead of experts. We focus on the Aspect-Based Sentiment Analysis task. Our method…
FashionBrain Project: A Vision for Understanding Europe's Fashion Data Universe
Alessandro Checco, Gianluca Demartini, Alexander Loeser +7
A core business in the fashion industry is the understanding and prediction of customer needs and trends. Search engines and social networks are at the same time a fundamental brid…
The Effect of Class Imbalance and Order on Crowdsourced Relevance Judgments
Rehab K. Qarout, Alessandro Checco, Gianluca Demartini
In this paper we study the effect on crowd worker efficiency and effectiveness of the dominance of one class in the data they process. We aim at understanding if there is any posit…
Pairwise, Magnitude, or Stars: What's the Best Way for Crowds to Rate?
Alessandro Checco, Gianluca Demartini
We compare three popular techniques of rating content: the ubiquitous five star rating, the less used pairwise comparison, and the recently introduced (in crowdsourcing) magnitude…
BLC: Private Matrix Factorization Recommenders via Automatic Group Learning
Alessandro Checco, Giuseppe Bianchi, Doug Leith
We propose a privacy-enhanced matrix factorization recommender that exploits the fact that users can often be grouped together by interest. This allows a form of "hiding in the cro…
Analysis of Dynamic Channel Bonding in Dense Networks of WLANs
Azadeh Faridi, Boris Bellalta, Alessandro Checco
Dynamic Channel Bonding (DCB) allows for the dynamic selection and use of multiple contiguous basic channels in Wireless Local Area Networks (WLANs). A WLAN operating under DCB can…
On the Interactions between Multiple Overlapping WLANs using Channel Bonding
B. Bellalta, A. Checco, A. Zocca +1
Next-generation WLANs will support the use of wider channels, which is known as channel bonding, to achieve higher throughput. However, because both the channel center frequency an…
Throughput Analysis in CSMA/CA Networks using Continuous Time Markov Networks: A Tutorial
B. Bellalta, A. Zocca, C. Cano +3
This book chapter introduces the use of Continuous Time Markov Networks (CTMN) to analytically capture the operation of Carrier Sense Multiple Access with Collision Avoidance (CSMA…
Fast, Responsive Decentralised Graph Colouring
Alessandro Checco, Douglas J. Leith
We solve, in a fully decentralised way (\ie with no message passing), the classic problem of colouring a graph. We propose a novel algorithm that is automatically responsive to top…
Updating Neighbour Cell List via Crowdsourced User Reports: a Framework for Measuring Time Performance
Alessandro Checco, Carlo Lancia, Douglas J. Leith
In this paper we introduce the idea of estimating local topology in wireless networks by means of crowdsourced user reports. In this approach each user periodically reports to the…
Learning-Based Constraint Satisfaction With Sensing Restrictions
Alessandro Checco, Douglas Leith
In this paper we consider graph-coloring problems, an important subset of general constraint satisfaction problems that arise in wireless resource allocation. We constructively est…