Demo Data from EDBT 2026 / reviewers in the wild / expert
Guangyao Xu
dblp:214/1983
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2023
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Kernel, tree and ensemble methods · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Kernel, tree and ensemble methods
decision tree |
0.7 | 1 | 2023 | Decision Tree for Sequences · IEEE Trans. Knowl. Data Eng. 2023 |
Data mining › predictive modeling › classification › structured classification
sequence classification |
0.7 | 1 | 2023 | Decision Tree for Sequences · IEEE Trans. Knowl. Data Eng. 2023 |
Methods — techniques the papers use, named apart from their topics
subsequence feature construction · 1.3decision tree induction · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Decision Tree for SequencesabstractCurrent decision trees such as C4.5 and CART are widely used in different fields due to their simplicity, accuracy and intuitive interpretation. Similar to other popular classifiers, these tree-based classification algorithms are developed for fixed-length vector data and suffer from intrinsic limitations in handling complex data such as sequences. To tackle the discrete sequence classification task, the dominant strategy is to adopt a two-step procedure: first transform the sequential dataset into a vector dataset and then apply existing tree-based classifiers on the new vector data. However, such methods are highly dependent on the feature generation procedure and some features that are critical to the tree construction may be missed. To alleviate these issues, we present a new tree-based sequence classification method, which is able to construct a concise decision tree from the feature space that is composed of all subsequences present in the training sequences. Experimental results on fourteen real datasets show that our method can achieve better performance than those state-of-the-art sequence classification algorithms. The source codes of our method are available at: https://github.com/ZiyaoWu/SeqDT. Zengyou He, Ziyao Wu, Guangyao Xu, Yan Liu 0085, Quan Zou 0001 |
IEEE Trans. Knowl. Data Eng. | 3 |
| 2021 | 3DGAM: using 3D gesture and CAD models for training on mixed reality remote collaboration
Peng Wang 0083, Xiaoliang Bai, Mark Billinghurst, Shusheng Zhang, Sili Wei, Guangyao Xu, Weiping He, Xiangyu Zhang 0009, Jie Zhang 0102 |
Multim. Tools Appl. | 6 |
| 2020 | Early Detection of Smart Ponzi Scheme Contracts Based on Behavior Forest SimilarityabstractSmart contracts empowered by blockchains often manage digital assets in a distributed and decentralized environment. People believe in smart contracts based on these new technologies. Unfortunately, malicious smart contacts, such as smart Ponzi scheme contracts (ponzitracts, for short), pose risk. Existing techniques detect ponzitracts by analyzing the code as well as a large amount of transaction data after time-consuming deployment. However, a conclusion based on transaction data can only be gotten after the damage has been caused. This paper proposes PonziDetector, a ponzitract detection technique that does not rely on transaction data. Behavior forest is introduced into PonziDetector to capture dynamic behaviors of smart contracts during interacting with them, which makes it possible to early detect ponzitracts. The empirical study demonstrates that PonziDetector, without transaction data, can improve the precision and the recall of the state-of-the-art to 94.6% and 93.0% respectively. This means that PonziDetector can avoid potential losses by early detecting ponzitracts. Weisong Sun, Guangyao Xu, Zijiang Yang 0006, Zhenyu Chen 0001 |
QRS | 2 |