Junzhou Zhao

According to our database1, Junzhou Zhao authored at least 27 papers between 2013 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

Sampling Online Social Networks by Random Walk with Indirect Jumps.
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.
TKDD, 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.
TKDD, 2014

A New Sketch Method for Measuring Host Connection Degree Distribution.
IEEE Trans. Information Forensics and Security, 2014

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

Tracking Triadic Cardinality Distributions for Burst Detection in Social Activity Streams.
CoRR, 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.
Computer 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

Practical Characterization of Large Networks Using Neighborhood Information.
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


  Loading...