Hankz Hankui Zhuo

Dr. Hankz Hankui Zhuo


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2014 in Artificial Intelligence
Verified
Journal Article
Closed access
HZHankz Hankui Zhuo
Hankz Hankui Zhuo
QYQiang Yang
Qiang Yang

10 June 2023 in Communications Chemistry
Verified
Journal Article
Open access
PDF file
SHSiqi Hong
Siqi Hong
HZHankz Hankui Zhuo
Hankz Hankui Zhuo
KJKebing Jin
Kebing Jin
GSGuang Shao
Guang Shao
ZZZhanwen Zhou
Zhanwen Zhou
In retrosynthetic planning, the huge number of possible routes to synthesize a complex molecule using simple building blocks leads to a combinatorial explosion of possibilities. Even experienced chemists often have difficulty to select the most promising transformations. The current approaches rely on human-defined or machine-trained score functions which have limited chemical knowledge or use expensive estimation methods for guiding. Here we propose an experience-guided Monte Carlo tree search (EG-MCTS) to deal with this problem. Instead of rollout, we build an experience guidance network to learn knowledge from synthetic experiences during the search. Experiments on benchmark USPTO datasets show that, EG-MCTS gains significant improvement over state-of-the-art approaches both in efficiency and effectiveness. In a comparative experiment with the literature, our computer-generated routes mostly matched the reported routes. Routes designed for real drug compounds exhibit the effectiveness of EG-MCTS on assisting chemists performing retrosynthetic analysis.

1 May 2017 in Artificial Intelligence
Verified
Journal Article
Closed access
HZHankz Hankui Zhuo
Hankz Hankui Zhuo
SKSubbarao Kambhampati
Subbarao Kambhampati

3 June 2016 in Sensors
Verified
Journal Article
Open access
PDF file
XLXiaomu Luo
Xiaomu Luo
HTHyuan Tan
Hyuan Tan
QGQiuju Guan
Qiuju Guan
TLTong Liu
Tong Liu
HZHankz Hankui Zhuo
Hankz Hankui Zhuo
BSBaihua Shen
Baihua Shen
Healthy aging is one of the most important social issues. In this paper, we propose a method for abnormal activity detection without any manual labeling of the training samples. By leveraging the Field of View (FOV) modulation, the spatio-temporal characteristic of human activity is encoded into low-dimension data stream generated by the ceiling-mounted Pyroelectric Infrared (PIR) sensors. The similarity between normal training samples are measured based on Kullback-Leibler (KL) divergence of each pair of them. The natural clustering of normal activities is discovered through a self-tuning spectral clustering algorithm with unsupervised model selection on the eigenvectors of a modified similarity matrix. Hidden Markov Models (HMMs) are employed to model each cluster of normal activities and form feature vectors. One-Class Support Vector Machines (OSVMs) are used to profile the normal activities and detect abnormal activities. To validate the efficacy of our method, we conducted experiments in real indoor environments. The encouraging results show that our method is able to detect abnormal activities given only the normal training samples, which aims to avoid the laborious and inconsistent data labeling process.

24 January 2020 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
HZHankz Hankui Zhuo
Hankz Hankui Zhuo
YZYantian Zha
Yantian Zha
SKSubbarao Kambhampati
Subbarao Kambhampati
XTXin Tian
Xin Tian
Plan recognition aims to discover target plans (i.e., sequences of actions) behind observed actions, with history plan libraries or action models in hand. Previous approaches either discover plans by maximally “matching” observed actions to plan libraries, assuming target plans are from plan libraries, or infer plans by executing action models to best explain the observed actions, assuming that complete action models are available. In real-world applications, however, target plans are often not from plan libraries, and complete action models are often not available, since building complete sets of plans and complete action models are often difficult or expensive. In this article, we view plan libraries as corpora and learn vector representations of actions using the corpora; we then discover target plans based on the vector representations. Specifically, we propose two approaches, DUP and RNNPlanner, to discover target plans based on vector representations of actions. DUP explores the EM-style (Expectation Maximization) framework to capture local contexts of actions and discover target plans by optimizing the probability of target plans, while RNNPlanner aims to leverage long-short term contexts of actions based on RNNs (Recurrent Neural Networks) framework to help recognize target plans. In the experiments, we empirically show that our approaches are capable of discovering underlying plans that are not from plan libraries without requiring action models provided. We demonstrate the effectiveness of our approaches by comparing its performance to traditional plan recognition approaches in three planning domains. We also compare DUP and RNNPlanner to see their advantages and disadvantages.

11 February 2025 in Neural Networks
Verified
Journal Article
Closed access
XMXuechen Mu
Xuechen Mu
HZHankz Hankui Zhuo
Hankz Hankui Zhuo
CCChen Chen
Chen Chen
KZKai Zhang
Kai Zhang
CYChao Yu
Chao Yu
JHJianye Hao
Jianye Hao