Yanhao Wang

Orcid: 0000-0002-7661-3917

Affiliations:
  • East China Normal University, Shanghai, China (since 2021)
  • University of Helsinki, Department of Computer Science, Finland (2020-2021)
  • National University of Singapore, Singapore (2016-2020)
  • Renmin University of China, Beijing, China (2011-2014)


According to our database1, Yanhao Wang authored at least 55 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On data efficiency of univariate time series anomaly detection models.
J. Big Data, December, 2024

DiversiNews: Enriching News Consumption with Relevant yet Diverse News Articles Retrieval.
Proc. VLDB Endow., August, 2024

Hybrid Regret Minimization: A Submodular Approach.
IEEE Trans. Knowl. Data Eng., July, 2024

Federated Submodular Maximization With Differential Privacy.
IEEE Internet Things J., January, 2024

Fair Representation in Submodular Subset Selection: A Pareto Optimization Approach.
Trans. Mach. Learn. Res., 2024

Multi-level feature enhancement network for object detection in sonar images.
J. Vis. Commun. Image Represent., 2024

DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows (Technical Report).
CoRR, 2024

Diversity-Aware k-Maximum Inner Product Search Revisited.
CoRR, 2024

How to Avoid Jumping to Conclusions: Measuring the Robustness of Outstanding Facts in Knowledge Graphs.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Discovering Personalized Characteristic Communities in Attributed Graphs.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Hybrid Regret Minimization: A Submodular Approach (Extended Abstract).
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Balancing Utility and Fairness in Submodular Maximization.
Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

WaZI: A Learned and Workload-aware Z-Index.
Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

TaiChi: Improving the Robustness of NLP Models by Seeking Common Ground While Reserving Differences.
Proceedings of the 2024 Joint International Conference on Computational Linguistics, 2024

Coresets for Deletion-Robust k-Center Clustering.
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023
SID-TGAN: A Transformer-Based Generative Adversarial Network for Sonar Image Despeckling.
Remote. Sens., October, 2023

Fair Max-Min Diversity Maximization in Streaming and Sliding-Window Models.
Entropy, July, 2023

Continuous k-Regret Minimization Queries: A Dynamic Coreset Approach.
IEEE Trans. Knowl. Data Eng., June, 2023

FAFEnet: A fast and accurate model for automatic license plate detection and recognition.
IET Image Process., February, 2023

Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs.
CoRR, 2023

Workload-aware and Learned Z-Indexes.
CoRR, 2023

Graph Summarization via Node Grouping: A Spectral Algorithm.
Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms.
Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Spectral Normalized-Cut Graph Partitioning with Fairness Constraints.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Opinion-aware Influence Maximization in Online Social Networks.
Proceedings of the 6th International Conference on Data Science and Information Technology, 2023

A Customized Text Sanitization Mechanism with Differential Privacy.
Proceedings of the Findings of the Association for Computational Linguistics: ACL 2023, 2023

SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Improved Algorithm for Regret Ratio Minimization in Multi-Objective Submodular Maximization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Happiness Maximizing Sets under Group Fairness Constraints.
Proc. VLDB Endow., 2022

Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams.
CoRR, 2022

Balancing Utility and Fairness in Submodular Maximization (Technical Report).
CoRR, 2022

Happiness Maximizing Sets under Group Fairness Constraints (Technical Report).
CoRR, 2022

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Streaming Algorithms for Diversity Maximization with Fairness Constraints.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Robustness of Sketched Linear Classifiers to Adversarial Attacks.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021
A survey of typical attributed graph queries.
World Wide Web, 2021

Fair and Representative Subset Selection from Data Streams.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Minimum Coresets for Maxima Representation of Multidimensional Data.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

A Fully Dynamic Algorithm for k-Regret Minimizing Sets.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

2020
Streaming Submodular Maximization with Fairness Constraints.
CoRR, 2020

Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version).
CoRR, 2020

GRMR: Generalized Regret-Minimizing Representatives.
CoRR, 2020

Efficient Sampling Algorithms for Approximate Temporal Motif Counting.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Efficient Representative Subset Selection over Sliding Windows.
IEEE Trans. Knowl. Data Eng., 2019

Coresets for Minimum Enclosing Balls over Sliding Windows.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Semantic and Influence aware k-Representative Queries over Social Streams.
Proceedings of the Advances in Database Technology, 2019

2018
Location-aware Influence Maximization over Dynamic Social Streams.
ACM Trans. Inf. Syst., 2018

Influence Maximization on Social Graphs: A Survey.
IEEE Trans. Knowl. Data Eng., 2018

River: A Real-Time Influence Monitoring System on Social Media Streams.
Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018

A Sliding-Window Framework for Representative Subset Selection.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Real-Time Influence Maximization on Dynamic Social Streams.
Proc. VLDB Endow., 2017

Efficient Streaming Algorithms for Submodular Maximization with Multi-Knapsack Constraints.
CoRR, 2017

2013
Efficient Distributed Multi-dimensional Index for Big Data Management.
Proceedings of the Web-Age Information Management - 14th International Conference, 2013


  Loading...