Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zilin Song

dblp:08/1866 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · conflict

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

Computer networks · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 100%
Artificial intelligence
1 paper
Graph learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph construction
0.912025
COGRASP: Co-Occurrence Graph Based Stock Price Forecasting · IJCAI 2025
Computational finance and economics › financial market prediction
stock price prediction
0.912025
COGRASP: Co-Occurrence Graph Based Stock Price Forecasting · IJCAI 2025
Web and social media mining
social media analysis
0.912025
COGRASP: Co-Occurrence Graph Based Stock Price Forecasting · IJCAI 2025
Internet of things and sensor networks › mobile sensing › aerial sensing
aerial sensor network
0.812024
Methods to Assign UAVs for K-Coverage and Recharging in IoT Networks · IEEE Trans. Mob. Comput. 2024
Internet of things and sensor networks › wireless sensor network › coverage problem
k-coverage
0.812024
Methods to Assign UAVs for K-Coverage and Recharging in IoT Networks · IEEE Trans. Mob. Comput. 2024
Mathematical optimization › discrete optimization
mixed integer linear programming
0.212024
Methods to Assign UAVs for K-Coverage and Recharging in IoT Networks · IEEE Trans. Mob. Comput. 2024

Methods — techniques the papers use, named apart from their topics

multi-timescale aggregation · 2.6monte carlo tree search · 1.5model predictive control · 1.5mixed integer linear programming · 1.5
YearPublicationVenuePosition
2025 COGRASP: Co-Occurrence Graph Based Stock Price Forecasting
abstract
Forecasting stock prices is complex and challenging. Uncovering correlations among stocks has proven to enhance stock price forecasting. However, existing correlation discovery methods, such as concept-based methods, are slow, inaccurate, and limited by their reliance on predefined concepts and manual analysis. In this paper, we propose COGRASP, a novel approach for stock price forecasting that constructs stock co-occurrence graphs automatically by analyzing rapidly updated sources such as reports, newspapers, and social media. Besides, we aggregate forecasts across multiple timescales (i.e., long-, medium-, and short-term) to capture multi-timescale trends fluctuations, thereby enhancing price forecasting accuracy. In experiments with real-world open-source stock market data, COGRASP outperforms state-of-the-art methods.
Zhengze Li, Zilin Song, Tingting Yuan 0001, Xiaoming Fu 0001
IJCAI2
2025 Optimizing Targets Coverage Quality in UAV-Aided IoT Networks
abstract
This article considers maximizing coverage quality in Internet of Things (IoT) networks using unmanned aerial vehicles (UAVs) to augment the link from solar-powered devices to a sink/gateway. Specifically, it aims to jointly optimize the assignment of UAVs to hovering points or a charging station, time in which devices monitor targets, and the amount of data transmitted by devices. These quantities are optimized over a given planning horizon using a mixed integer linear program (MILP). Further, this article presents a heuristic method named decoupled energy aware algorithm (DEAA) to optimize the said quantities. In addition, it outlines a model predictive control (MPC) approach that only requires current and historical energy arrivals information of devices. The simulation results showed that DEAA and MPC achieved 80.58% and 61.19% of the optimal results computed by MILP.
Zilin Song, Kwan-Wu Chin, Changlin Yang
IEEE Internet Things J.1
2024 Methods to Assign UAVs for K-Coverage and Recharging in IoT Networks
abstract
This article studies a coverage problem in Internet of things (IoT) networks using unmanned aerial vehicles (UAVs) supported by solar-powered charging platforms. The problem at hand is to determine an assignment of UAVs to either a charging station or a monitoring point over a planning horizon. A key constraint is$K$-coverage, where given a set of$\mathcal {M}$points,$K$of these points must be monitored by a UAV in each time slot. In this respect, the paper aims to design UAVs assignment solutions that yield the longest$K$-coverage lifetime. We formulate a novel mixed integer linear program (MILP) to jointly optimize UAVs assignments over a given planning horizon. The problem is challenging as the energy level of charging platforms and UAVs are coupled across time slots. Moreover, the formulated MILP requires non-causal energy arrivals information at charging platforms. To this end, we outline a model predictive control (MPC) and a Monte Carlo tree search (MCTS) based solution that use non-causal energy arrivals information. The simulation results show that MPC and MCTS achieve approximately 81.04% and 67.07% of the optimal results computed by MILP.
Zilin Song, Kwan-Wu Chin, Changlin Yang, Montserrat Ros
IEEE Trans. Mob. Comput.1
2023 On Complete Targets Coverage in Rechargeable IoT Networks: A Message-Passing Approach
abstract
This article studies targets coverage in an energy harvesting (EH) Internet of Things (IoT) network. Specifically, it addresses the problem of activating subsets of EH sensor nodes to monitor targets, such as valuable assets or the ingresses and egresses of a building. A key requirement, so called complete targets coverage, is that all targets must be monitored by at least one sensor node at all times. To meet this requirement, we need to derive set covers, where each set cover is comprised of one or more sensor nodes that are activated simultaneously in each time slot. To this end, we show for the first time how the belief propagation message-passing framework can be used to derive these set covers. Advantageously, our approach does not require future energy arrivals information at devices. The results show that our message-passing approach is within 90% of the optimal coverage lifetime.
Zilin Song, Kwan-Wu Chin, Changlin Yang
IEEE Internet Things J.1