KEMP-PIP: A Feature-Fusion Based Approach for Pro-inflammatory Peptide Prediction

• URL: http://arxiv.org/abs/2602.20198v1
• Date: Sun, 22 Feb 2026 08:09:01 GMT
• Title: KEMP-PIP: A Feature-Fusion Based Approach for Pro-inflammatory Peptide Prediction
• Abstract summary: KEMP-PIP is a hybrid machine learning framework that integrates deep protein embeddings with handcrafted descriptors for robust PIP prediction.<n>Our approach combines contextual embeddings from pretrained ESM protein language models with multi-scale k-mer frequencies, physicochemical descriptors, and modlAMP sequence features.<n>On the standard benchmark dataset, KEMP-PIP achieves an MCC of 0.505, accuracy of 0.752, and AUC of 0.762, outperforming ProIn-fuse, MultiFeatVotPIP, and StackPIP.
• Score: 1.0131895986034314
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Pro-inflammatory peptides (PIPs) play critical roles in immune signaling and inflammation but are difficult to identify experimentally due to costly and time-consuming assays. To address this challenge, we present KEMP-PIP, a hybrid machine learning framework that integrates deep protein embeddings with handcrafted descriptors for robust PIP prediction. Our approach combines contextual embeddings from pretrained ESM protein language models with multi-scale k-mer frequencies, physicochemical descriptors, and modlAMP sequence features. Feature pruning and class-weighted logistic regression manage high dimensionality and class imbalance, while ensemble averaging with an optimized decision threshold enhances the sensitivity--specificity balance. Through systematic ablation studies, we demonstrate that integrating complementary feature sets consistently improves predictive performance. On the standard benchmark dataset, KEMP-PIP achieves an MCC of 0.505, accuracy of 0.752, and AUC of 0.762, outperforming ProIn-fuse, MultiFeatVotPIP, and StackPIP. Relative to StackPIP, these results represent improvements of 9.5% in MCC and 4.8% in both accuracy and AUC. The KEMP-PIP web server is freely available at https://nilsparrow1920-kemp-pip.hf.space/ and the full implementation at https://github.com/S18-Niloy/KEMP-PIP.

Related papers

• LeNEPA: No-Augmentation Next-Latent Prediction for Time-Series Representation Learning [59.34593956287438]
  We study how an SSL recipe behaves when its method-specific configuration is reused unchanged after the pretraining signal family changes.<n>We introduce Latent Euclidean Next-Embedding Prediction Architecture (LeNEPA)<n>LeNEPA replaces the stop-gradient/EMA stabilization used by vanilla NEPA with SIGReg-based isotropy regularization.
  arXiv  Detail & Related papers  (2026-07-01T13:56:21Z)
• An Integrated Deep-Learning Framework for Peptide-Protein Interaction Prediction and Target-Conditioned Peptide Generation with ConGA-PepPI and TC-PepGen [2.9196005639424647]
  We present an integrated framework for early-stage peptide screening.<n>The framework combines a partner-aware prediction and localization model (ConGA-PepPI) with a target-conditioned generative model (TC-PepGen)<n>In five-fold cross-validation, ConGA-PepPI achieved 0.839 accuracy and 0.921 AUROC, with binding-site AUPR values of 0.601 on the protein side and 0.950 on the peptide side.
  arXiv  Detail & Related papers  (2026-04-20T16:20:23Z)
• QSMOTE-PGM/kPGM: QSMOTE Based PGM and kPGM for Imbalanced Dataset Classification [0.5505634045241289]
  We build on developments in kernelized PGM (KPGM) and direct PGM-based classifiers.<n>We analyze their performance across synthetic oversampling scenarios using Quantum SMOTE (QSMOTE) variants.
  arXiv  Detail & Related papers  (2025-12-18T07:36:26Z)
• Score-Based Turbo Message Passing for Plug-and-Play Compressive Imaging [45.77515171733844]
  We devise an algorithm that integrates a score-based minimum mean-squared error (MMSE) denoiser for compressive image recovery.<n>The resulting algorithm, named score-based turbo message passing (STMP), combines the fast convergence of message passing with the power of score-based generative priors.
  arXiv  Detail & Related papers  (2025-12-16T14:24:12Z)
• CHIPS: Efficient CLIP Adaptation via Curvature-aware Hybrid Influence-based Data Selection [41.61500990573312]
  Adapting CLIP to vertical domains is typically approached by novel fine-tuning strategies or by continual pre-training (CPT) on large domain-specific datasets.<n>We revisit this task from a data-centric perspective: Can effective data selection substitute for large-scale datasets in CPT?<n>We introduce CHIPS (Curvature-aware Hybrid Influence in Projection Subspace), which assigns each image-text pair a utility score that integrates three complementary factors aligned with three goals.
  arXiv  Detail & Related papers  (2025-11-23T16:25:42Z)
• DeepBlip: Estimating Conditional Average Treatment Effects Over Time [48.20988325299593]
  We propose DeepBlip, the first neural framework for structural nested mean models (SNMMs)<n>Our method correctly adjusts for time-varying confounding to produce unbiased estimates, and its Neyman-orthogonal loss function ensures robustness to nuisance model misspecification.
  arXiv  Detail & Related papers  (2025-11-18T14:49:03Z)
• PPMStereo: Pick-and-Play Memory Construction for Consistent Dynamic Stereo Matching [51.98089287914147]
  textbfPick-and-textbflay textbfMemory (PM) construction module for dynamic bfStereo matching, dubbed as bftextPPMStereo.<n>Inspired by the two-stage decision-making process in humans, we propose a textbfPick-and-textbflay textbfMemory (PM) construction module for dynamic bfStereo matching, dubbed as bftextPPMStereo.
  arXiv  Detail & Related papers  (2025-10-23T03:52:39Z)
• MCTS-EP: Empowering Embodied Planning with Online Preference Optimization [42.11570460915765]
  This paper introduces MCTS-EP, an online learning framework that combines large language models (LLM) with Monte Carlo Tree Search (MCTS) for training embodied agents.<n>We theoretically prove that MCTS-EP achieves better performance bounds than conventional on-policy algorithms when the loss function is strongly convex.
  arXiv  Detail & Related papers  (2025-09-21T15:17:44Z)
• ResCap-DBP: A Lightweight Residual-Capsule Network for Accurate DNA-Binding Protein Prediction Using Global ProteinBERT Embeddings [9.626183317998143]
  We propose a novel deep learning framework, ResCap-DBP, that combines a residual learning-based encoder with a one-dimensional Capsule Network.<n>ProteinBERT embeddings substantially outperform other representations on large datasets.<n>Our model consistently outperforms current state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-07-27T21:54:32Z)
• Relative Entropy Pathwise Policy Optimization [66.03329137921949]
  We present an on-policy algorithm that trains Q-value models purely from on-policy trajectories.<n>We show how to combine policies for exploration with constrained updates for stable training, and evaluate important architectural components that stabilize value function learning.
  arXiv  Detail & Related papers  (2025-07-15T06:24:07Z)
• PRING: Rethinking Protein-Protein Interaction Prediction from Pairs to Graphs [88.98041407783502]
  PRING is the first benchmark that evaluates protein-protein interaction prediction from a graph-level perspective.<n> PRING curates a high-quality, multi-species PPI network dataset comprising 21,484 proteins and 186,818 interactions.
  arXiv  Detail & Related papers  (2025-07-07T15:21:05Z)
• A Quad-Step Approach to Uncertainty-Aware Deep Learning for Skin Cancer Classification [13.993637404760355]
  Deep learning models have shown promise in automating skin cancer classification.<n>However, challenges remain due to data scarcity and limited uncertainty awareness.<n>This study presents a comprehensive evaluation of DL-based skin lesion classification on the HAM10000 dataset.
  arXiv  Detail & Related papers  (2025-06-12T02:29:16Z)
• Beyond Simple Concatenation: Fairly Assessing PLM Architectures for Multi-Chain Protein-Protein Interactions Prediction [0.2509487459755192]
  Protein-protein interactions (PPIs) are fundamental to numerous cellular processes.<n>PLMs have demonstrated remarkable success in predicting protein structure and function.<n>Their application to sequence-based PPI binding affinity prediction remains relatively underexplored.
  arXiv  Detail & Related papers  (2025-05-26T14:23:08Z)
• SCMPPI: Supervised Contrastive Multimodal Framework for Predicting Protein-Protein Interactions [0.0]
  We propose SCMPPI, a novel supervised contrastive multimodal framework for protein-protein interaction prediction.<n> experiments on eight benchmark datasets demonstrate its state-of-the-art accuracy(98.13%) and AUC(99.69%), along with excellent cross-species generalization.<n>Successful applications in CD9 networks, Wnt pathway analysis, and cancer-specific networks further highlight its potential for disease target discovery.
  arXiv  Detail & Related papers  (2025-04-03T15:34:02Z)
• A general language model for peptide identification [3.856457290796735]
  PDeepPP is a unified deep learning framework that integrates pretrained protein language models with a hybrid transformer-convolutional architecture.<n>By enabling large-scale, accurate peptide analysis, PDeepPP supports biomedical research and the discovery of novel therapeutic targets for disease treatment.
  arXiv  Detail & Related papers  (2025-02-21T17:31:22Z)
• Pointer Networks with Q-Learning for Combinatorial Optimization [55.2480439325792]
  We introduce the Pointer Q-Network (PQN), a hybrid neural architecture that integrates model-free Q-value policy approximation with Pointer Networks (Ptr-Nets) Our empirical results demonstrate the efficacy of this approach, also testing the model in unstable environments.
  arXiv  Detail & Related papers  (2023-11-05T12:03:58Z)
• CLIP Itself is a Strong Fine-tuner: Achieving 85.7% and 88.0% Top-1 Accuracy with ViT-B and ViT-L on ImageNet [139.56863124214905]
  We find that fine-tuning performance of CLIP is substantially underestimated. Specifically, CLIP ViT-Base/16 and CLIP ViT-Large/14 can achieve 85.7%,88.0% finetuning Top-1 accuracy on the ImageNet-1K dataset.
  arXiv  Detail & Related papers  (2022-12-12T18:59:59Z)
• PACOH: Bayes-Optimal Meta-Learning with PAC-Guarantees [77.67258935234403]
  We provide a theoretical analysis using the PAC-Bayesian framework and derive novel generalization bounds for meta-learning. We develop a class of PAC-optimal meta-learning algorithms with performance guarantees and a principled meta-level regularization.
  arXiv  Detail & Related papers  (2020-02-13T15:01:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.