Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lorenzo Paletto

dblp:352/2017 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0001-7225-9378ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Information extraction and text analysis · 91% Knowledge representation and reasoning · 9%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › text classification › multi-label text classification
hierarchical text classification
0.812024
Label Augmentation for Zero-Shot Hierarchical Text Classification · ACL (1) 2024
Natural language and speech › Information extraction and text analysis
text classification
0.812024
Label Augmentation for Zero-Shot Hierarchical Text Classification · ACL (1) 2024
Natural language and speech › Information extraction and text analysis › text classification › transfer learning for text classification
zero-shot text classification
0.812024
Label Augmentation for Zero-Shot Hierarchical Text Classification · ACL (1) 2024

Methods — techniques the papers use, named apart from their topics

upward score propagation · 0.8large language model · 0.8
YearPublicationVenuePosition
2024 Label Augmentation for Zero-Shot Hierarchical Text Classification
abstract
Hierarchical Text Classification poses the difficult challenge of classifying documents into multiple labels organized in a hierarchy.The vast majority of works aimed to address this problem relies on supervised methods which are difficult to implement due to the scarcity of labeled data in many real world applications.This paper focuses on strict Zero-Shot Classification, the setting in which the system lacks both labeled instances and training data.We propose a novel approach that uses a Large Language Model to augment the deepest layer of the labels hierarchy in order to enhance its specificity.We achieve this by generating semantically relevant labels as children connected to the existing branches, creating a deeper taxonomy that better overlaps with the input texts.We leverage the enriched hierarchy to perform Zero-Shot Hierarchical Classification by using the Upward score Propagation technique.We test our method on four public datasets, obtaining new state-of-the art results on three of them.We introduce two cosine similarity-based metrics to quantify the density and granularity of a label taxonomy and we show a strong correlation between the metric values and the classification performance of our method on the datasets.
Lorenzo Paletto, Valerio Basile, Roberto Esposito
ACL (1)1
2023 Hierarchical priors for Hyperspherical Prototypical Networks
abstract
In this paper, we explore the usage of hierarchical priors to improve learning in contexts where the number of available examples is extremely low.Specifically, we consider a Prototype Learning setting where deep neural networks are used to embed data in hyperspherical geometries.In this scenario, we propose an innovative way to learn the prototypes by combining class separation and hierarchical information.In addition, we introduce a contrastive loss function capable of balancing the exploitation of prototypes through a prototype pruning mechanism.We compare the proposed method with state-of-the-art approaches on two public datasets.This work has been partially supported by the Spoke 1 "FutureHPC & BigData" of ICSC -Centro Nazionale di Ricerca in High-Performance-Computing, Big Data and Quantum Computing, funded by European Union -NextGenerationEU.
Samuele Fonio, Lorenzo Paletto, Mattia Cerrato, Dino Ienco, Roberto Esposito
ESANN2
2023 Predicting Cryptocurrencies Market Phases through On-Chain Data Long-Term Forecasting
abstract
Blockchain, the underlying technology of Bitcoin and several other cryptocurrencies, like Ethereum, produces a massive amount of open-access data that can be analyzed, providing important information about the network's activity and its respective token. The on-chain data have extensively been used as input to Machine Learning algorithms for predicting cryptocurrencies' future prices; however, there is a lack of study in predicting the future behaviour of on-chain data. This study aims to show how on-chain data can be used to detect cryptocurrency market regimes, like minimum and maximum, bear and bull market phases, and how forecasting these data can provide an optimal asset allocation for long-term investors.
Bruno Casella, Lorenzo Paletto
ICBC2