Ilyes Abdelhamid
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ilyes Abdelhamid has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Carlo Vittorio Cannistraci
Tsinghua University, China
3 shared publications - Alessandro Muscoloni
Tsinghua University, China
2 shared publications - Aldo Acevedo
Technische Universität Dresden, Germany
1 shared publication - Armel Lefebvre
LIACS, Leiden University, Leiden, The Netherlands
1 shared publication - Junda Chen
Tsinghua University, China
1 shared publication - Yuchi Liu
Tsinghua University, China
1 shared publication
Latest Publications
- Open Access
- 1 September 2025
- Published by MDPI AG in Preprints.org
Hyperpathway: Visualizing Organization of Pathway-Molecule Enriched Interactions in Omics Studies via Hyperbolic Network Embedding
Pathway enrichment analysis (PEA) is fundamental for interpreting omics signatures. Standard PEA practice reduces results to tabular significance lists, where complex systems‑biology insights reside undisclosed. Here, we present Hyperpathway, an open-access network-based visualization webtool for PEA’s results interpretation. Given a table of statistically significant pathways and enriched molecules, Hyperpathway transforms this tabular information into a pathway–molecule bipartite network. Then it embeds the network into a two-dimensional hyperbolic disk, providing a holistic geometric representation of the nodes hierarchical organization along the radial coordinates, and the nodes similarity patterns along the angular coordinates. On genomic, metabolomic, and lipidomic datasets, Hyperpathway allows a deeper understanding of the interplay between pathways and their molecular components, facilitating the visualization and identification of latent functional systems biology modules not readable in conventional PEA tabular outputs. By bridging statistical enrichment analysis with network geometry, Hyperpathway advances pathway analysis from a list-based to a systems-level visualization paradigm.
- 1 September 2025
- Published by MDPI AG in Preprints.org
Open AccessHyperpathway: Visualizing Organization of Pathway-Molecule Enriched Interactions in Omics Studies via Hyperbolic Network Embedding
Pathway enrichment analysis (PEA) is fundamental for interpreting omics signatures. Standard PEA practice reduces results to tabular significance lists, where complex systems‑biology insights reside undisclosed. Here, we present Hyperpathway, an open-access network-based visualization webtool for PEA’s results interpretation. Given a table of statistically significant pathways and enriched molecules, Hyperpathway transforms this tabular information into a pathway–molecule bipartite network. Then it embeds the network into a two-dimensional hyperbolic disk, providing a holistic geometric representation of the nodes hierarchical organization along the radial coordinates, and the nodes similarity patterns along the angular coordinates. On genomic, metabolomic, and lipidomic datasets, Hyperpathway allows a deeper understanding of the interplay between pathways and their molecular components, facilitating the visualization and identification of latent functional systems biology modules not readable in conventional PEA tabular outputs. By bridging statistical enrichment analysis with network geometry, Hyperpathway advances pathway analysis from a list-based to a systems-level visualization paradigm.
- Open Access
- 22 July 2024
- Published by MDPI AG in Preprints.org
Generalizing the AUC-ROC for Unbalanced Data, Early Retrieval and Link Prediction Evaluation
The AUC-ROC is a widespread measure to assess the performance of a binary classification model across various discrimination thresholds. Yet, it is not apt for unbalanced class problems and is misleading for early retrieval. For instance, link prediction in complex networks is an unbalanced early retrieval problem, whose goal is to offer a ranking of the nonobserved network links, prioritizing a small cohort of positive links (for which we are sure the labels are reliable) on top of a list largely populated by unlabeled links (for which the labels are uncertain). Differently from binary classification, here the evaluation focuses on how the predictor prioritizes the positive class, because the negative class does not exist and is replaced by an unlabeled class. For decades, scholars have been investigating the necessity to correct and to generalize the AUC-ROC to work for both unbalanced classification and early retrieval evaluation, this is requested in many applied domains of computational science. Here we propose the area under the magnified ROC (AUC-mROC), a new measure that adjusts the standard AUC-ROC to work for unbalanced early retrieval problems such as link prediction. Finally, we introduce the area under the generalized ROC (AUC-gROC), which unifies both AUC-mROC and AUC-ROC to provide a universal and reliable evaluation measure that can work for both classification and early retrieval problems, regardless of class proportion.This discovery represents a critical achievement, culminating in success after decades of contentious research. Its solution promises to significantly impact various domains within applied computational science.
- 22 July 2024
- Published by MDPI AG in Preprints.org
Open AccessGeneralizing the AUC-ROC for Unbalanced Data, Early Retrieval and Link Prediction Evaluation
The AUC-ROC is a widespread measure to assess the performance of a binary classification model across various discrimination thresholds. Yet, it is not apt for unbalanced class problems and is misleading for early retrieval. For instance, link prediction in complex networks is an unbalanced early retrieval problem, whose goal is to offer a ranking of the nonobserved network links, prioritizing a small cohort of positive links (for which we are sure the labels are reliable) on top of a list largely populated by unlabeled links (for which the labels are uncertain). Differently from binary classification, here the evaluation focuses on how the predictor prioritizes the positive class, because the negative class does not exist and is replaced by an unlabeled class. For decades, scholars have been investigating the necessity to correct and to generalize the AUC-ROC to work for both unbalanced classification and early retrieval evaluation, this is requested in many applied domains of computational science. Here we propose the area under the magnified ROC (AUC-mROC), a new measure that adjusts the standard AUC-ROC to work for unbalanced early retrieval problems such as link prediction. Finally, we introduce the area under the generalized ROC (AUC-gROC), which unifies both AUC-mROC and AUC-ROC to provide a universal and reliable evaluation measure that can work for both classification and early retrieval problems, regardless of class proportion.This discovery represents a critical achievement, culminating in success after decades of contentious research. Its solution promises to significantly impact various domains within applied computational science.
- Open Access
Local-community network automata modelling based on length-three-paths for prediction of complex network structures in protein interactomes, food webs and more
From nests to nets intricate wiring diagrams surround the birth and the death of life. Here we show that the same rule of complex network self-organization is valid across different physical scales and allows to predict protein interactions, food web trophic relations and world trade network transitions. This rule, which we named CH2-L3, is a network automaton that is based on paths of length-three and that maximizes internal links in local communities and minimizes external ones, according to a mechanistic model essentially driven by topological neighbourhood information.
Open AccessLocal-community network automata modelling based on length-three-paths for prediction of complex network structures in protein interactomes, food webs and more
From nests to nets intricate wiring diagrams surround the birth and the death of life. Here we show that the same rule of complex network self-organization is valid across different physical scales and allows to predict protein interactions, food web trophic relations and world trade network transitions. This rule, which we named CH2-L3, is a network automaton that is based on paths of length-three and that maximizes internal links in local communities and minimizes external ones, according to a mechanistic model essentially driven by topological neighbourhood information.