Jianjiao Ji 0001

dblp:242/1666-1 · also Jian-Jiao Ji 0001 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0002-9947-0621ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Adaptive stochastic configuration network based on online active learning for evolving data streams
Yinan Guo 0001, Jiayang Pu, Jiale He, Botao Jiao, Jianjiao Ji 0001, Shengxiang Yang
Inf. Sci.5
2025 Evolutionary stochastic configuration networks for industrial data analytics
Jianjiao Ji 0001
Inf. Sci.1
2023 Generative adversarial networks-based dynamic multi-objective task allocation algorithm for crowdsensing
Jianjiao Ji 0001, Yinan Guo 0001, Rui Wang 0017, Dun-Wei Gong
Inf. Sci.1
2023 Q-Learning-Based Hyperheuristic Evolutionary Algorithm for Dynamic Task Allocation of Crowdsensing
abstract
Task allocation is a crucial issue of mobile crowdsensing. The existing crowdsensing systems normally select the optimal participants giving no consideration to the sudden departure of mobile users, which significantly affects the sensing quality of tasks with a long sensing period. Furthermore, the ability of a mobile user to collect high-precision data is commonly treated as the same for different types of tasks, causing the unqualified data for some tasks provided by a competitive user. To address the issue, a dynamic task allocation model of crowdsensing is constructed by considering mobile user availability and tasks changing over time. Moreover, a novel indicator for comprehensively evaluating the sensing ability of mobile users collecting high-quality data for different types of tasks at the target area is proposed. A new Q -learning-based hyperheuristic evolutionary algorithm is suggested to deal with the problem in a self-learning way. Specifically, a memory-based initialization strategy is developed to seed a promising population by reusing participants who are capable of completing a particular task with high quality in the historical optima. In addition, taking both sensing ability and cost of a mobile user into account, a novel comprehensive strength-based neighborhood search is introduced as a low-level heuristic (LLH) to select a substitute for a costly participant. Finally, based on a new definition of the state, a Q -learning-based high-level strategy is designed to find a suitable LLH for each state. Empirical results of 30 static and 20 dynamic experiments expose that this hyperheuristic achieves superior performance compared to other state-of-the-art algorithms.
Jianjiao Ji 0001, Yinan Guo 0001, Xiao Zhi Gao 0001, Dun-Wei Gong, Yapeng Wang 0003
IEEE Trans. Cybern.1
2019 Firework-based software project scheduling method considering the learning and forgetting effect
Yinan Guo 0001, Jianjiao Ji 0001, Junhua Ji, Dun-Wei Gong, Jian Cheng 0004, Xiaoning Shen
Soft Comput.2