Baojian Zhou

Orcid: 0000-0001-6516-5680

According to our database1, Baojian Zhou authored at least 37 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Faster Local Solvers for Graph Diffusion Equations.
CoRR, 2024

Iterative Methods via Locally Evolving Set Process.
CoRR, 2024

2023
Accelerating Personalized PageRank Vector Computation.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Fast Online Node Labeling for Very Large Graphs.
Proceedings of the International Conference on Machine Learning, 2023

SubAnom: Efficient Subgraph Anomaly Detection Framework over Dynamic Graphs.
Proceedings of the IEEE International Conference on Data Mining, 2023

Does It Pay to Optimize AUC?
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Subset Node Anomaly Tracking over Large Dynamic Graphs.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets.
Proceedings of the International Conference on Machine Learning, 2022

2021
Subset Node Representation Learning over Large Dynamic Graphs.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020
Detecting Media Self-Censorship without Explicit Training Data.
Proceedings of the 2020 SIAM International Conference on Data Mining, 2020

Online AUC Optimization for Sparse High-Dimensional Datasets.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

Stochastic Hard Thresholding Algorithms for AUC Maximization.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

2019
A Nonparametric Approach to Uncovering Connected Anomalies by Tree Shaped Priors.
IEEE Trans. Knowl. Data Eng., 2019

Dual Averaging Method for Online Graph-structured Sparsity.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
RA Code: A Robust and Aesthetic Code for Resolution-Constrained Applications.
IEEE Trans. Circuits Syst. Video Technol., 2018

PSCluster: Differentially Private Spatial Cluster Detection for Mobile Crowdsourcing Applications.
Proceedings of the 2018 IEEE Conference on Communications and Network Security, 2018

2017
Parallel algorithms for anomalous subgraph detection.
Concurr. Comput. Pract. Exp., 2017

A Generic Framework for Interesting Subspace Cluster Detection in Multi-attributed Networks.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016
An Efficient Algorithm for Optimally Solving a Shortest Vector Problem in Compute-and-Forward Design.
IEEE Trans. Wirel. Commun., 2016

PiCode: A New Picture-Embedding 2D Barcode.
IEEE Trans. Image Process., 2016

A Quadratic Programming Relaxation Approach to Compute-and-Forward Network Coding Design.
CoRR, 2016

Technical Report: Graph-Structured Sparse Optimization for Connected Subgraph Detection.
CoRR, 2016

Social Media as a Sensor for Censorship Detection in News Media.
CoRR, 2016

Technical Report: A Generalized Matching Pursuit Approach for Graph-Structured Sparsity.
CoRR, 2016

A Generalized Matching Pursuit Approach for Graph-Structured Sparsity.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Graph-Structured Sparse Optimization for Connected Subgraph Detection.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Research on Optimal Selection Strategy of Search Engine Keywords Based on Multi-armed Bandit.
Proceedings of the 49th Hawaii International Conference on System Sciences, 2016

Graph Topic Scan Statistic for Spatial Event Detection.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

Efficient compute-and-forward design with low communication overhead.
Proceedings of the 2016 22nd Asia-Pacific Conference on Communications (APCC), 2016

On the minimum subspace coding capacity of multiplicative finite-field matrix channels with a given rank distribution.
Proceedings of the 2016 22nd Asia-Pacific Conference on Communications (APCC), 2016

Efficient Nonparametric Subgraph Detection Using Tree Shaped Priors.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Compute-and-forward protocol design based on improved sphere decoding.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
A quadratic programming relaxation approach to compute-and-forward network coding design.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Using Paralleled-PEs Method to Resolve the Bursting Data in Distributed Stream Processing System.
Proceedings of the 16th IEEE International Conference on Computational Science and Engineering, 2013

Elastic Resource Allocation in the Cloud.
Proceedings of the 16th IEEE International Conference on Computational Science and Engineering, 2013

Resolve Hotspots and Load Imbalance Problem in Event Stream Processing System.
Proceedings of the 2013 International Conference on Cloud and Service Computing, 2013


  Loading...