Junzhou Zhao

Orcid: 0000-0003-3476-8248

According to our database¹, Junzhou Zhao authored at least 69 papers between 2010 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Sketching Data Distribution by Rotation.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2024

Robust Visual Question Answering: Datasets, Methods, and Future Challenges.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., August, 2024

Half-Xor: A Fully-Dynamic Sketch for Estimating the Number of Distinct Values in Big Tables.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., July, 2024

Tracking Influencers in Decaying Social Activity Streams With Theoretical Guarantees.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., April, 2024

Token-based deep reinforcement learning for Heterogeneous VRP with Service Time Constraints.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2024

Distinguish Confusion in Legal Judgment Prediction via Revised Relation Knowledge.

[BibT_eX]

[DOI]

CoRR, 2024

SMUG: Sand Mixing for Unobserved Class Detection in Graph Few-Shot Learning.

[BibT_eX]

[DOI]

Proceedings of the ACM on Web Conference 2024, 2024

A Revisit to Graph Neighborhood Cardinality Estimation.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Representation Learning of Tangled Key-Value Sequence Data for Early Classification.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

A Compact and Accurate Sketch for Estimating a Large Range of Set Difference Cardinalities.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

The Knowledge Alignment Problem: Bridging Human and External Knowledge for Large Language Models.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics, 2024

2023

Fast Gumbel-Max Sketch and its Applications.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., September, 2023

Federated Learning Over Coupled Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., April, 2023

An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

FuAlign: Cross-lingual entity alignment via multi-view representation learning of fused knowledge graphs.

[BibT_eX]

[DOI]

Inf. Fusion, 2023

Mitigating Language Model Hallucination with Interactive Question-Knowledge Alignment.

[BibT_eX]

[DOI]

CoRR, 2023

Multi-Action Dialog Policy Learning from Logged User Feedback.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Mobile Data Traffic Prediction by Exploiting Time-Evolving User Mobility Patterns.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2022

Approximately Counting Butterflies in Large Bipartite Graph Streams.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Erasable Virtual HyperLogLog for Approximating Cumulative Distribution over Data Streams.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

"Think Before You Speak": Improving Multi-Action Dialog Policy by Planning Single-Action Dialogs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Accurate and Scalable Graph Neural Networks for Billion-Scale Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021

Tracking triadic cardinality distributions for burst detection in high-speed graph streams.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2021

Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Bidirectionally Densifying LSH Sketches with Empty Bins.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Temporal Biased Streaming Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Fast Rotation Kernel Density Estimation over Data Streams.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

LogLog Filter: Filtering Cold Items within a Large Range over High Speed Data Streams.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Learning to Check Contract Inconsistencies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Understanding Assimilation-contrast Effects in Online Rating Systems: Modelling, Debiasing, and Applications.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2020

Improving network embedding with partially available vertex and edge content.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Fast Generating A Large Number of Gumbel-Max Variables.

[BibT_eX]

[DOI]

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Continuously Tracking Core Items in Data Streams with Probabilistic Decays.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Distinguish Confusing Law Articles for Legal Judgment Prediction.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

2019

Inferring Higher-Order Structure Statistics of Large Networks from Sampled Edges.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

SNOD: a fast sampling method of exploring node orbit degrees for large graphs.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2019

Practical characterization of large networks using neighborhood information.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2019

Fast crawling methods of exploring content distributed over large graphs.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2019

Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations.

[BibT_eX]

[DOI]

Junzhou Zhao

Pinghui Wang

John C. S. Lui

Inf. Sci., 2019

Sampling online social networks by random walk with indirect jumps.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2019

MR-GNN: Multi-Resolution and Dual Graph Neural Network for Predicting Structured Entity Interactions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Submodular Optimization over Streams with Inhomogeneous Decays.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2018

Modeling the Assimilation-Contrast Effects in Online Product Rating Systems: Debiasing and Recommendations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017

I/O-efficient calculation of H-group closeness centrality over disk-resident graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2017

Tracking Triadic Cardinality Distributions for Burst Detection in High-Speed Multigraph Streams.

[BibT_eX]

[DOI]

CoRR, 2017

Towards Efficient Node Discoverability Optimization on Large Networks.

[BibT_eX]

[DOI]

CoRR, 2017

Modeling the Assimilation-Contrast Effects in Online Product Rating Systems: Debiasing and Recommendations.

[BibT_eX]

[DOI]

Xiaoying Zhang

Junzhou Zhao

John C. S. Lui

Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017

2016

A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Minfer: A method of inferring motif statistics from sampled edges.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015

Unbiased Characterization of Node Pairs over Large Graphs.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2015

Moss: A Scalable Tool for Efficiently Sampling and Counting 4- and 5-Node Graphlets.

[BibT_eX]

[DOI]

CoRR, 2015

A tale of three graphs: Sampling design on hybrid social-affiliation networks.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Tracking Triadic Cardinality Distributions for Burst Detection in Social Activity Streams.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on Conference on Online Social Networks, 2015

2014

Efficiently Estimating Motif Statistics of Large Networks.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2014

A New Sketch Method for Measuring Host Connection Degree Distribution.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2014

A Tale of Three Social Networks: User Activity Comparisons across Facebook, Twitter, and Foursquare.

[BibT_eX]

[DOI]

Pinghui Wang

Wenbo He

Junzhou Zhao

IEEE Internet Comput., 2014

Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks.

[BibT_eX]

[DOI]

CoRR, 2014

Whom to follow: Efficient followee selection for cascading outbreak detection on online social networks.

[BibT_eX]

[DOI]

Comput. Networks, 2014

Measuring and maximizing group closeness centrality over disk-resident graphs.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

2013

Social Sensor Placement in Large Scale Networks: A Graph Sampling Perspective

[BibT_eX]

[DOI]

CoRR, 2013

A Peep on the Interplays between Online Video Websites and Online Social Networks

[BibT_eX]

[DOI]

CoRR, 2013

On Analyzing Estimation Errors due to Constrained Connections in Online Review Systems.

[BibT_eX]

[DOI]

Junzhou Zhao

CoRR, 2013

Sampling Content Distributed Over Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

Efficiently Estimating Subgraph Statistics of Large Networks in the Dark.

[BibT_eX]

[DOI]

CoRR, 2013

Sampling node pairs over large graphs.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2010

Group dynamics in discussing incidental topics over online social networks.

[BibT_eX]

[DOI]

IEEE Netw., 2010

Junzhou Zhao

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...