Jianpeng Qi

Orcid: 0000-0001-6150-9773

According to our database1, Jianpeng Qi authored at least 26 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Efficiently Counting Four-Node Motifs in Large-Scale Temporal Graphs.
VLDB J., July, 2025

MA<sup>2</sup> Traj: Diffusion network with multi-attribute aggregation for trajectory generation.
GeoInformatica, July, 2025

Closed-Form and Boundary Expressions for Task-Success Probability in Status-Driven Systems.
CoRR, July, 2025

A Survey on Open-Source Edge Computing Simulators and Emulators: The Computing and Networking Convergence Perspective.
CoRR, May, 2025

Efficient Information Updates in Compute-First Networking via Reinforcement Learning with Joint AoI and VoI.
CoRR, May, 2025

ScaleGNN: Towards Scalable Graph Neural Networks via Adaptive High-order Neighboring Feature Fusion.
CoRR, April, 2025

Local High-order Structure-aware Graph Neural Network for motif prediction.
Knowl. Based Syst., 2025

UMGAD: Unsupervised Multiplex Graph Anomaly Detection.
Proceedings of the 41st IEEE International Conference on Data Engineering, 2025

Scalable Trajectory-User Linking with Dual-Stream Representation Networks.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

Correlation-Attention Masked Temporal Transformer for User Identity Linkage Using Heterogeneous Mobility Data.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024
Toward Distributively Build Time-Sensitive-Service Coverage in Compute First Networking.
IEEE/ACM Trans. Netw., February, 2024

EasiEI: A Simulator to Flexibly Modeling Complex Edge Computing Environments.
IEEE Internet Things J., January, 2024

TPAoI: Ensuring Fresh Service Status at the Network Edge in Compute-First Networking.
CoRR, 2024

Hierarchical Graph Contrastive Learning for Review-Enhanced Recommendation.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2024

Multi-Relational Graph Attention Network for Social Relationship Inference from Human Mobility Data.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

MoTTo: Scalable Motif Counting with Time-aware Topology Constraint for Large-scale Temporal Graphs.
Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023
R2: A Distributed Remote Function Execution Mechanism With Built-In Metadata.
IEEE/ACM Trans. Netw., April, 2023

REMR: A Reliability Evaluation Method for Dynamic Edge Computing Network Under Time Constraint.
IEEE Internet Things J., March, 2023

2022
The fluctuation analysis of public opinion energy: Modeling social group opinion base on the event of social networks.
Intell. Syst. Appl., 2022

2021
A distributed swarm intelligence-based energy-saving method among massive edge nodes.
Int. J. Commun. Syst., 2021

REMR: A Reliability Evaluation Method for Dynamic Edge Computing Network under Time Constraints.
CoRR, 2021

2020
SMTS: a swarm intelligence-inspired sensor wake-up control method for multi-target sensing in wireless sensor networks.
Wirel. Networks, 2020

2019
IPIM: An Effective Contribution-Driven Information Propagation Incentive Mechanism.
IEEE Access, 2019

2017
An effective and efficient hierarchical <i>K</i>-means clustering algorithm.
Int. J. Distributed Sens. Networks, 2017

2016
MR-Swarm: Mining Swarms from Big Spatio-Temporal Trajectories Using MapReduce.
Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2016, 2016

K*-Means: An Effective and Efficient K-Means Clustering Algorithm.
Proceedings of the 2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), 2016


  Loading...