Junzhou Zhao

Orcid: 0000-0003-3476-8248

According to our database1, Junzhou Zhao authored at least 59 papers between 2010 and 2023.

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

2023
Fast Gumbel-Max Sketch and its Applications.
IEEE Trans. Knowl. Data Eng., September, 2023

Federated Learning Over Coupled Graphs.
IEEE Trans. Parallel Distributed Syst., April, 2023

An Effective and Differentially Private Protocol for Secure Distributed Cardinality Estimation.
Proc. ACM Manag. Data, 2023

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

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

Mitigating Language Model Hallucination with Interactive Question-Knowledge Alignment.
CoRR, 2023

Multi-Action Dialog Policy Learning from Logged User Feedback.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Mobile Data Traffic Prediction by Exploiting Time-Evolving User Mobility Patterns.
IEEE Trans. Mob. Comput., 2022

Approximately Counting Butterflies in Large Bipartite Graph Streams.
IEEE Trans. Knowl. Data Eng., 2022

Erasable Virtual HyperLogLog for Approximating Cumulative Distribution over Data Streams.
IEEE Trans. Knowl. Data Eng., 2022

"Think Before You Speak": Improving Multi-Action Dialog Policy by Planning Single-Action Dialogs.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Accurate and Scalable Graph Neural Networks for Billion-Scale Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Tracking triadic cardinality distributions for burst detection in high-speed graph streams.
Knowl. Inf. Syst., 2021

Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Bidirectionally Densifying LSH Sketches with Empty Bins.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Temporal Biased Streaming Submodular Optimization.
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.
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.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Learning to Check Contract Inconsistencies.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Understanding Assimilation-contrast Effects in Online Rating Systems: Modelling, Debiasing, and Applications.
ACM Trans. Inf. Syst., 2020

Improving network embedding with partially available vertex and edge content.
Inf. Sci., 2020

Fast Generating A Large Number of Gumbel-Max Variables.
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.
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Distinguish Confusing Law Articles for Legal Judgment Prediction.
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.
IEEE Trans. Knowl. Data Eng., 2019

SNOD: a fast sampling method of exploring node orbit degrees for large graphs.
Knowl. Inf. Syst., 2019

Practical characterization of large networks using neighborhood information.
Knowl. Inf. Syst., 2019

Fast crawling methods of exploring content distributed over large graphs.
Knowl. Inf. Syst., 2019

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

Sampling online social networks by random walk with indirect jumps.
Data Min. Knowl. Discov., 2019

MR-GNN: Multi-Resolution and Dual Graph Neural Network for Predicting Structured Entity Interactions.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Tracking Influential Nodes in Time-Decaying Dynamic Interaction Networks.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Submodular Optimization over Streams with Inhomogeneous Decays.
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.
IEEE Trans. Knowl. Data Eng., 2018

Modeling the Assimilation-Contrast Effects in Online Product Rating Systems: Debiasing and Recommendations.
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).
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.
Inf. Sci., 2017

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

Towards Efficient Node Discoverability Optimization on Large Networks.
CoRR, 2017

Modeling the Assimilation-Contrast Effects in Online Product Rating Systems: Debiasing and Recommendations.
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.
CoRR, 2016

Minfer: A method of inferring motif statistics from sampled edges.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

2015
Unbiased Characterization of Node Pairs over Large Graphs.
ACM Trans. Knowl. Discov. Data, 2015

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

A tale of three graphs: Sampling design on hybrid social-affiliation networks.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Tracking Triadic Cardinality Distributions for Burst Detection in Social Activity Streams.
Proceedings of the 2015 ACM on Conference on Online Social Networks, 2015

2014
Efficiently Estimating Motif Statistics of Large Networks.
ACM Trans. Knowl. Discov. Data, 2014

A New Sketch Method for Measuring Host Connection Degree Distribution.
IEEE Trans. Inf. Forensics Secur., 2014

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

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

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

Measuring and maximizing group closeness centrality over disk-resident graphs.
Proceedings of the 23rd International World Wide Web Conference, 2014

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

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

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

Sampling Content Distributed Over Graphs.
CoRR, 2013

Efficiently Estimating Subgraph Statistics of Large Networks in the Dark.
CoRR, 2013

Sampling node pairs over large graphs.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2010
Group dynamics in discussing incidental topics over online social networks.
IEEE Netw., 2010


  Loading...