Demo Data from EDBT 2026 / reviewers in the wild / expert
Umar Islambekov
dblp:236/6922 · also Umar D. Islambekov
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-5103-3238ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2
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
2 papers |
Graph learning · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
topological data analysis |
0.6 | 1 | 2022 | A Computationally Efficient Framework for Vector Representation of Persistence Diagrams · J. Mach. Learn. Res. 2022 |
Computational geometry
topological data analysis |
0.6 | 1 | 2022 | A Computationally Efficient Framework for Vector Representation of Persistence Diagrams · J. Mach. Learn. Res. 2022 |
Machine learning › Graph learning › topological data analysis
topological descriptor |
0.4 | 1 | 2019 | ChainNet: Learning on Blockchain Graphs with Topological Features · ICDM 2019 |
Methods — techniques the papers use, named apart from their topics
vectorization · 1.1persistent homology · 0.8persistence diagrams · 0.6persistence diagram · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | A Computationally Efficient Framework for Vector Representation of Persistence DiagramsabstractIn Topological Data Analysis, a common way of quantifying the shape of data is to use a persistence diagram (PD). PDs are multisets of points in $R^2$ computed using tools of algebraic topology. However, this multi-set structure limits the utility of PDs in applications. Therefore, in recent years efforts have been directed towards extracting informative and efficient summaries from PDs to broaden the scope of their use for machine learning tasks. We propose a computationally efficient framework to convert a PD into a vector in $R^n$, called a vectorized persistence block (VPB). We show that our representation possesses many of the desired properties of vector-based summaries such as stability with respect to input noise, low computational cost and flexibility. Through simulation studies, we demonstrate the effectiveness of VPBs in terms of performance and computational cost for various learning tasks, namely clustering, classification and change point detection. Kit C. Chan, Umar Islambekov, Alexey Luchinsky, Rebecca Sanders |
J. Mach. Learn. Res. | 2 |
| 2020 | Dissecting Ethereum Blockchain Analytics: What We Learn from Topology and Geometry of the Ethereum Graph?abstractThe Blockchain technology and, in particular blockchain-based cryptocurrencies, offer us information that has never been seen before in the financial world. In contrast to fiat currencies, all transactions of crypto-currencies and crypto-tokens are permanently recorded on distributed ledgers and are publicly available. This allows us to construct a transaction graph and to assess not only its organization but to glean relationships between transaction graph properties and crypto price dynamics. The goal of this paper is to facilitate our understanding on horizons and limitations of what can be learned on crypto-tokens from local topology and geometry of the Ethereum transaction network whose even global network properties remain scarcely explored. By introducing novel tools based on Topological Data Analysis and Functional Data Depth into Blockchain Data Analytics, we show that Ethereum network (one of the most popular blockchains for creating new crypto-tokens) can provide critical insights on price changes of crypto-tokens that are otherwise largely inaccessible with conventional data sources and traditional analytic methods. Umar Islambekov, Cuneyt Gurcan Akcora, Ekaterina Smirnova, Yulia R. Gel, Murat Kantarcioglu |
SDM | 2 |
| 2019 | ChainNet: Learning on Blockchain Graphs with Topological FeaturesabstractWith emergence of blockchain technologies and the associated cryptocurrencies, such as Bitcoin, understanding network dynamics behind Blockchain graphs has become a rapidly evolving research direction. Unlike other financial networks, such as stock and currency trading, blockchain based cryptocurrencies have the entire transaction graph accessible to the public (i.e., all transactions can be downloaded and analyzed). A natural question is then to ask whether dynamics of the transaction graph impacts price of the underlying cryptocurrency. We show that standard graph features such as degree distribution of the transaction graph may not be sufficient to capture network dynamics and its potential impact on fluctuations of Bitcoin price. In contrast, topological features computed from the blockchain graph using the tools of persistent homology, are found to exhibit higher utility for predicting Bitcoin price dynamics. Nazmiye Ceren Abay, Cuneyt Gurcan Akcora, Yulia R. Gel, Murat Kantarcioglu, Umar Islambekov, Yahui Tian, Bhavani Thuraisingham |
ICDM | 5 |