Andrea Esuli

Andrea Esuli

Auto-generated profile, based on publicly available information

Andrea Esuli

Institute of Science and Technologies of Information “A. Faedo”, CNR, Pisa, Italy

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 January 2009
Verified
Conference Paper
Closed access
SBStefano Baccianella
Stefano Baccianella
AEAndrea Esuli
Andrea Esuli
FSFabrizio Sebastiani
Fabrizio Sebastiani
Ordinal regression (OR-also known as ordinal classification) has received increasing attention in recent times, due to its importance in IR applications such as learning to rank and product review rating. However, research has not paid attention to the fact that typical applications of OR often involve datasets that are highly imbalanced. An imbalanced dataset has the consequence that, when testing a system with an evaluation measure conceived for balanced datasets, a trivial system assigning all items to a single class (typically, the majority class) may even outperform genuinely engineered systems. Moreover, if this evaluation measure is used for parameter optimization, a parameter choice may result that makes the system behave very much like a trivial system. In order to avoid this, evaluation measures that can handle imbalance must be used. We propose a simple way to turn standard measures for OR into ones robust to imbalance. We also show that, once used on balanced datasets, the two versions of each measure coincide, and therefore argue that our measures should become the standard choice for OR.

12 June 2019 in Automated Software Engineering
Verified
Journal Article
Closed access
PDF file
Alessio FerrariAlessio Ferrari
Alessio Ferrari
AEAndrea Esuli
Andrea Esuli

3 January 2020 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
LPLucas May Petry
Lucas May Petry
CSCamila Leite Da Silva
Camila Leite Da Silva
AEAndrea Esuli
Andrea Esuli
CRChiara Renso
Chiara Renso
VBVania Bogorny
Vania Bogorny
The increasing popularity of Location-Based Social Networks (LBSNs) and the semantic enrichment of mobility data in several contexts in the last years has led to the generation of large volumes of trajectory data. In contrast to GPS-based trajectories, LBSN and context-aware trajectories are more complex data, having several semantic textual dimensions besides space and time, which may reveal interesting mobility patterns. For instance, people may visit different places or perform different activities depending on the weather conditions. These new semantically rich data, known as multiple-aspect trajectories, pose new challenges in trajectory classification, which is the problem that we address in this paper. Existing methods for trajectory classification cannot deal with the complexity of heterogeneous data dimensions or the sequential aspect that characterizes movement. In this paper we propose MARC, an approach based on attribute embedding and Recurrent Neural Networks (RNNs) for classifying multiple-aspect trajectories, that tackles all trajectory properties: space, time, semantics, and sequence. We highlight that MARC exhibits good performance especially when trajectories are described by several textual/categorical attributes. Experiments performed over four publicly available datasets considering the Trajectory-User Linking (TUL) problem show that MARC outperformed all competitors, with respect to accuracy, precision, recall, and F1-score.

1 June 2015 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
AEAndrea Esuli
Andrea Esuli
FSFabrizio Sebastiani
Fabrizio Sebastiani
We address the problem of quantification , a supervised learning task whose goal is, given a class, to estimate the relative frequency (or prevalence ) of the class in a dataset of unlabeled items. Quantification has several applications in data and text mining, such as estimating the prevalence of positive reviews in a set of reviews of a given product or estimating the prevalence of a given support issue in a dataset of transcripts of phone calls to tech support. So far, quantification has been addressed by learning a general-purpose classifier, counting the unlabeled items that have been assigned the class, and tuning the obtained counts according to some heuristics. In this article, we depart from the tradition of using general-purpose classifiers and use instead a supervised learning model for structured prediction , capable of generating classifiers directly optimized for the (multivariate and nonlinear) function used for evaluating quantification accuracy. The experiments that we have run on 5,500 binary high-dimensional datasets (averaging more than 14,000 documents each) show that this method is more accurate, more stable, and more efficient than existing state-of-the-art quantification methods.

1 January 2009 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
SBStefano Baccianella
Stefano Baccianella
AEAndrea Esuli
Andrea Esuli
FSFabrizio Sebastiani
Fabrizio Sebastiani