Giorgio Valentini

Dr. Giorgio Valentini

Computer Science Department “Giovanni degli Antoni”, Università degli Studi di Milano, 20133 Milan, Italy
orcid

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
7 September 2016 in Genome Biology
Verified
Journal Article
Open access
PDF file
YJYuxiang Jiang
Yuxiang Jiang
TOTal Ronnen Oron
Tal Ronnen Oron
WCWyatt T. Clark
Wyatt T. Clark
ABAsma R. Bankapur
Asma R. Bankapur
DDDaniel D’aNdrea
Daniel D’aNdrea
PRPredrag Radivojac
Predrag Radivojac
A major bottleneck in our understanding of the molecular underpinnings of life is the assignment of function to proteins. While molecular experiments provide the most reliable annotation of proteins, their relatively low throughput and restricted purview have led to an increasing role for computational function prediction. However, assessing methods for protein function prediction and tracking progress in the field remain challenging. We conducted the second critical assessment of functional annotation (CAFA), a timed challenge to assess computational methods that automatically assign protein function. We evaluated 126 methods from 56 research groups for their ability to predict biological functions using Gene Ontology and gene-disease associations using Human Phenotype Ontology on a set of 3681 proteins from 18 species. CAFA2 featured expanded analysis compared with CAFA1, with regards to data set size, variety, and assessment metrics. To review progress in the field, the analysis compared the best methods from CAFA1 to those of CAFA2. The top-performing methods in CAFA2 outperformed those from CAFA1. This increased accuracy can be attributed to a combination of the growing number of experimental annotations and improved methods for function prediction. The assessment also revealed that the definition of top-performing algorithms is ontology specific, that different performance metrics can be used to probe the nature of accurate predictions, and the relative diversity of predictions in the biological process and human phenotype ontologies. While there was methodological improvement between CAFA1 and CAFA2, the interpretation of results and usefulness of individual methods remain context-dependent.

1 September 2016 in The American Journal of Human Genetics
Verified
Journal Article
Closed access
DSDamian Smedley
Damian Smedley
MSMax Schubach
Max Schubach
JJJulius Jacobsen
Julius Jacobsen
SKSebastian Köhler
Sebastian Köhler
TZTomasz Zemojtel
Tomasz Zemojtel
PRPeter N. Robinson
Peter N. Robinson

26 September 2002
Verified
Book Chapter
Closed access
PDF file
Giorgio ValentiniGiorgio Valentini
Giorgio Valentini
FMFrancesco Masulli
Francesco Masulli

20 May 2010 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
Giorgio ValentiniGiorgio Valentini
Giorgio Valentini
Gene function prediction is a complex computational problem, characterized by several items: the number of functional classes is large, and a gene may belong to multiple classes; functional classes are structured according to a hierarchy; classes are usually unbalanced, with more negative than positive examples; class labels can be uncertain and the annotations largely incomplete; to improve the predictions, multiple sources of data need to be properly integrated. In this contribution, we focus on the first three items, and, in particular, on the development of a new method for the hierarchical genome-wide and ontology-wide gene function prediction. The proposed algorithm is inspired by the “true path rule” (TPR) that governs both the Gene Ontology and FunCat taxonomies. According to this rule, the proposed TPR ensemble method is characterized by a two-way asymmetric flow of information that traverses the graph-structured ensemble: positive predictions for a node influence in a recursive way its ancestors, while negative predictions influence its offsprings. Cross-validated results with the model organism S. Crevisiae, using seven different sources of biomolecular data, and a theoretical analysis of the the TPR algorithm show the effectiveness and the drawbacks of the proposed approach.

1 February 2009 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
Roberto AvogadriRoberto Avogadri
Roberto Avogadri
Giorgio ValentiniGiorgio Valentini
Giorgio Valentini

7 June 2017 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MSMax Schubach
Max Schubach
MRMatteo Re
Matteo Re
PRPeter N. Robinson
Peter N. Robinson
Giorgio ValentiniGiorgio Valentini
Giorgio Valentini
Disease and trait-associated variants represent a tiny minority of all known genetic variation, and therefore there is necessarily an imbalance between the small set of available disease-associated and the much larger set of non-deleterious genomic variation, especially in non-coding regulatory regions of human genome. Machine Learning (ML) methods for predicting disease-associated non-coding variants are faced with a chicken and egg problem - such variants cannot be easily found without ML, but ML cannot begin to be effective until a sufficient number of instances have been found. Most of state-of-the-art ML-based methods do not adopt specific imbalance-aware learning techniques to deal with imbalanced data that naturally arise in several genome-wide variant scoring problems, thus resulting in a significant reduction of sensitivity and precision. We present a novel method that adopts imbalance-aware learning strategies based on resampling techniques and a hyper-ensemble approach that outperforms state-of-the-art methods in two different contexts: the prediction of non-coding variants associated with Mendelian and with complex diseases. We show that imbalance-aware ML is a key issue for the design of robust and accurate prediction algorithms and we provide a method and an easy-to-use software tool that can be effectively applied to this challenging prediction task.