Zhihao Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhihao Chang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Kingsum Chow
School of Software Technology, Zhejiang University, Ningbo, China
3 shared publications - Anil Rajput
AMD, Hillsboro USA
2 shared publications - Daniele Masti
Gran Sasso Science Institute, L'Aquila, Italy
2 shared publications - Dongxiang Zhang
Zhejiang University, Hangzhou, China
2 shared publications - Emilio Incerto
IMT School for Advanced Studies Lucca, Lucca, Italy
2 shared publications - Gang Chen
Zhejiang University
2 shared publications
Latest Publications
- Open Access
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 254
AIPerfLLM: 4th International Workshop on Performance Optimization in the LLM World
- 3 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 254
Open AccessAIPerfLLM: 4th International Workshop on Performance Optimization in the LLM World
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1066-1075
General Neural Embedding for Sequence Distance Approximation
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1066-1075
Open AccessGeneral Neural Embedding for Sequence Distance Approximation
- Open Access
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 93-94
AIPerfLLM: 3rd International Workshop on Performance Optimization in the LLM world
- 5 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 93-94
Open AccessAIPerfLLM: 3rd International Workshop on Performance Optimization in the LLM world
- Open Access
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (1) , 38-45
Neural Embeddings for kNN Search in Biological Sequence
Biological sequence nearest neighbor search plays a fundamental role in bioinformatics. To alleviate the pain of quadratic complexity for conventional distance computation, neural distance embeddings, which project sequences into geometric space, have been recognized as a promising paradigm. To maintain the distance order between sequences, these models all deploy triplet loss and use intuitive methods to select a subset of triplets for training from a vast selection space. However, we observed that such training often enables models to distinguish only a fraction of distance orders, leaving others unrecognized. Moreover, naively selecting more triplets for training under the state-of-the-art network not only adds costs but also hampers model performance. In this paper, we introduce Bio-kNN: a kNN search framework for biological sequences. It includes a systematic triplet selection method and a multi-head network, enhancing the discernment of all distance orders without increasing training expenses. Initially, we propose a clustering-based approach to partition all triplets into several clusters with similar properties, and then select triplets from these clusters using an innovative strategy. Meanwhile, we noticed that simultaneously training different types of triplets in the same network cannot achieve the expected performance, thus we propose a multi-head network to tackle this. Our network employs a convolutional neural network(CNN) to extract local features shared by all clusters, and then learns a multi-layer perception(MLP) head for each cluster separately. Besides, we treat CNN as a special head, thereby integrating crucial local features which are neglected in previous models into our model for similarity recognition. Extensive experiments show that our Bio-kNN significantly outperforms the state-of-the-art methods on two large-scale datasets without increasing the training cost.
- 24 March 2024
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (1) , 38-45
Open AccessNeural Embeddings for kNN Search in Biological Sequence
Biological sequence nearest neighbor search plays a fundamental role in bioinformatics. To alleviate the pain of quadratic complexity for conventional distance computation, neural distance embeddings, which project sequences into geometric space, have been recognized as a promising paradigm. To maintain the distance order between sequences, these models all deploy triplet loss and use intuitive methods to select a subset of triplets for training from a vast selection space. However, we observed that such training often enables models to distinguish only a fraction of distance orders, leaving others unrecognized. Moreover, naively selecting more triplets for training under the state-of-the-art network not only adds costs but also hampers model performance. In this paper, we introduce Bio-kNN: a kNN search framework for biological sequences. It includes a systematic triplet selection method and a multi-head network, enhancing the discernment of all distance orders without increasing training expenses. Initially, we propose a clustering-based approach to partition all triplets into several clusters with similar properties, and then select triplets from these clusters using an innovative strategy. Meanwhile, we noticed that simultaneously training different types of triplets in the same network cannot achieve the expected performance, thus we propose a multi-head network to tackle this. Our network employs a convolutional neural network(CNN) to extract local features shared by all clusters, and then learns a multi-layer perception(MLP) head for each cluster separately. Besides, we treat CNN as a special head, thereby integrating crucial local features which are neglected in previous models into our model for similarity recognition. Extensive experiments show that our Bio-kNN significantly outperforms the state-of-the-art methods on two large-scale datasets without increasing the training cost.
- 19 January 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (4) , 887-904
SQUID: subtrajectory query in trillion-scale GPS database
- 19 January 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 32 (4) , 887-904
SQUID: subtrajectory query in trillion-scale GPS database
- 24 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 34 (10) , 4690-4704
Continuous Trajectory Similarity Search for Online Outlier Detection
In this paper, we study a new variant of trajectory similarity search from the context of continuous query processing. Given a moving object from s to $d$ , following a reference route $T_r$ , we monitor the trajectory similarity between the reference route and the current partial route at each timestamp for online detour detection. Since existing trajectory distance measures fail to adequately capture the deviation between a partial route and a complete route, we propose a partial trajectory similarity measure to bridge the gap. In particular, we enumerate all the possible routes extended from the partial route to reach the destination d and calculate their minimum distance to $T_r$ . We consider deviation calculation in both Euclidean space and road networks. In Euclidean space, we can directly infer the optimal future path with the minimum trajectory distance. In road networks, we propose an efficient expansion algorithm with a suite of pruning rules. Furthermore, we propose efficient incremental processing strategies to facilitate continuous query processing for moving objects. Our experiments are conducted on multiple real datasets and the experimental results verify the efficiency of our query processing algorithms.- 24 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 34 (10) , 4690-4704
Continuous Trajectory Similarity Search for Online Outlier Detection
In this paper, we study a new variant of trajectory similarity search from the context of continuous query processing. Given a moving object from s to $d$ , following a reference route $T_r$ , we monitor the trajectory similarity between the reference route and the current partial route at each timestamp for online detour detection. Since existing trajectory distance measures fail to adequately capture the deviation between a partial route and a complete route, we propose a partial trajectory similarity measure to bridge the gap. In particular, we enumerate all the possible routes extended from the partial route to reach the destination d and calculate their minimum distance to $T_r$ . We consider deviation calculation in both Euclidean space and road networks. In Euclidean space, we can directly infer the optimal future path with the minimum trajectory distance. In road networks, we propose an efficient expansion algorithm with a suite of pruning rules. Furthermore, we propose efficient incremental processing strategies to facilitate continuous query processing for moving objects. Our experiments are conducted on multiple real datasets and the experimental results verify the efficiency of our query processing algorithms.