Kaiqi Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kaiqi Zhang has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Hong Gao
Zhejiang Normal University
12 shared publications - Jianzhong Li
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
10 shared publications - Donghua Yang
Faculty of Computing, Harbin Institute of Technology, Harbin, China
5 shared publications - Hongzhi Wang
Harbin Institute of Technology, Harbin, China
3 shared publications - Jian Chen
Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
3 shared publications - Hongbo Yin
Faculty of Computing, Harbin Institute of Technology, Harbin, China
2 shared publications
Latest Publications
- Open Access
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1401-1406
Data Pricing Strategy Considering Missing Values and Privacy Constraints
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1401-1406
Open AccessData Pricing Strategy Considering Missing Values and Privacy Constraints
- 1 November 2024
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 39 (6) , 1441-1465
Indoor Uncertain Semantic Trajectory Similarity Join
- 1 November 2024
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 39 (6) , 1441-1465
Indoor Uncertain Semantic Trajectory Similarity Join
- 17 October 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1024
Finding and counting small tournaments in large tournaments
- 17 October 2024
- Published by Elsevier in Theoretical Computer Science
- Vol. 1024
Finding and counting small tournaments in large tournaments
- 28 August 2024
- Published by Springer Nature
- p. 483-498
Efficient Coverage Query Over Transition Trajectories
- 28 August 2024
- Published by Springer Nature
- p. 483-498
Efficient Coverage Query Over Transition Trajectories
- Open Access
- 23 August 2024
- Published by Springer Nature in Discover Computing
- Vol. 27 (1) , 1-26
Searching rooms with top-k passenger flows using indoor trajectories
- 23 August 2024
- Published by Springer Nature in Discover Computing
- Vol. 27 (1) , 1-26
Open AccessSearching rooms with top-k passenger flows using indoor trajectories
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (7) , 3329-3347
On Efficiently Processing MIT Queries in Trajectory Data
Maximizing Influence (Max-Inf) query is a fundamental operation in spatial data management. Given a set of weighted objects, this query aims to find an optimal location from a candidate set to maximize its influence , which is the total weight of its reverse nearest neighbors. Existing work commonly assumes that every object is in a fixed location. In real life, however, there are a wide variety of drive-in services (e.g., food joints, pharmacies, ATMs, etc.) that are widely accessed by mobile users (i.e., trajectories) instead of the fixed ones. In this paper, we first define the Maximizing Influence query over Trajectories, namely, MIT query, which aims to find an optimal location to maximize the total weight of influenced trajectories. We propose a novel index, QB-tree to hierarchically group trajectories with similar activity regions together for subsequent unified processing, and classify trajectories inside the same node into multiple buckets according to their motion patterns. For each bucket, we construct a rectilinear polygon using the trajectories in it to exclude some irrelevant areas in the minimum boundary rectangle. Moreover, we develop a branch-and-bound approach called BBM to efficiently solve the MIT query. The algorithm adaptively partitions the candidates into disjoint regions and prunes the regions without containing optimal results. Then, by exploiting the QB-tree, the upper and lower bounds are efficiently computed with three-level pruning technique. Practically, we also study a variant of the MIT query, called MDT query. We propose novel pruning bounds in cooperation with QB-tree to answer MDT queries efficiently. Finally, extensive experiments on real and synthetic datasets demonstrate that our index and algorithms have high performance in terms of efficiency, scalability, and genericity.
- 5 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (7) , 3329-3347
On Efficiently Processing MIT Queries in Trajectory Data
Maximizing Influence (Max-Inf) query is a fundamental operation in spatial data management. Given a set of weighted objects, this query aims to find an optimal location from a candidate set to maximize its influence , which is the total weight of its reverse nearest neighbors. Existing work commonly assumes that every object is in a fixed location. In real life, however, there are a wide variety of drive-in services (e.g., food joints, pharmacies, ATMs, etc.) that are widely accessed by mobile users (i.e., trajectories) instead of the fixed ones. In this paper, we first define the Maximizing Influence query over Trajectories, namely, MIT query, which aims to find an optimal location to maximize the total weight of influenced trajectories. We propose a novel index, QB-tree to hierarchically group trajectories with similar activity regions together for subsequent unified processing, and classify trajectories inside the same node into multiple buckets according to their motion patterns. For each bucket, we construct a rectilinear polygon using the trajectories in it to exclude some irrelevant areas in the minimum boundary rectangle. Moreover, we develop a branch-and-bound approach called BBM to efficiently solve the MIT query. The algorithm adaptively partitions the candidates into disjoint regions and prunes the regions without containing optimal results. Then, by exploiting the QB-tree, the upper and lower bounds are efficiently computed with three-level pruning technique. Practically, we also study a variant of the MIT query, called MDT query. We propose novel pruning bounds in cooperation with QB-tree to answer MDT queries efficiently. Finally, extensive experiments on real and synthetic datasets demonstrate that our index and algorithms have high performance in terms of efficiency, scalability, and genericity.
- 9 December 2023
- Published by Springer Nature
- p. 226-238
A Novel Approximation Algorithm for Max-Covering Circle Problem
- 9 December 2023
- Published by Springer Nature
- p. 226-238
A Novel Approximation Algorithm for Max-Covering Circle Problem
- Open Access
- 7 July 2023
- Published by Springer Nature in World Wide Web
- Vol. 26 (5) , 3229-3252
Anomaly and change point detection for time series with concept drift
Anomaly detection is one of the most important research contents in time series data analysis, which is widely used in many fields. In real world, the environment is usually dynamically changing, and the distribution of data changes over time, namely concept drift. The accuracy of static anomaly detection methods is bound to be reduced by concept drift. In addition, there is a sudden concept drift, which is manifested as a abrupt variation in a data point that changes the statistical properties of data. Such a point is called a change point, and it has very similar behavior to an anomaly. However, the existing methods cannot distinguish between anomaly and change point, so the existence of change point will affect the result of anomaly detection. In this paper, we propose an unsupervised method to simultaneously detect anomaly and change point for time series with concept drift. The method is based on the fluctuation features of data and converts the original data into the rate of change of data. It not only solves the concept drift, but also effectively detects and distinguishes anomalies and change points. Experiments on both public and synthetic datasets show that compared with the state-of-the-art anomaly detection methods, our method is superior to most of the existing works and significantly superior to existing methods for change point detection. It fully demonstrates the superiority of our method in detecting anomalies and change points simultaneously.
- 7 July 2023
- Published by Springer Nature in World Wide Web
- Vol. 26 (5) , 3229-3252
Open AccessAnomaly and change point detection for time series with concept drift
Anomaly detection is one of the most important research contents in time series data analysis, which is widely used in many fields. In real world, the environment is usually dynamically changing, and the distribution of data changes over time, namely concept drift. The accuracy of static anomaly detection methods is bound to be reduced by concept drift. In addition, there is a sudden concept drift, which is manifested as a abrupt variation in a data point that changes the statistical properties of data. Such a point is called a change point, and it has very similar behavior to an anomaly. However, the existing methods cannot distinguish between anomaly and change point, so the existence of change point will affect the result of anomaly detection. In this paper, we propose an unsupervised method to simultaneously detect anomaly and change point for time series with concept drift. The method is based on the fluctuation features of data and converts the original data into the rate of change of data. It not only solves the concept drift, but also effectively detects and distinguishes anomalies and change points. Experiments on both public and synthetic datasets show that compared with the state-of-the-art anomaly detection methods, our method is superior to most of the existing works and significantly superior to existing methods for change point detection. It fully demonstrates the superiority of our method in detecting anomalies and change points simultaneously.
- 30 September 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (5) , 1005-1025
GAM: A GPU-Accelerated Algorithm for MaxRS Queries in Road Networks
- 30 September 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (5) , 1005-1025
GAM: A GPU-Accelerated Algorithm for MaxRS Queries in Road Networks
- 1 January 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 235
PSATop-: Approximate range top- computation on big data- 1 January 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 235
PSATop-: Approximate range top- computation on big data