Zijun Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zijun Chen has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Wenyuan Liu
School of Information Science and Engineering, Yanshan University, Qinhuangdao, China
9 shared publications - Tingting Zhao
School of Information Science and Engineering, Yanshan University, Qinhuangdao, China
2 shared publications Wenyuan Liu
School of Artificial Intelligence (School of Software), Yanshan University, Qinhuangdao, China
2 shared publicationsXue Sun
School of Artificial Intelligence (School of Software), Yanshan University, Qinhuangdao, China
2 shared publications- Yue Jin
School of Information Science and Engineering, Yanshan University, Qinhuangdao, China
2 shared publications Bao-Wen Wang
1 shared publication
Latest Publications
- 22 September 2026
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 44 (1) , 9
Personalized maximum $(\alpha ,\beta ,\eta )$-biclique search On uncertain bipartite graph- 22 September 2026
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 44 (1) , 9
Personalized maximum $(\alpha ,\beta ,\eta )$-biclique search On uncertain bipartite graph- 4 August 2025
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 67 (11) , 10833-10861
Maximal $\Delta $-biclique enumeration in temporal bipartite graphs- 4 August 2025
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 67 (11) , 10833-10861
Maximal $\Delta $-biclique enumeration in temporal bipartite graphs- 26 November 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-19
H-dominant skyline community search in multi-valued networks
- 26 November 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-19
H-dominant skyline community search in multi-valued networks
- 30 March 2024
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 42 (3) , 1-39
Range constrained group query on attribute social graph
- 30 March 2024
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 42 (3) , 1-39
Range constrained group query on attribute social graph
- Open Access
- 28 January 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (5) , 3157
Correction: Enumerating all multi-constrained s–t paths on temporal graph
- 28 January 2024
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (5) , 3157
Open AccessCorrection: Enumerating all multi-constrained s–t paths on temporal graph
- 27 September 2023
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (2) , 1135-1165
Enumerating all multi-constrained s-t paths on temporal graph
- 27 September 2023
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 66 (2) , 1135-1165
Enumerating all multi-constrained s-t paths on temporal graph
- Open Access
- 1 January 2022
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 19 (3) , 1283-1304
Nearest close friend query in road-social networks
Nearest close friend query (k?NCF) in geo-social networks, aims to find the k nearest user objects from among the ?-hop friends of the query user. Existing efforts on k?-NCF find the user objects in the Euclidean space. In this paper, we study the problem of nearest close friend query in road-social networks.We propose two methods. One is based on Dijkstra algorithm, and the other is based on ISLabel. For the Dijkstra-based method, Dijkstra algorithm is used to traverse the user objects needed. For the label-based method, we make use of IS-Label to calculate the distance between two vertices to avoid traversing the edges that do not contain the desired user object. For each method, we propose effective termination conditon to terminate the query process early. Finally, we conduct a variety of experiments on real and synthetic datasets to verify the efficiency of the proposed methods.
- 1 January 2022
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 19 (3) , 1283-1304
Open AccessNearest close friend query in road-social networks
Nearest close friend query (k?NCF) in geo-social networks, aims to find the k nearest user objects from among the ?-hop friends of the query user. Existing efforts on k?-NCF find the user objects in the Euclidean space. In this paper, we study the problem of nearest close friend query in road-social networks.We propose two methods. One is based on Dijkstra algorithm, and the other is based on ISLabel. For the Dijkstra-based method, Dijkstra algorithm is used to traverse the user objects needed. For the label-based method, we make use of IS-Label to calculate the distance between two vertices to avoid traversing the edges that do not contain the desired user object. For each method, we propose effective termination conditon to terminate the query process early. Finally, we conduct a variety of experiments on real and synthetic datasets to verify the efficiency of the proposed methods.
- 12 November 2021
- Published by Springer Nature in GeoInformatica
- Vol. 26 (1) , 201-231
Reverse keyword-based location search on road networks
- 12 November 2021
- Published by Springer Nature in GeoInformatica
- Vol. 26 (1) , 201-231
Reverse keyword-based location search on road networks
- Open Access
- 1 January 2021
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 18 (3) , 1077-1100
Time-aware collective spatial keyword query
The collective spatial keyword query is a hot research topic in the database community in recent years, which considers both the positional relevance to the query location and textual relevance to the query keywords. However, in real life, the temporal information of object is not always valid. Based on this, we define a new query, namely time-aware collective spatial keyword query (TCoSKQ), which considers the positional relevance, textual relevance, and temporal relevance between objects and query at the same time. Two evaluation functions are defined to meet different needs of users, for each of which we propose an algorithm. Effective pruning strategies are proposed to improve query efficiency based on the two algorithms. Finally, the experimental results show that the proposed algorithms are efficient and scalable.
- 1 January 2021
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 18 (3) , 1077-1100
Open AccessTime-aware collective spatial keyword query
The collective spatial keyword query is a hot research topic in the database community in recent years, which considers both the positional relevance to the query location and textual relevance to the query keywords. However, in real life, the temporal information of object is not always valid. Based on this, we define a new query, namely time-aware collective spatial keyword query (TCoSKQ), which considers the positional relevance, textual relevance, and temporal relevance between objects and query at the same time. Two evaluation functions are defined to meet different needs of users, for each of which we propose an algorithm. Effective pruning strategies are proposed to improve query efficiency based on the two algorithms. Finally, the experimental results show that the proposed algorithms are efficient and scalable.
- 27 May 2019
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 122, 81-100
Time-aware spatial keyword cover query
- 27 May 2019
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 122, 81-100
Time-aware spatial keyword cover query