Demo Data from VLDB 2026 / reviewers in the wild / expert
Xiong Bill Yu
dblp:153/7890
· DBLP profile ↗
5ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-6879-2567ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Artificial 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.
| Databases, data mining, and information retrieval
2 papers |
Data mining · 78% Knowledge graphs · 22% | |
| Artificial intelligence
1 paper |
Graph learning · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › structured data mining
graph mining |
0.7 | 1 | 2023 | Random Walk on Multiple Networks · IEEE Trans. Knowl. Data Eng. 2023 |
Knowledge graphs
link prediction |
0.7 | 1 | 2023 | Random Walk on Multiple Networks · IEEE Trans. Knowl. Data Eng. 2023 |
Data mining › structured data mining › graph mining › community detection
local community detection |
0.7 | 1 | 2023 | Random Walk on Multiple Networks · IEEE Trans. Knowl. Data Eng. 2023 |
Data mining › structured data mining › graph mining
network embedding |
0.7 | 1 | 2023 | Random Walk on Multiple Networks · IEEE Trans. Knowl. Data Eng. 2023 |
Graph algorithms and graph theory
random walk |
0.7 | 1 | 2023 | Random Walk on Multiple Networks · IEEE Trans. Knowl. Data Eng. 2023 |
Machine learning › Graph learning
graph representation learning |
0.4 | 1 | 2020 | Deep Multi-Graph Clustering via Attentive Cross-Graph Association · WSDM 2020 |
Machine learning › Graph learning
network embedding |
0.4 | 1 | 2020 | Deep Multi-Graph Clustering via Attentive Cross-Graph Association · WSDM 2020 |
Data mining
clustering |
0.4 | 1 | 2020 | Deep Multi-Graph Clustering via Attentive Cross-Graph Association · WSDM 2020 |
Methods — techniques the papers use, named apart from their topics
convergence analysis · 1.3autoencoder · 0.9attention mechanism · 0.9approximation methods · 0.7approximation method · 0.7minimum-entropy clustering · 0.4minimum entropy clustering · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Random Walk on Multiple NetworksabstractRandom Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited information. In contrast, real data often contain entities with different types or/and from different sources, which are comprehensive and can be better modeled by multiple networks. To take the advantage of rich information in multiple networks and make better inferences on entities, in this study, we propose random walk on multiple networks, RWM. RWM is flexible and supports both multiplex networks and general multiple networks, which may form many-to-many node mappings between networks. RWM sends a random walker on each network to obtain the local proximity (i.e., node visiting probabilities) w.r.t. the starting nodes. Walkers with similar visiting probabilities reinforce each other. We theoretically analyze the convergence properties of RWM. Two approximation methods with theoretical performance guarantees are proposed for efficient computation. We apply RWM in link prediction, network embedding, and local community detection. Comprehensive experiments conducted on both synthetic and real-world datasets demonstrate the effectiveness and efficiency of RWM. Yuchen Bian, Yaowei Yan, Xiong Bill Yu, Jun Huan, Xiao Liu 0039, Xiang Zhang 0001 |
IEEE Trans. Knowl. Data Eng. | 4 |
| 2021 | Campus safety and the internet of wearable things: assessing student safety conditions on campus while riding a smart scooterabstractThe campus environments have traditionally revolved around the use of sustainable and practical mobility vehicles such as bicycles, but similar to pedestrians and bicyclists, the students riding smart-scooter are also vulnerable road users and to severe injuries during road accidents. In this paper, we created a “smart android system”. STEADi, for monitoring the Smart scooter riders. The system uses a Wearable Gait Lab for, a wearable underfoot force-sensing intelligent unit, as one of the main components. The purpose of this system is to help students who are new to using smart scooters on campus to avoid injuries and accidents by alerting the rider about unforeseen conditions. The system provides adequate data for path tracking, Potholes Detection system, and human balancing ability for the Smart Scooter riders. After careful selection of training data, we have been able to integrate a pothole detector system that identifies worse road segments as having potholes. The proposed system is evaluated based on four balance tests on different terrain and with different diverse riding experiences related to the Smart Scooters. The system testing showed that it can successfully detect several real potholes in and around the Cleveland area and is successfully able to alert the riders, including the lesser experienced ones while riding on different terrains for the potential road-related threats. Devansh Gupta, Wenyao Xu, Xiong Bill Yu, Ming-Chun Huang |
BSN | 3 |
| 2020 | Deep Multi-Graph Clustering via Attentive Cross-Graph AssociationabstractMulti-graph clustering aims to improve clustering accuracy by leveraging information from different domains, which has been shown to be extremely effective for achieving better clustering results than single graph based clustering algorithms. Despite the previous success, existing multi-graph clustering methods mostly use shallow models, which are incapable to capture the highly non-linear structures and the complex cluster associations in multi-graph, thus result in sub-optimal results. Inspired by the powerful representation learning capability of neural networks, in this paper, we propose an end-to-end deep learning model to simultaneously infer cluster assignments and cluster associations in multi-graph. Specifically, we use autoencoding networks to learn node embeddings. Meanwhile, we propose a minimum-entropy based clustering strategy to cluster nodes in the embedding space for each graph. We introduce two regularizers to leverage both within-graph and cross-graph dependencies. An attentive mechanism is further developed to learn cross-graph cluster associations. Through extensive experiments on a variety of datasets, we observe that our method outperforms state-of-the-art baselines by a large margin. Jingchao Ni, Suhang Wang, Yuchen Bian, Xiong Bill Yu, Xiang Zhang 0001 |
WSDM | 5 |
| 2018 | Local Graph Clustering by Multi-network Random Walk with Restart
Yaowei Yan, Jingchao Ni, Hongliang Fei, Wei Fan 0001, Xiong Bill Yu, John Yen, Xiang Zhang 0001 |
PAKDD (3) | 6 |
| 2014 | An Innovative Nonintrusive Driver Assistance System for Vital Signal MonitoringabstractThis paper describes an in-vehicle nonintrusive biopotential measurement system for driver health monitoring and fatigue detection. Previous research has found that the physiological signals including eye features, electrocardiography (ECG), electroencephalography (EEG) and their secondary parameters such as heart rate and HR variability are good indicators of health state as well as driver fatigue. A conventional biopotential measurement system requires the electrodes to be in contact with human body. This not only interferes with the driver operation, but also is not feasible for long-term monitoring purpose. The driver assistance system in this paper can remotely detect the biopotential signals with no physical contact with human skin. With delicate sensor and electronic design, ECG, EEG, and eye blinking can be measured. Experiments were conducted on a high fidelity driving simulator to validate the system performance. The system was found to be able to detect the ECG/EEG signals through cloth or hair with no contact with skin. Eye blinking activities can also be detected at a distance of 10 cm. Digital signal processing algorithms were developed to decimate the signal noise and extract the physiological features. The extracted features from the vital signals were further analyzed to assess the potential criterion for alertness and drowsiness determination. Ye Sun 0010, Xiong Bill Yu |
IEEE J. Biomed. Health Informatics | 2 |