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

Omar Maddouri

dblp:192/1408 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0003-0305-0348ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 75% Computational science and engineering · 25%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › clustering › exemplar-based clustering
affinity propagation
0.712023
Geometric Affinity Propagation for Clustering With Network Knowledge · IEEE Trans. Knowl. Data Eng. 2023
Data mining
clustering
0.712023
Geometric Affinity Propagation for Clustering With Network Knowledge · IEEE Trans. Knowl. Data Eng. 2023
Data mining › clustering
exemplar-based clustering
0.712023
Geometric Affinity Propagation for Clustering With Network Knowledge · IEEE Trans. Knowl. Data Eng. 2023
Data mining › clustering › constrained clustering
network-constrained clustering
0.712023
Geometric Affinity Propagation for Clustering With Network Knowledge · IEEE Trans. Knowl. Data Eng. 2023
Bioinformatics and computational biology › network bioinformatics › biological network analysis
biological knowledge graph
0.312017
Neuro-symbolic representation learning on biological knowledge graphs · Bioinform. 2017
Computational science and engineering › graph learning
link prediction
0.312017
Neuro-symbolic representation learning on biological knowledge graphs · Bioinform. 2017
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
knowledge graph embedding
0.112017
Neuro-symbolic representation learning on biological knowledge graphs · Bioinform. 2017

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

message passing · 0.7max-sum belief propagation · 0.7neuro-symbolic learning · 0.6knowledge representation · 0.6graph convolutional network · 0.6geometric deep learning · 0.6feature selection · 0.6automated reasoning · 0.6
YearPublicationVenuePosition
2023 Geometric Affinity Propagation for Clustering With Network Knowledge
abstract
Clustering data into meaningful subsets is a major task in scientific data analysis. To date, various strategies ranging from model-based approaches to data-driven schemes, have been devised for efficient and accurate clustering. One important class of clustering methods that is of a particular interest is the class of exemplar-based approaches. This interest primarily stems from the amount of compressed information encoded in these exemplars that effectively reflect the major characteristics of the corresponding clusters. Affinity propagation (AP) has proven to be a powerful exemplar-based approach that refines the set of optimal exemplars by iterative pairwise message updates. However, a critical limitation is its inability to capitalize on known networked relations between data points often available for various scientific datasets. To address this shortcoming, we propose Geometric-AP, a novel clustering algorithm that effectively extends the original AP to take advantage of the network topology. Geometric-AP obeys network constraints and uses max-sum belief propagation to leverage the available network topology for generating smooth clusters over the network. Extensive performance assessment shows that Geometric-AP leads to a significant quality enhancement of the clustering results when compared to existing schemes. Especially, we demonstrate that Geometric-AP performs extremely well even in cases where the original AP fails drastically.
Omar Maddouri, Xiaoning Qian, Byung-Jun Yoon
IEEE Trans. Knowl. Data Eng.1
2022 Deep graph representations embed network information for robust disease marker identification
abstract
MOTIVATION: Accurate disease diagnosis and prognosis based on omics data rely on the effective identification of robust prognostic and diagnostic markers that reflect the states of the biological processes underlying the disease pathogenesis and progression. In this article, we present GCNCC, a Graph Convolutional Network-based approach for Clustering and Classification, that can identify highly effective and robust network-based disease markers. Based on a geometric deep learning framework, GCNCC learns deep network representations by integrating gene expression data with protein interaction data to identify highly reproducible markers with consistently accurate prediction performance across independent datasets possibly from different platforms. GCNCC identifies these markers by clustering the nodes in the protein interaction network based on latent similarity measures learned by the deep architecture of a graph convolutional network, followed by a supervised feature selection procedure that extracts clusters that are highly predictive of the disease state. RESULTS: By benchmarking GCNCC based on independent datasets from different diseases (psychiatric disorder and cancer) and different platforms (microarray and RNA-seq), we show that GCNCC outperforms other state-of-the-art methods in terms of accuracy and reproducibility. AVAILABILITY AND IMPLEMENTATION: https://github.com/omarmaddouri/GCNCC. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Omar Maddouri, Xiaoning Qian, Byung-Jun Yoon
Bioinform.1
2017 Neuro-symbolic representation learning on biological knowledge graphs
abstract
MOTIVATION: Biological data and knowledge bases increasingly rely on Semantic Web technologies and the use of knowledge graphs for data integration, retrieval and federated queries. In the past years, feature learning methods that are applicable to graph-structured data are becoming available, but have not yet widely been applied and evaluated on structured biological knowledge. Results: We develop a novel method for feature learning on biological knowledge graphs. Our method combines symbolic methods, in particular knowledge representation using symbolic logic and automated reasoning, with neural networks to generate embeddings of nodes that encode for related information within knowledge graphs. Through the use of symbolic logic, these embeddings contain both explicit and implicit information. We apply these embeddings to the prediction of edges in the knowledge graph representing problems of function prediction, finding candidate genes of diseases, protein-protein interactions, or drug target relations, and demonstrate performance that matches and sometimes outperforms traditional approaches based on manually crafted features. Our method can be applied to any biological knowledge graph, and will thereby open up the increasing amount of Semantic Web based knowledge bases in biology to use in machine learning and data analytics. AVAILABILITY AND IMPLEMENTATION: https://github.com/bio-ontology-research-group/walking-rdf-and-owl. CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Mona Alshahrani, Mohammad Asif Khan 0001, Omar Maddouri, Akira R. Kinjo, Núria Queralt-Rosinach, Robert Hoehndorf
Bioinform.3