Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

An Yan 0001

dblp:37/10133-1 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
1since 2021 · last 2021
0000-0003-2368-4858ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 50% Machine learning and data management · 50%
Artificial intelligence
2 papers
Trustworthy machine learning · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Smart cities and intelligent transportation · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.512021
EquiTensors: Learning Fair Integrations of Heterogeneous Urban Data · SIGMOD Conference 2021
Data integration and cleaning
heterogeneous data integration
0.512021
EquiTensors: Learning Fair Integrations of Heterogeneous Urban Data · SIGMOD Conference 2021
Machine learning and data management
learned data representation
0.512021
EquiTensors: Learning Fair Integrations of Heterogeneous Urban Data · SIGMOD Conference 2021
Machine learning › Trustworthy machine learning › fairness
algorithmic fairness
0.412020
Fairness-Aware Demand Prediction for New Mobility · AAAI 2020
Smart cities and intelligent transportation › urban computing
urban prediction
0.112021
EquiTensors: Learning Fair Integrations of Heterogeneous Urban Data · SIGMOD Conference 2021

Methods — techniques the papers use, named apart from their topics

unsupervised representation learning · 1.5convolutional denoising autoencoder · 1.5adversarial learning · 1.5fairness regularization · 0.9convolutional neural network · 0.9
YearPublicationVenuePosition
2021 EquiTensors: Learning Fair Integrations of Heterogeneous Urban Data
abstract
Neural methods are state-of-the-art for urban prediction problems such as transportation resource demand, accident risk, crowd mobility, and public safety. Model performance can be improved by integrating exogenous features from open data repositories (e.g., weather, housing prices, traffic, etc.), but these uncurated sources are often too noisy, incomplete, and biased to use directly. We propose to learn integrated representations, called EquiTensors, from heterogeneous datasets that can be reused across a variety of tasks. We align datasets to a consistent spatio-temporal domain, then describe an unsupervised model based on convolutional denoising autoencoders to learn shared representations. We extend this core integrative model with adaptive weighting to prevent certain datasets from dominating the signal. To combat discriminatory bias, we use adversarial learning to remove correlations with a sensitive attribute (e.g., race or income). Experiments with 23 input datasets and 4 real applications show that EquiTensors could help mitigate the effects of the sensitive information embodied in the biased data. Meanwhile, applications using EquiTensors outperform models that ignore exogenous features and are competitive with "oracle" models that use hand-selected datasets.
An Yan 0001, Bill Howe
SIGMOD Conference1
2020 Fairness-Aware Demand Prediction for New Mobility
abstract
Emerging transportation modes, including car-sharing, bike-sharing, and ride-hailing, are transforming urban mobility yet have been shown to reinforce socioeconomic inequity. These services rely on accurate demand prediction, but the demand data on which these models are trained reflect biases around demographics, socioeconomic conditions, and entrenched geographic patterns. To address these biases and improve fairness, we present FairST, a fairness-aware demand prediction model for spatiotemporal urban applications, with emphasis on new mobility. We use 1D (time-varying, space-constant), 2D (space-varying, time-constant) and 3D (both time- and space-varying) convolutional branches to integrate heterogeneous features, while including fairness metrics as a form of regularization to improve equity across demographic groups. We propose two spatiotemporal fairness metrics, region-based fairness gap (RFG), applicable when demographic information is provided as a constant for a region, and individual-based fairness gap (IFG), applicable when a continuous distribution of demographic information is available. Experimental results on bike share and ride share datasets show that FairST can reduce inequity in demand prediction for multiple sensitive attributes (i.e. race, age, and education level), while achieving better accuracy than even state-of-the-art fairness-oblivious methods.
An Yan 0001, Bill Howe
AAAI1
2019 FairST: Equitable Spatial and Temporal Demand Prediction for New Mobility Systems
abstract
We present a fairness-aware model for predicting demand for new mobility systems. Our approach, called FairST, consists of 1D, 2D and 3D convolutions to learn the spatial-temporal dynamics of a mobility system, and fairness regularizers that guide the model to make equitable predictions. We propose two fairness metrics, region-based fairness gap (RFG) and individual-based fairness gap (IFG), that measure equity gaps between social groups for new mobility systems. Experimental results on two real-world datasets demonstrate the effectiveness of the proposed model: FairST not only reduces the fairness gap by more than 80%, but achieves better accuracy than state-of-the-art but fairness-oblivious methods including LSTMs, ConvLSTMs, and 3D CNN.
An Yan 0001, Bill Howe
SIGSPATIAL/GIS1
2017 Predicting abandonment in online coding tutorials
abstract
Learners regularly abandon online coding tutorials when they get bored or frustrated, but there are few techniques for anticipating this abandonment to intervene. In this paper, we examine the feasibility of predicting abandonment with machine-learned classifiers. Using interaction logs from an online programming game, we extracted a collection of features that are potentially related to learner abandonment and engagement, then developed classifiers for each level. Across the first five levels of the game, our classifiers successfully predicted 61% to 76% of learners who did not complete the next level, achieving an average AUC of 0.68. In these classifiers, features negatively associated with abandonment included account activation and help-seeking behaviors, whereas features positively associated with abandonment included features indicating difficulty and dis-engagement. These findings highlight the feasibility of providing timely intervention to learners likely to quit.
An Yan 0001, Michael Jongseon Lee, Amy J. Ko
VL/HCC1