Hang Zhang 0003

dblp:49/6156-3 · DBLP profile ↗
← Back
7ranked-venue papers in the field
1as first author
6since 2021 · last 2025
0000-0003-0401-4066ORCID · conflict

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 4 (1 first)Database Systems & Data Management · 2Knowledge Engineering, Semantic Web & Information Systems · 1
YearPublicationVenuePosition
2025 Machine Unlearning for Random Forest via Method of Images
Hang Zhang 0003, Kai Ming Ting
ECML/PKDD (5)1
2024 Local Subsequence-Based Distribution for Time Series Clustering
Lei Gong 0001, Hang Zhang 0003, Zongyou Liu, Kai Ming Ting, Yang Cao 0019, Ye Zhu 0002
PAKDD (1)2
2024 A new distributional treatment for time series anomaly detection
Kai Ming Ting, Zongyou Liu, Lei Gong 0001, Hang Zhang 0003, Ye Zhu 0002
VLDB J.4
2023 Isolation Kernel Estimators
Kai Ming Ting, Takashi Washio, Jonathan R. Wells, Hang Zhang 0003, Ye Zhu 0002
Knowl. Inf. Syst.4
2022 A New Distributional Treatment for Time Series and An Anomaly Detection Investigation
abstract
Time series is traditionally treated with two main approaches, i.e., the time domain approach and the frequency domain approach. These approaches must rely on a sliding window so that time-shift versions of a periodic subsequence can be measured to be similar. Coupled with the use of a root point-to-point measure, existing methods often have quadratic time complexity. We offer the third R domain approach. It begins with an insight that subsequences in a periodic time series can be treated as sets of independent and identically distributed (iid) points generated from an unknown distribution in R. This R domain treatment enables two new possibilities: (a) the similarity between two subsequences can be computed using a distributional measure such as Wasserstein distance (WD), kernel mean embedding or Isolation Distributional kernel (IDK); and (b) these distributional measures become non-sliding-window-based. Together, they offer an alternative that has more effective similarity measurements and runs significantly faster than the point-to-point and sliding-window-based measures. Our empirical evaluation shows that IDK and WD are effective distributional measures for time series; and IDK-based detectors have better detection accuracy than existing sliding-window-based detectors, and they run faster with linear time complexity.
Kai Ming Ting, Zongyou Liu, Hang Zhang 0003, Ye Zhu 0002
Proc. VLDB Endow.3
2021 Isolation Kernel Density Estimation
abstract
This paper shows that adaptive kernel density estimator (KDE) can be derived effectively from Isolation Kernel. Existing adaptive KDEs often employ a data independent kernel such as Gaussian kernel. Therefore, it requires an additional means to adapt its bandwidth locally in a given dataset. Because Isolation Kernel is a data dependent kernel which is derived directly from data, no additional adaptive operation is required. The resultant estimator called IKDE is the only KDE that is fast and adaptive. Existing KDEs are either fast but non-adaptive or adaptive but slow. In addition, using IKDE for anomaly detection, we identify two advantages of IKDE over LOF (Local Outlier Factor), contributing to significantly faster runtime.
Kai Ming Ting, Takashi Washio, Jonathan R. Wells, Hang Zhang 0003
ICDM4
2011 How Matchable Are Four Thousand Ontologies on the Semantic Web
Wei Hu 0007, Hang Zhang 0003, Yuzhong Qu
ESWC (1)3