Demo Data from EDBT 2026 / reviewers in the wild / expert
Wei Guo 0008
dblp:71/6601-8
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-6186-5951ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-author
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 |
Image recognition and object detection · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Image recognition and object detection
image classification |
0.3 | 1 | 2018 | Sparse-TDA: Sparse Realization of Topological Data Analysis for Multi-Way Classification · IEEE Trans. Knowl. Data Eng. 2018 |
Computer vision › Image recognition and object detection
texture classification |
0.3 | 1 | 2018 | Sparse-TDA: Sparse Realization of Topological Data Analysis for Multi-Way Classification · IEEE Trans. Knowl. Data Eng. 2018 |
Data mining
topological data analysis |
0.3 | 1 | 2018 | Sparse-TDA: Sparse Realization of Topological Data Analysis for Multi-Way Classification · IEEE Trans. Knowl. Data Eng. 2018 |
Methods — techniques the papers use, named apart from their topics
sparse sampling · 0.7QR pivoting · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Sparse-TDA: Sparse Realization of Topological Data Analysis for Multi-Way ClassificationabstractTopological data analysis (TDA) has emerged as one of the most promising techniques to reconstruct the unknown shapes of high-dimensional spaces from observed data samples. TDA, thus, yields key shape descriptors in the form of persistent topological features that can be used for any supervised or unsupervised learning task, including multi-way classification. Sparse sampling, on the other hand, provides a highly efficient technique to reconstruct signals in the spatial-temporal domain from just a few carefully-chosen samples. Here, we present a new method, referred to as the Sparse-TDA algorithm, that combines favorable aspects of the two techniques. This combination is realized by selecting an optimal set of sparse pixel samples from the persistent features generated by a vector-based TDA algorithm. These sparse samples are selected from a low-rank matrix representation of persistent features using QR pivoting. We show that the Sparse-TDA method demonstrates promising performance on three benchmark problems related to human posture recognition and image texture classification. Wei Guo 0008, Krithika Manohar, Steven L. Brunton, Ashis Gopal Banerjee |
IEEE Trans. Knowl. Data Eng. | 1 |