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

Franco Alberto Cardillo

dblp:06/5527 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0003-0940-4768ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 4

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.

Theoretical computer science
1 paper
Algorithms and data structures · 87% Computational geometry · 13%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 50% Indexing and storage engines · 50%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
metric space indexing
0.312017
Hilbert Exclusion: Improved Metric Search through Finite Isometric Embeddings · ACM Trans. Inf. Syst. 2017
Information retrieval
similarity search
0.312017
Hilbert Exclusion: Improved Metric Search through Finite Isometric Embeddings · ACM Trans. Inf. Syst. 2017
Algorithms and data structures › metric embedding
isometric embedding
0.312017
Hilbert Exclusion: Improved Metric Search through Finite Isometric Embeddings · ACM Trans. Inf. Syst. 2017
Algorithms and data structures
similarity search
0.312017
Hilbert Exclusion: Improved Metric Search through Finite Isometric Embeddings · ACM Trans. Inf. Syst. 2017

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

triangle inequality · 0.6hilbert space embedding · 0.6
YearPublicationVenuePosition
2024 Italian Word Embeddings for the Medical Domain
abstract
Neural word embeddings have proven valuable in the development of medical applications. However, for the Italian language, there are no publicly available corpora, embeddings, or evaluation resources tailored to this domain. In this paper, we introduce an Italian corpus for the medical domain, that includes texts from Wikipedia, medical journals, drug leaflets, and specialized websites. Using this corpus, we generate neural word embeddings from scratch. These embeddings are then evaluated using standard evaluation resources, that we translated into Italian exploiting the concept graph in the UMLS Metathesaurus. Despite the relatively small size of the corpus, our experimental results indicate that the new embeddings correlate well with human judgments regarding the similarity and the relatedness of medical concepts. Moreover, these medical-specific embeddings outperform a baseline model trained on the full Wikipedia corpus, which includes the medical pages we used. We believe that our embeddings and the newly introduced textual resources will foster further advancements in the field of Italian medical Natural Language Processing.
Franco Alberto Cardillo, Franca Debole
LREC/COLING1
2024 PN-OWL: A two-stage algorithm to learn fuzzy concept inclusions from OWL 2 ontologies
Franco Alberto Cardillo, Franca Debole, Umberto Straccia
Fuzzy Sets Syst.1
2022 Fuzzy OWL-Boost: Learning fuzzy concept inclusions via real-valued boosting
Franco Alberto Cardillo, Umberto Straccia
Fuzzy Sets Syst.1
2019 Supermetric search
Richard Connor 0001, Lucia Vadicamo, Franco Alberto Cardillo, Fausto Rabitti
Inf. Syst.3
2017 Hilbert Exclusion: Improved Metric Search through Finite Isometric Embeddings
abstract
Most research into similarity search in metric spaces relies on the triangle inequality property. This property allows the space to be arranged according to relative distances to avoid searching some subspaces. We show that many common metric spaces, notably including those using Euclidean and Jensen-Shannon distances, also have a stronger property, sometimes called the four-point property: In essence, these spaces allow an isometric embedding of any four points in three-dimensional Euclidean space, as well as any three points in two-dimensional Euclidean space. In fact, we show that any space that is isometrically embeddable in Hilbert space has the stronger property. This property gives stronger geometric guarantees, and one in particular, which we name the Hilbert Exclusion property, allows any indexing mechanism which uses hyperplane partitioning to perform better. One outcome of this observation is that a number of state-of-the-art indexing mechanisms over high-dimensional spaces can be easily refined to give a significant increase in performance; furthermore, the improvement given is greater in higher dimensions. This therefore leads to a significant improvement in the cost of metric search in these spaces.
Richard Connor 0001, Franco Alberto Cardillo, Lucia Vadicamo, Fausto Rabitti
ACM Trans. Inf. Syst.2
2016 Supermetric Search with the Four-Point Property
Richard Connor 0001, Lucia Vadicamo, Franco Alberto Cardillo, Fausto Rabitti
SISAP3
2013 Evaluation of Jensen-Shannon Distance over Sparse Data
Richard Connor 0001, Franco Alberto Cardillo, Robert Moss, Fausto Rabitti
SISAP2
2006 A New Swarm Intelligence Coordination Model Inspired by Collective Prey Retrieval and Its Application to Image Alignment
Giovanni Da San Martino, Franco Alberto Cardillo, Antonina Starita
PPSN2