Computer Science ›› 2026, Vol. 53 ›› Issue (9): 145-156.doi: 10.11896/jsjkx.250800036

• Database & Big Data & Data Science • Previous Articles     Next Articles

Multimodal Renewable Energy Data Feature Graph Modeling Method Based on Hard Prompts

WANG Xingyue1, YE Hongting1, XU Honghua2, ZHOU Suyang3, KONG Youyong1   

  1. 1 School of Computer Science and Engineering,Southeast University,Nanjing 211189,China
    2 Nanjing Power Supply Branch of State Grid Corporation of China,Nanjing 210008,China
    3 School of Electrical Engineering,Southeast University,Nanjing 210096,China
  • Received:2025-08-11 Revised:2025-11-26 Online:2026-09-15 Published:2026-09-10
  • About author:WANG Xingyue,born in 2002,postgra-duate.His main research interests include large language model and spatial-temporal forecasting.
    KONG Youyong,born in 1987,associate professor,Ph.D supervisor.His main research interests include artificial intelligence,large language model and cross application.
  • Supported by:
    State Grid Corporation of China Headquarters Technology Project (5700-202499327A-1-3-ZB).

Abstract: To meet the requirements of grid connection of renewable energy power generation and the construction of smart grids,research on feature graph modeling methods for renewable energy data is of great significance.Graph-structured data can model various real-world systems and is widely used in various fields.However,the complex non-Euclidean geometry of graph-structured data and the scarcity of annotated data pose severe challenges to the generalization ability of graph neural networks.Traditional supervised learning relies on large-scale annotated data,while the “pre-training and fine-tuning” paradigm suffers from the dual bottlenecks of inconsistent optimization objectives and high overhead of full parameter fine-tuning.In recent years,prompt learning has provided new approaches to overcome these bottlenecks by aligning tasks and efficiently fine-tuning parameters.However,existing graph prompting methods still suffer from the common problem of poor cross-domain adaptability.To address this issue,this paper proposes a multimodal renewable energy data feature graph modeling method based on hard prompts.This method uses a text attribute graph to uniformly describe multimodal renewable energy data using natural language.It then integrates a large language model to learn semantic feature embedding.This enables the model to effectively extract semantic representations of different features,achieving semantically consistent modeling of multimodal renewable energy data features.This method also innovates the construction of graph structures by introducing prompt nodes and category nodes to unify the goals of multi-domain and multi-task graph tasks and provide guidance for the model.Furthermore,this method employs an alternating training strategy to improve training efficiency and enhance the model’s generalization capabilities.Experiments on five graph datasets and one renewable energy wind power dataset validate the effectiveness of this method,demonstrating its ability to graph model multimodal data features,including renewable energy data.

Key words: Graph neural networks, Pre-training, Fine-tuning, Prompt learning, General models

CLC Number: 

  • TP391
[1] ZHANG X,WANG Z,LI J,et al.Key node identification in temporal social networks based on deep learning and multi-feature fusion[J].Computer Science,2026,53(4):143-154.
[2] WANG Z,LIU M,LUO Y,et al.Advanced graph and sequence neural networks for molecular property prediction and drug discovery[J].Bioinformatics,2022,38(9):2579-2586.
[3] FENG N,GUO S,SONG C,et al.Multi-component spatial-temporal graph convolution networks fortraffic flow forecasting[J].Journal of Software,2019,30(3):759-769.
[4] WANG R,YAN Y,WANG J,et al.Acekg:A large-scale know-ledge graph for academic data mining[C] //Proceedings of the 27th ACM International Conference on Information and Know-ledge Management.2018:1487-1490.
[5] ZHANG H,WANG X,HAN L,et al.Research on Question Answering System on Joint of Knowledge Graph and Large Language Models[J].Journal of Frontiers of Computer Science and Technology,2023,17(10):2377-2388.
[6] YING R,HE R,CHEN K,et al.Graph convolutional neural networks for web-scale recommender systems[C] //Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining.2018:974-983.
[7] ZHANG C,SONG D,HUANG C,et al.Heterogeneous graph neural network[C] //.Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mi-ning.2019:793-803.
[8] WU Y,WANG Y,WANG X,et al.Motif-Based Hypergraph Convolution Network for Semi-SupervisedNode Classification on Heterogeneous Graph[J].Chinese Journal of Computers,2021,44(11):2248-2260.
[9] ZHANG M,CHEN Y.Link prediction based on graph neural networks[C] //Proceedings of the 32nd International Conference on Neural Information Processing Systems.2018:5171-5181.
[10] WANG Z,SHEN H,CAO Q,et al.Survey on Graph Classification[J].Journal of Software,2022,33(1):171-192.
[11] XIE Y,WANG Z,YANG C,et al.Komen:Domain knowledge guided interaction recommendation for emerging scenarios[C] //Proceedings of the ACM Web Conference 2022.2022:1301-1310.
[12] LU W,WU Q,ZHANG J,et al.Tankbind:Trigonometry-aware neural networks for drugprotein binding structure prediction[J].Advances in Neural Information Processing Systems,2022,35:7236-7249.
[13] KRIEGE N M,JOHANSSON F D,MORRIS C.A survey on graph kernels[J].Applied Network Science,2020,5:1-42.
[14] PLATT J C.Fast training of support vector machines using sequential minimal optimization [M].MIT Press,1999:185-208.
[15] XU B,CEN K,HUANG J,et al.A Survey on Graph Convolutional Neural Network[J].Chinese Journal of Computers,2020,43(5):755-780.
[16] GILMER J,SCHOENHOLZ S S,RILEY P F,et al.Neural message passing for quantum chemistry[C] //International Confe-rence on Machine Learning.PMLR,2017:1263-1272.
[17] KIPF T N,WELLING M.Semi-supervised classification withgraph convolutional networks[C] //International Conference on Learning Representations.2017.
[18] VELICKOVIC P,CUCURULL G,CASANOVA A,et al.Graph attention networks[C] //ICLR.2018.
[19] VASWANI A,SHAZEER N,PARMAR N,et al.Attention is all you need[C] //Proceedings of the 31st International Confe-rence on Neural Information Processing Systems.2017:6000-6010.
[20] DEVLIN J,CHANG M W,LEE K,et al.Bert:Pre-training of deep bidirectional transformers for language understanding[C] //Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics:Human Language Technologies,.2019:4171-4186.
[21] BROWN T,MANN B,RYDER N,et al.Language models are few-shot learners[J].Advances in Neural Information Proces-sing Systems,2020,33:1877-1901.
[22] WU Z,JAIN P,WRIGHT M,et al.Representing long-range context for graph neural networks with global attention[J].Advances in Neural Information Processing Systems,2021,34:13266-13279.
[23] CHEN D,O’BRAY L,BORGWARDT K.Structure-awaretransformer for graph representation learning[C] //International Conference on Machine Learning.PMLR,2022:3469-3489.
[24] YING C,CAI T,LUO S,et al.Do transformers really perform badly for graph representation?[J].Advances in neural information processing systems,2021,34:28877-28888.
[25] ZHU Y,XU Y,YU F,et al.Graph contrastive learning withadaptive augmentation[C] //Proceedings of the Web Conference 2021.2021:2069-2080.
[26] HOU Z,LIU X,CEN Y,et al.Graphmae:Self-supervisedmasked graph autoencoders[C] //Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mi-ning.2022:594-604.
[27] YOU Y,CHEN T,SUI Y,et al.Graph contrastive learning with augmentations[J].Advances in Neural Information Processing Systems,2020,33:5812-5823.
[28] XIA J,WU L,CHEN J,et al.Simgrace:A simple framework for graph contrastive learning without data augmentation[C] //Proceedings of the ACM Web Conference 2022.2022:1070-1079.
[29] LIU P,YUAN W,FU J,et al.Pre-train,prompt,and predict:A systematic survey of prompting methods in natural language processing[J].ACM Computing Surveys,2023,55(9):1-35.
[30] SUN M,ZHOU K,HE X,et al.Gppt:Graph pre-training andprompt tuning to generalize graph neural networks[C] //Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.2022:1717-1727.
[31] LIU Z,YU X,FANG Y,et al.Graphprompt:Unifying pre-training and downstream tasks for graph neural networks[C] //Proceedings of the ACM Web Conference 2023.2023:417-428.
[32] FANG T,ZHANG Y,YANG Y,et al.Universal prompt tuning for graph neural networks[J].Advances in Neural Information Processing Systems,2023,36:52464-52489.
[33] SUN X,CHENG H,LI J,et al.All in one:Multi-task prompting for graph neural networks[C] //Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.2023:2120-2131.
[34] YU J,LIU Y,ZHANG Y,et al.Survey on Large-Scale Graph Pattern Matching[J].Journal of Computer Research and Deve-lopment,2015,52(2):391-409.
[35] SHERVASHIDZE N,SCHWEITZER P,VAN LEEUWEN EJ,et al.Weisfeiler-lehman graph kernels[J].Journal of Machine Learning Research,2011,12:2539-2561.
[36] BUNKE H.On a relation between graph edit distance and maximum common subgraph[J].Pattern Recognition Letters,1997,18(8):689-694.
[37] HAMMOND D K,VANDERGHEYNST P,GRIBONVAL R.Wavelets on graphs via spectral graph theory[J].Applied and Computational Harmonic Analysis,2011,30(2):129-150.
[38] HAMILTON W L,YING R,LESKOVEC J.Inductive representation learning on large graphs[C] //Proceedings of the 31st International Conference on Neural Information Processing Systems.2017:1025-1035.
[39] XU K,HU W,LESKOVEC J,et al.How powerful are graphneural networks?[C] //International Conference on Learning Representations.2019.
[40] DWIVEDI V P,BRESSON X.A generalization of transformer networks to graphs[J].arXiv:2012.09699,2020.
[41] YAN Y,ZHANG P,FANG Z,et al.Inductive graph alignment prompt:bridging the gap between graph pre-training and inductive fine-tuning from spectral perspective[C] //Proceedings of the ACM Web Conference 2024.2024:4328-4339.
[42] HOU Z,HE Y,CEN Y,et al.Graphmae2:A decoding-enhanced masked self-supervised graph learner[C] //Proceedings of the ACM Web Conference 2023.2023:737-746.
[43] YU B,CAI X,WEI J.Few-shot text classification method based on prompt learning[J].Journal of Computer Applications,2023,43(9):2735-2740.
[44] WANG R,WU F,ZHANG B.Multi-label Image Classification Method Based on Prompt Learning and Attention Mechanism[J].Software Engineering,2024,27(7):42-46.
[45] ZHANG D,WAN W.Fine-Tuning via Mask Language ModelEnhanced Representations Based Contrastive Learning and Application[J].Computer Engineering and Applications,2024,60(17):129-138.
[46] SEN P,NAMATA G,BILGIC M,et al.Collective classification in network data[J].AI magazine,2008,29(3):93.
[47] BORDES A,USUNIER N,GARCIA-DURÁN A,et al.Translating embeddings for modeling multirelational data[C] //Procee-dings of the 27th International Conference on Neural Information Processing Systems.2013:2787-2795.
[48] WU Z,RAMSUNDAR B,FEINBERG E N,et al.Moleculenet:a benchmark for molecular machine learning[J].ChemicalScience,2018,9(2):513-530.
[49] MERNYEI P,CANGEA C.Wiki-cs:A wikipedia-based bench-mark for graph neural networks[J].arXiv:2007.02901,2020.
[50] YANG X,YAN M,PAN S,et al.Simple and efficient heterogeneous graph neural network[J].Proceedings of the AAAI Conference on Artificial Intelligence,2023,37(9):10816-10824.
[51] HE M,WEI Z,FENG S,et al.Spectral heterogeneous graphconvolutions via positive noncommutative polynomials[C] //Proceedings of the ACM Web Conference 2024.2024:685-696.
[52] REIMERS N,GUREVYCH I.Sentence-BERT:Sentence em-beddings using Siamese BERTnetworks[C] //Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing(EMNLP-IJCNLP).2019:3982-3992.
[53] HE P,LIU X,GAO J,et al.Deberta:Decoding-enhanced bert with disentangled attention[J].arXiv:2006.03654,2020.
[54] TOUVRON H,LAVRIL T,IZACARD G,et al.Llama:Openand efficient foundation language models[J].arXiv:2302.13971,2023.
[55] YANG A,YANG B,ZHANG B,et al.Qwen2.5 technical report[J].arXiv:2412.15115,2024.
[56] GUO D,YANG D,ZHANG H,et al.Deepseek-r1:Incentivizing reasoning capability in llms via reinforcement learning[J].ar-Xiv:2501.12948,2025.
[57] GLOROT X,BORDES A,BENGIO Y.Deep sparse rectifierneural networks[C] //Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics.JMLR Workshop and Conference Proceedings,2011:315-323.
[58] KINGMA D P,BA J.Adam:A method for stochastic optimization[J].arXiv:1412.6980,2014.
[59] VAN DER MAATEN L,HINTON G.Visualizing data using t-sne.[J].Journal of Machine Learning Research,2008,9(86):2579-2605.
[1] ZHANG Rongjie, PANG Xiongwen, WANG Fengling. Review of Large Language Model-based Time Series Modeling via Fine-tuning and AgentArchitecture [J]. Computer Science, 2026, 53(9): 55-70.
[2] XU Jianjun, BI Ying, CHEN Mingming, LIANG Jing. Survey of Molecular Pre-training Models and Their Applications in Drug Discovery [J]. Computer Science, 2026, 53(9): 110-123.
[3] FENG Guang, SUN Xiangli, LIN Yibao, LIU Xinting, CAO Yuqiao, HUANG Junhui, LIAO Beirong. Multimodal Sentiment Analysis Based on Prompt Learning and Guided Gated Fusion Mechanism [J]. Computer Science, 2026, 53(9): 299-308.
[4] HE Jiaojun, LI Xin. Review of Graph Learning Based on Large Language Models:Methods,Benchmarks and Advances [J]. Computer Science, 2026, 53(9): 1-15.
[5] AN Ran, CHENG Kai, SHAO Tianhao, LI Changyuan, CHEN Yan. Framework,Techniques and Challenges of Task Planning Agent Based on Large Language Model [J]. Computer Science, 2026, 53(9): 24-37.
[6] JIANG Hangyu, CAO Huaihu, ZHOU Kai, CHEN Fu, SU Rui. Dual-channel Message Passing for Class-imbalanced Graph Fraud Detection [J]. Computer Science, 2026, 53(9): 439-450.
[7] ZHANG Zhonglin, XIA Hang. LSQ-RAG:Retrieval-enhanced Generation Framework Based on LLM-enhanced Ranker [J]. Computer Science, 2026, 53(8): 298-306.
[8] DING Zhijun, AI Fangju, LIU Aihuan. Document-level Event Argument Extraction Model Based on Hierarchical Dependency Aggregation and Event Enhancement [J]. Computer Science, 2026, 53(7): 156-167.
[9] LI Kaiju, YIN Chenyang, CHENG Zhangtao, LIU Xueting, ZHOU Fan. Causal Subgraph Learning for Cascade Popularity Prediction [J]. Computer Science, 2026, 53(7): 213-221.
[10] WANG Jiajun, JIAO Pengfei, ZHANG Xinxun, LI Tianpeng, GAO Mengzhou. Unsupervised Dynamic Graph Change Point Detection Method Based on Variational Graph Auto-encoder [J]. Computer Science, 2026, 53(7): 272-279.
[11] TAI Wenxin, LIU Xueting, WANG Xiaohan, ZHONG Ting, WANG Yong, ZHOU Fan. Trustworthy IP Geolocation Method via Graph Neural Networks and Conformalized Quantile Regression [J]. Computer Science, 2026, 53(7): 308-314.
[12] ZHANG Xinliang, LIU Lilong, CHEN Shangheng, CHEN Ziyang, QIAN Shengsheng. Dual-stream Heterogeneous Social Graph for Micro-video Popularity Prediction [J]. Computer Science, 2026, 53(6A): 250800073-8.
[13] ZHANG Zihao, WU Zezhong. Optimization of HAN-based GNN-Transformer Collaborative Contrastive Learning Framework [J]. Computer Science, 2026, 53(6A): 250900103-8.
[14] DUAN Pengsong, LUO Yu, WANG Chao. Q&A Model for Agricultural Diseases Based on Transformer [J]. Computer Science, 2026, 53(6A): 250400114-9.
[15] HAN Zhigeng, FU Chunshuo. Fraud Detection Model Based on Dual-space Heterogeneous Graph Neural Network [J]. Computer Science, 2026, 53(6A): 250600050-6.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!