4.6 Article

Improved multi-level protein-protein interaction prediction with semantic-based regularization

期刊

BMC BIOINFORMATICS
卷 15, 期 -, 页码 -

出版社

BMC
DOI: 10.1186/1471-2105-15-103

关键词

-

资金

  1. Italian Ministry of University and Research and by a Google Faculty Research [PRIN 2009LNP494]

向作者/读者索取更多资源

Background: Protein-protein interactions can be seen as a hierarchical process occurring at three related levels: proteins bind by means of specific domains, which in turn form interfaces through patches of residues. Detailed knowledge about which domains and residues are involved in a given interaction has extensive applications to biology, including better understanding of the binding process and more efficient drug/enzyme design. Alas, most current interaction prediction methods do not identify which parts of a protein actually instantiate an interaction. Furthermore, they also fail to leverage the hierarchical nature of the problem, ignoring otherwise useful information available at the lower levels; when they do, they do not generate predictions that are guaranteed to be consistent between levels. Results: Inspired by earlier ideas of Yip et al. (BMC Bioinformatics 10: 241, 2009), in the present paper we view the problem as a multi-level learning task, with one task per level (proteins, domains and residues), and propose a machine learning method that collectively infers the binding state of all object pairs. Our method is based on Semantic Based Regularization (SBR), a flexible and theoretically sound machine learning framework that uses First Order Logic constraints to tie the learning tasks together. We introduce a set of biologically motivated rules that enforce consistent predictions between the hierarchy levels. Conclusions: We study the empirical performance of our method using a standard validation procedure, and compare its performance against the only other existing multi-level prediction technique. We present results showing that our method substantially outperforms the competitor in several experimental settings, indicating that exploiting the hierarchical nature of the problem can lead to better predictions. In addition, our method is also guaranteed to produce interactions that are consistent with respect to the protein-domain-residue hierarchy.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Artificial Intelligence

Learning Modulo Theories for constructive preference elicitation

Paolo Campigotto, Stefano Teso, Roberto Battiti, Andrea Passerini

Summary: CLEO is a preference elicitation algorithm that recommends optimal configurations in hybrid domains through interactive optimization, incorporating Max-SMT technology and learning to rank implementation, adapting to uncertainty in the decision maker's utility and noisy feedback.

ARTIFICIAL INTELLIGENCE (2021)

Article Mathematics, Interdisciplinary Applications

Putting human behavior predictability in context

Wanyi Zhang, Qiang Shen, Stefano Teso, Bruno Lepri, Andrea Passerini, Ivano Bison, Fausto Giunchiglia

Summary: Various studies have investigated the predictability of different aspects of human behavior such as mobility patterns, social interactions, and shopping and online behaviors. The key assumption is that human behavior is deliberated based on an individual's own perception of the situation. Contextual dimensions like time, location, activity, and social ties play a significant role in the predictability of individuals' behaviors, with multi-modality information being crucial for accurate predictions.

EPJ DATA SCIENCE (2021)

Article Computer Science, Artificial Intelligence

An efficient procedure for mining egocentric temporal motifs

Antonio Longa, Giulia Cencetti, Bruno Lepri, Andrea Passerini

Summary: This study introduces a technique based on egocentric temporal neighborhoods to extract temporal motifs in temporal networks, bypassing the graph isomorphism problem and enabling the algorithm to mine larger motifs. By focusing on the temporal dynamics of interactions of specific nodes, the method allows for the extraction of interpretable temporal motifs.

DATA MINING AND KNOWLEDGE DISCOVERY (2022)

Article Computer Science, Artificial Intelligence

Skeptical Learning-An Algorithm and a Platform for Dealing with Mislabeling in Personal Context Recognition

Wanyi Zhang, Mattia Zeni, Andrea Passerini, Fausto Giunchiglia

Summary: Mobile Crowd Sensing (MCS) integrates sensor data and user-generated content in the IoT paradigm. The poor quality of human-provided content, mainly due to inaccurate input, is a major challenge. This paper presents Skeptical Learning, an algorithm that checks and fixes user feedback to address this issue. The results demonstrate the algorithm's advantages in dealing with mislabeling problems and improving prediction performance.

ALGORITHMS (2022)

Article Computer Science, Artificial Intelligence

Human-in-the-loop handling of knowledge drift

Andrea Bontempelli, Fausto Giunchiglia, Andrea Passerini, Stefano Teso

Summary: Knowledge drift is a special form of concept drift that occurs in hierarchical classification, where changes in concept vocabulary, distributions, and relations can affect classification accuracy. Identifying the type of knowledge drift is crucial for improving classifier performance, and involving users in interactive disambiguation can lead to significant enhancements in prediction accuracy.

DATA MINING AND KNOWLEDGE DISCOVERY (2022)

Article Computer Science, Artificial Intelligence

Learning MAX-SAT from contextual examples for combinatorial optimisation

Mohit Kumar, Samuel Kolb, Stefano Teso, Luc De Raedt

Summary: Combinatorial optimisation problems are common in artificial intelligence. This study introduces a novel approach for learning these problems from contextual examples using the MAX-SAT formalism. Theoretical results show that high-quality MAX-SAT models can be learned from contextual examples, as long as the data satisfies a representativeness condition.

ARTIFICIAL INTELLIGENCE (2023)

Article Computer Science, Artificial Intelligence

Synthesizing explainable counterfactual policies for algorithmic recourse with program synthesis

Giovanni De Toni, Bruno Lepri, Andrea Passerini

Summary: This paper proposes a new approach that learns a program to generate explainable counterfactual actions, aiming to provide explanations on how to change unfavourable decisions made by a black-box machine learning model. The approach leverages program synthesis techniques, reinforcement learning with Monte Carlo Tree Search, and rule learning to extract explanations for each recommended action. Experimental evaluation shows that the proposed approach, FARE (eFficient counterfActual REcourse), generates effective interventions with significantly fewer queries to the black-box classifier compared to existing solutions, while providing interpretable explanations.

MACHINE LEARNING (2023)

Article Psychology, Experimental

Sensory and multisensory reasoning: Is Bayesian updating modality-dependent?

Stefano Fait, Stefania Pighin, Andrea Passerini, Francesco Pavani, Katya Tentori

Summary: Bayesianism assumes that probabilistic updating is independent of information modality. This study investigates whether probability judgments based on visual and auditory information conform to this assumption. The results show that when information is acquired through a single modality, probabilistic updating is consistent with Bayesianism. However, when information comes from multiple modalities, there is a synergy-contrast effect where judgments are more accurate when visual and auditory information individually and jointly support the hypothesis than when they support different hypotheses.

COGNITION (2023)

Proceedings Paper Computer Science, Information Systems

Generalising via Meta-examples for Continual Learning in the Wild

Alessia Bertugli, Stefano Vincenzi, Simone Calderara, Andrea Passerini

Summary: FUSION is a learning strategy that enables a neural network to learn quickly and continually on unlabelled data streams and unbalanced tasks, maximizing knowledge extraction and utilizing supervised information when available.

MACHINE LEARNING, OPTIMIZATION, AND DATA SCIENCE, LOD 2022, PT I (2023)

Article Mathematics, Interdisciplinary Applications

Adaptation of student behavioural routines during Covid-19: a multimodal approach

Nicolo Alessandro Girardini, Simone Centellegher, Andrea Passerini, Ivano Bison, Fausto Giunchiglia, Bruno Lepri

Summary: This study analyzes the changes in students' behavior during the COVID-19 pandemic. By comparing the qualitative and quantitative differences in their daily routines between 2018 and 2020, the study finds that despite restrictions, there are minimal changes in the activities performed by students, but adaptation primarily occurs in the location and sociality dimensions.

EPJ DATA SCIENCE (2023)

Review Microbiology

Machine learning for microbiologists

Francesco Asnicar, Andrew Maltez Thomas, Andrea Passerini, Levi Waldron, Nicola Segata

Summary: This article reviews the importance and applications of machine learning in microbiology, including tasks such as predicting antibiotic resistance and associating with host diseases. It provides a basic toolbox for microbiologists to understand and apply machine learning.

NATURE REVIEWS MICROBIOLOGY (2023)

Proceedings Paper Computer Science, Artificial Intelligence

Catastrophic Forgetting in Continual Concept Bottleneck Models

Emanuele Marconato, Gianpaolo Bontempo, Stefano Teso, Elisa Ficarra, Simone Calderara, Andrea Passerini

Summary: This paper analyzes the issue of Catastrophic Forgetting in Deep Learning models during continual learning and investigates the effect of high-level feature supervision on this problem. Two metrics are introduced to evaluate the loss of information on learned concepts as new experiences are encountered. Additionally, the paper shows that saliency maps remain more stable with attribute supervision.

IMAGE ANALYSIS AND PROCESSING, ICIAP 2022 WORKSHOPS, PT II (2022)

Article Ethics

Give more data, awareness and control to individual citizens, and they will help COVID-19 containment

Mirco Nanni, Gennady Andrienko, Albert-Laszlo Barabasi, Chiara Boldrini, Francesco Bonchi, Ciro Cattuto, Francesca Chiaromonte, Giovanni Comande, Marco Conti, Mark Cote, Frank Dignum, Virginia Dignum, Josep Domingo-Ferrer, Paolo Ferragina, Fosca Giannotti, Riccardo Guidotti, Dirk Helbing, Kimmo Kaski, Janos Kertesz, Sune Lehmann, Bruno Lepri, Paul Lukowicz, Stan Matwin, David Megias Jimenez, Anna Monreale, Katharina Morik, Nuria Oliver, Andrea Passarella, Andrea Passerini, Dino Pedreschi, Alex Pentland, Fabio Pianesi, Francesca Pratesi, Salvatore Rinzivillo, Salvatore Ruggieri, Arno Siebes, Vicenc Torra, Roberto Trasarti, Jeroen van den Hoven, Alessandro Vespignani

Summary: The rapid spread of COVID-19 requires quick and effective tracking of virus transmission chains and early detection of outbreaks, especially as lockdown measures are lifted. A decentralized approach to contact-tracing apps offers better protection of citizens' privacy and allows for detailed information gathering for infected individuals in a privacy-preserving manner, enabling more effective contact tracing and early detection of outbreak hotspots.

ETHICS AND INFORMATION TECHNOLOGY (2021)

暂无数据