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

Luca Papariello

dblp:245/1841 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0003-1053-0163ORCID · corroborated

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

Databases, data management, data science and information retrieval · 4 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
Learning theory · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
generalization
0.612022
Formal Analysis and Estimation of Chance in Datasets Based on Their Properties · IEEE Trans. Knowl. Data Eng. 2022
Information retrieval › document retrieval › domain-specific retrieval › legal information retrieval
patent retrieval
0.412019
A Horizontal Patent Test Collection · SIGIR 2019
Information retrieval › evaluation
test collection
0.412019
A Horizontal Patent Test Collection · SIGIR 2019
Bioinformatics and computational biology
genomics
0.212022
Formal Analysis and Estimation of Chance in Datasets Based on Their Properties · IEEE Trans. Knowl. Data Eng. 2022

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

formal analysis · 1.1cross-validation · 1.1chance influence estimation · 1.1
YearPublicationVenuePosition
2022 Formal Analysis and Estimation of Chance in Datasets Based on Their Properties
abstract
Machine learning research, particularly in genomics, is often based on wide shaped datasets, i.e. datasets having a large number of features, but a small number of samples. Such configurations raise the possibility of chance influence (the increase of measured accuracy due to chance correlations) on the learning process and the evaluation results. Prior research underlined the problem of generalization of models obtained based on such data. In this paper, we investigate the influence of chance on prediction and show its significant effects on wide shaped datasets. First, we empirically demonstrate how significant the influence of chance in such datasets is by showing that prediction models trained on thousands of randomly generated datasets can achieve high accuracy. This is the case even when using cross-validation. We then provide a formal analysis of chance influence and design formal chance influence estimators based on the dataset parameters, namely its sample size, the number of features, the number of classes and the class distribution. Finally, we provide an in-depth discussion of the formal analysis including applications of the findings and recommendations on chance influence mitigation.
Abdel Aziz Taha, Luca Papariello, Alexandros Bampoulidis, Petr Knoth, Mihai Lupu
IEEE Trans. Knowl. Data Eng.2
2021 Exploring Learning Resource Recommendation Approaches for Secondary Education
abstract
Recommender Systems are a well researched area and there are many approaches and algorithms solving different kind of problems. In TEL recommending appropriate learning resources is a common problem that cannot be generalized well due to different didactic strategies, educational needs and heterogeneous data sources. We therefore argue that a design science process is best suited to apply, combine and improve different established recommendation system approaches to TEL systems. In this paper, we report our architecture to support our design process and the lessons learned from our specific TEL use case. Finally, we conclude discussing the open problems, advantages of our architectural approach and directions for future research.
Christoph Brandstetter, Fabian Suda, Luca Papariello, Fabian Dopler, Bernhard Göschlberger
iiWAS3
2020 On the Replicability of Combining Word Embeddings and Retrieval Models
Luca Papariello, Alexandros Bampoulidis, Mihai Lupu
ECIR (2)1
2019 A Horizontal Patent Test Collection
abstract
We motivate the need for, and describe the contents of a novel patent research collection, publicly available and for free, covering multimodal and multilingual data from six patent authorities. The new patent test collection complements existing patent test collections, which are vertical (one domain or one authority over many years). Instead, the new collection is horizontal: it includes all technical domains from the major patenting authorities over the relatively short time span of two years. In addition to bringing together documents currently scattered across different test collections, the collection provides, for the first time, Korean documents, to complement those from Europe, US, Japan, and China. This new collection can be used on a variety of tasks beyond traditional information retrieval. We exemplify this with a task of high-relevance today: de-anonymisation.
Mihai Lupu, Alexandros Bampoulidis, Luca Papariello
SIGIR3