Yuntian He

Orcid: 0000-0002-1365-1772

According to our database1, Yuntian He authored at least 23 papers between 2008 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Conformal Prediction: A Theoretical Note and Benchmarking Transductive Node Classification in Graphs.
Trans. Mach. Learn. Res., 2025

2024
Graph Sparsification for Enhanced Conformal Prediction in Graph Neural Networks.
CoRR, 2024

Benchmarking Graph Conformal Prediction: Empirical Analysis, Scalability, and Theoretical Insights.
CoRR, 2024

HeteroMILE: a Multi-Level Graph Representation Learning Framework for Heterogeneous Graphs.
CoRR, 2024

2023
Efficient Fair Graph Representation Learning Using a Multi-level Framework.
Proceedings of the Companion Proceedings of the ACM Web Conference 2023, 2023

FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning.
Proceedings of the 3rd ACM Conference on Equity and Access in Algorithms, 2023

2022
WebMILE: Democratizing Network Representation Learning at Scale.
Proc. VLDB Endow., 2022

FairMILE: A Multi-Level Framework for Fair and Scalable Graph Representation Learning.
CoRR, 2022

Sepsis Prediction with Temporal Convolutional Networks.
CoRR, 2022

FairMod: Fair Link Prediction and Recommendation via Graph Modification.
CoRR, 2022

FairEGM: Fair Link Prediction and Recommendation via Emulated Graph Modification.
Proceedings of the Equity and Access in Algorithms, Mechanisms, and Optimization, 2022

2021
StyleML: Stylometry with Structure and Multitask Learning for Darkweb Markets.
CoRR, 2021

DistMILE: A Distributed Multi-Level Framework for Scalable Graph Embedding.
Proceedings of the 28th IEEE International Conference on High Performance Computing, 2021

SYSML: StYlometry with Structure and Multitask Learning: Implications for Darknet Forum Migrant Analysis.
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

2020
Best Bang for the Buck: Cost-Effective Seed Selection for Online Social Networks.
IEEE Trans. Knowl. Data Eng., 2020

Differentially Private and Budget-Limited Bandit Learning over Matroids.
INFORMS J. Comput., 2020

2019
Organizing an Influential Social Event Under a Budget Constraint.
IEEE Trans. Knowl. Data Eng., 2019

Efficient and Effective Algorithms for Clustering Uncertain Graphs.
Proc. VLDB Endow., 2019

An Efficient, Robust, and Customizable Information Extraction and Pre-processing Pipeline for Electronic Health Records.
Proceedings of the 11th International Joint Conference on Knowledge Discovery, 2019

2018
Budget-Constrained Organization of Influential Social Events.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Cost-Effective Seed Selection in Online Social Networks.
CoRR, 2017

Online Pricing for Mobile Crowdsourcing with Multi-Minded Users.
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017

2008
A Credit Mechanism Based on Automatic Audit in P2P File Sharing Systems.
Proceedings of the 9th International Conference for Young Computer Scientists, 2008


  Loading...