default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaojian Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c26]Baojian Zhou, Steven Skiena
:
Does It Pay to Optimize AUC? AAAI 2023: 11408-11416- [c25]Chi Zhang, Wenkai Xiang, Xingzhi Guo, Baojian Zhou, Deqing Yang:
SubAnom: Efficient Subgraph Anomaly Detection Framework over Dynamic Graphs. ICDM (Workshops) 2023: 1178-1185 - [c24]Baojian Zhou, Yifan Sun, Reza Babanezhad Harikandeh:
Fast Online Node Labeling for Very Large Graphs. ICML 2023: 42658-42697 - [c23]Zhen Chen, Xingzhi Guo, Baojian Zhou, Deqing Yang, Steven Skiena:
Accelerating Personalized PageRank Vector Computation. KDD 2023: 262-273 - [i17]Baojian Zhou, Yifan Sun, Reza Babanezhad:
Fast Online Node Labeling for Very Large Graphs. CoRR abs/2305.16257 (2023) - [i16]Baojian Zhou, Steven Skiena:
Does it pay to optimize AUC? CoRR abs/2306.01528 (2023) - [i15]Zhen Chen, Xingzhi Guo, Baojian Zhou, Deqing Yang, Steven Skiena:
Accelerating Personalized PageRank Vector Computation. CoRR abs/2306.02102 (2023) - [i14]Chi Zhang, Wenkai Xiang, Xingzhi Guo, Baojian Zhou, Deqing Yang:
SubAnom: Efficient Subgraph Anomaly Detection Framework over Dynamic Graphs. CoRR abs/2312.10504 (2023) - 2022
- [c22]Baojian Zhou, Yifan Sun:
Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets. ICML 2022: 27303-27337 - [c21]Xingzhi Guo, Baojian Zhou, Steven Skiena:
Subset Node Anomaly Tracking over Large Dynamic Graphs. KDD 2022: 475-485 - [i13]Xingzhi Guo, Baojian Zhou, Steven Skiena:
Subset Node Anomaly Tracking over Large Dynamic Graphs. CoRR abs/2205.09786 (2022) - 2021
- [c20]Xingzhi Guo, Baojian Zhou, Steven Skiena:
Subset Node Representation Learning over Large Dynamic Graphs. KDD 2021: 516-526 - [i12]Xingzhi Guo, Baojian Zhou, Steven Skiena:
Subset Node Representation Learning over Large Dynamic Graphs. CoRR abs/2106.01570 (2021) - [i11]Baojian Zhou, Yifan Sun:
Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets. CoRR abs/2107.00472 (2021) - 2020
- [c19]Zhenhuan Yang, Baojian Zhou, Yunwen Lei, Yiming Ying:
Stochastic Hard Thresholding Algorithms for AUC Maximization. ICDM 2020: 741-750 - [c18]Baojian Zhou, Yiming Ying, Steven Skiena:
Online AUC Optimization for Sparse High-Dimensional Datasets. ICDM 2020: 881-890 - [c17]Rongrong Tao, Baojian Zhou, Feng Chen, David Mares, Patrick Butler, Naren Ramakrishnan, Ryan Kennedy:
Detecting Media Self-Censorship without Explicit Training Data. SDM 2020: 550-558 - [i10]Baojian Zhou, Yiming Ying, Steven Skiena:
Online AUC Optimization for Sparse High-Dimensional Datasets. CoRR abs/2009.10867 (2020) - [i9]Zhenhuan Yang, Baojian Zhou, Yunwen Lei, Yiming Ying:
Stochastic Hard Thresholding Algorithms for AUC Maximization. CoRR abs/2011.02396 (2020)
2010 – 2019
- 2019
- [j5]Nannan Wu, Feng Chen, Jianxin Li, Jinpeng Huai, Baojian Zhou, Bo Li, Naren Ramakrishnan:
A Nonparametric Approach to Uncovering Connected Anomalies by Tree Shaped Priors. IEEE Trans. Knowl. Data Eng. 31(10): 1849-1862 (2019) - [c16]Baojian Zhou, Feng Chen, Yiming Ying:
Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization. ICML 2019: 7563-7573 - [c15]Baojian Zhou, Feng Chen, Yiming Ying:
Dual Averaging Method for Online Graph-structured Sparsity. KDD 2019: 436-446 - [i8]Baojian Zhou, Feng Chen, Yiming Ying:
Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization. CoRR abs/1905.03652 (2019) - [i7]Baojian Zhou, Feng Chen, Yiming Ying:
Dual Averaging Method for Online Graph-structured Sparsity. CoRR abs/1905.10714 (2019) - 2018
- [j4]Changsheng Chen, Baojian Zhou, Wai Ho Mow:
RA Code: A Robust and Aesthetic Code for Resolution-Constrained Applications. IEEE Trans. Circuits Syst. Video Technol. 28(11): 3300-3312 (2018) - [c14]Boyang Hu, Baojian Zhou, Qiben Yan, Adil Alim, Feng Chen, Huacheng Zeng:
PSCluster: Differentially Private Spatial Cluster Detection for Mobile Crowdsourcing Applications. CNS 2018: 1-9 - 2017
- [j3]Jieyu Zhao, Jianxin Li, Baojian Zhou, Feng Chen, Paul Tomchik, Wuyang Ju:
Parallel algorithms for anomalous subgraph detection. Concurr. Comput. Pract. Exp. 29(3) (2017) - [c13]Feng Chen, Baojian Zhou, Adil Alim, Liang Zhao:
A Generic Framework for Interesting Subspace Cluster Detection in Multi-attributed Networks. ICDM 2017: 41-50 - [i6]Feng Chen, Baojian Zhou, Adil Alim, Liang Zhao:
A Generic Framework for Interesting Subspace Cluster Detection in Multi-attributed Networks. CoRR abs/1709.05246 (2017) - 2016
- [j2]Changsheng Chen, Wenjian Huang, Baojian Zhou, Chenchen Liu, Wai Ho Mow:
PiCode: A New Picture-Embedding 2D Barcode. IEEE Trans. Image Process. 25(8): 3444-3458 (2016) - [j1]Jinming Wen, Baojian Zhou, Wai Ho Mow, Xiao-Wen Chang:
An Efficient Algorithm for Optimally Solving a Shortest Vector Problem in Compute-and-Forward Design. IEEE Trans. Wirel. Commun. 15(10): 6541-6555 (2016) - [c12]Nannan Wu, Feng Chen, Jianxin Li, Baojian Zhou, Naren Ramakrishnan:
Efficient Nonparametric Subgraph Detection Using Tree Shaped Priors. AAAI 2016: 1352-1358 - [c11]Baojian Zhou, Wai Ho Mow:
Efficient compute-and-forward design with low communication overhead. APCC 2016: 291-295 - [c10]Chenchen Liu, Xiaolin Li, Baojian Zhou, Wai Ho Mow:
On the minimum subspace coding capacity of multiplicative finite-field matrix channels with a given rank distribution. APCC 2016: 302-306 - [c9]Yu Liu, Baojian Zhou, Feng Chen, David W. Cheung:
Graph Topic Scan Statistic for Spatial Event Detection. CIKM 2016: 489-498 - [c8]Juan Qin, Wei Qi, Baojian Zhou:
Research on Optimal Selection Strategy of Search Engine Keywords Based on Multi-armed Bandit. HICSS 2016: 726-734 - [c7]Baojian Zhou, Feng Chen:
Graph-Structured Sparse Optimization for Connected Subgraph Detection. ICDM 2016: 709-718 - [c6]Feng Chen, Baojian Zhou:
A Generalized Matching Pursuit Approach for Graph-Structured Sparsity. IJCAI 2016: 1389-1395 - [i5]Baojian Zhou, Jinming Wen, Wai Ho Mow:
A Quadratic Programming Relaxation Approach to Compute-and-Forward Network Coding Design. CoRR abs/1607.01864 (2016) - [i4]Baojian Zhou, Feng Chen:
Technical Report: Graph-Structured Sparse Optimization for Connected Subgraph Detection. CoRR abs/1609.09864 (2016) - [i3]Rongrong Tao, Baojian Zhou, Adil Alim, Feng Chen, David Mares, Patrick Butler, Naren Ramakrishnan:
Social Media as a Sensor for Censorship Detection in News Media. CoRR abs/1611.06947 (2016) - [i2]Feng Chen, Baojian Zhou:
Technical Report: A Generalized Matching Pursuit Approach for Graph-Structured Sparsity. CoRR abs/1612.03364 (2016) - 2015
- [c5]Jinming Wen, Baojian Zhou, Wai Ho Mow, Xiao-Wen Chang:
Compute-and-forward protocol design based on improved sphere decoding. ICC 2015: 1631-1636 - 2014
- [c4]Baojian Zhou, Wai Ho Mow:
A quadratic programming relaxation approach to compute-and-forward network coding design. ISIT 2014: 2296-2300 - [i1]Jinming Wen, Baojian Zhou, Wai Ho Mow, Xiao-Wen Chang:
Compute-and-Forward Protocol Design Based on Improved Sphere Decoding. CoRR abs/1410.4278 (2014) - 2013
- [c3]Baojian Zhou, Zhongzhi Luan, JieQian Wu, Ming Xie:
Resolve Hotspots and Load Imbalance Problem in Event Stream Processing System. CSC 2013: 158-159 - [c2]Baojian Zhou, Zhongzhi Luan, JieQian Wu, Ming Xie:
Using Paralleled-PEs Method to Resolve the Bursting Data in Distributed Stream Processing System. CSE 2013: 1324-1331 - [c1]JieQian Wu, Baojian Zhou, Depei Qian, Ming Xie, Wei Chen:
Elastic Resource Allocation in the Cloud. CSE 2013: 1338-1342
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
