Funmilola Mary Taiwo

dblp:366/5411 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 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.

Artificial intelligence
1 paper
Graph learning · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
network embedding
0.912025
TopER: Topological Embeddings in Graph Representation Learning · NeurIPS 2025
Machine learning › Graph learning
topological embedding
0.912025
TopER: Topological Embeddings in Graph Representation Learning · NeurIPS 2025
Visualization and visual analytics
graph visualization
0.912025
TopER: Topological Embeddings in Graph Representation Learning · NeurIPS 2025
Visualization and visual analytics
topological data analysis
0.912025
TopER: Topological Embeddings in Graph Representation Learning · NeurIPS 2025
Data mining › structured data mining › graph mining › graph learning
graph classification
0.312025
TopER: Topological Embeddings in Graph Representation Learning · NeurIPS 2025
Data mining › clustering
graph clustering
0.312025
TopER: Topological Embeddings in Graph Representation Learning · NeurIPS 2025

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

topological evolution rate · 2.6persistent homology · 2.6
YearPublicationVenuePosition
2025 TopER: Topological Embeddings in Graph Representation Learning
abstract
Graph embeddings play a critical role in graph representation learning, allowing machine learning models to explore and interpret graph-structured data. However, existing methods often rely on opaque, high-dimensional embeddings, limiting interpretability and practical visualization. In this work, we introduce Topological Evolution Rate (TopER), a novel, low-dimensional embedding approach grounded in topological data analysis. TopER simplifies a key topological approach, Persistent Homology, by calculating the evolution rate of graph substructures, resulting in intuitive and interpretable visualizations of graph data. This approach not only enhances the exploration of graph datasets but also delivers competitive performance in graph clustering and classification tasks. Our TopER-based models achieve or surpass state-of-the-art results across molecular, biological, and social network datasets in tasks such as classification, clustering, and visualization.
Astrit Tola, Funmilola Mary Taiwo, Cuneyt Gurcan Akcora, Baris Coskunuzer
NeurIPS2