Demo Data from EDBT 2026 / reviewers in the wild / expert
Jiannan Xiao
dblp:173/4952
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1
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.
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Web and social media mining · 50% Data mining · 50% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › visual analytics
machine learning visualization |
0.3 | 1 | 2018 | Visual Diagnosis of Tree Boosting Methods · IEEE Trans. Vis. Comput. Graph. 2018 |
Web and social media mining
information diffusion |
0.2 | 1 | 2016 | Tracking Idea Flows between Social Groups · AAAI 2016 |
Data mining › time series analysis
lag correlation detection |
0.2 | 1 | 2016 | Tracking Idea Flows between Social Groups · AAAI 2016 |
Methods — techniques the papers use, named apart from their topics
tree visualization · 0.3temporal confusion matrix visualization · 0.3t-SNE projection · 0.3tensor decomposition · 0.2dynamic time warping · 0.2bayesian conditional cointegration · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Visual Diagnosis of Tree Boosting MethodsabstractTree boosting, which combines weak learners (typically decision trees) to generate a strong learner, is a highly effective and widely used machine learning method. However, the development of a high performance tree boosting model is a time-consuming process that requires numerous trial-and-error experiments. To tackle this issue, we have developed a visual diagnosis tool, BOOSTVis, to help experts quickly analyze and diagnose the training process of tree boosting. In particular, we have designed a temporal confusion matrix visualization, and combined it with a t-SNE projection and a tree visualization. These visualization components work together to provide a comprehensive overview of a tree boosting model, and enable an effective diagnosis of an unsatisfactory training process. Two case studies that were conducted on the Otto Group Product Classification Challenge dataset demonstrate that BOOSTVis can provide informative feedback and guidance to improve understanding and diagnosis of tree boosting algorithms. Shixia Liu, Jiannan Xiao, Xiting Wang, Jing Wu 0004, Jun Zhu 0001 |
IEEE Trans. Vis. Comput. Graph. | 2 |
| 2016 | Tracking Idea Flows between Social GroupsabstractIn many applications, ideas that are described by a set of words often flow between different groups. To facilitate users in analyzing the flow, we present a method to model the flow behaviors that aims at identifying the lead-lag relationships between word clusters of different user groups. In particular, an improved Bayesian conditional cointegration based on dynamic time warping is employed to learn links between words in different groups. A tensor-based technique is developed to cluster these linked words into different clusters (ideas) and track the flow of ideas. The main feature of the tensor representation is that we introduce two additional dimensions to represent both time and lead-lag relationships. Experiments on both synthetic and real datasets show that our method is more effective than methods based on traditional clustering techniques and achieves better accuracy. A case study was conducted to demonstrate the usefulness of our method in helping users understand the flow of ideas between different user groups on social media. Yangxin Zhong, Shixia Liu, Xiting Wang, Jiannan Xiao, Yangqiu Song |
AAAI | 4 |