Shihan Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shihan Yang has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
Jinzhao Wu
Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, No. 188, East Daxue Road, Nanning, Guangxi 530006, China
8 shared publicationsAnping He
Chengdu Institute of Computer Application, Chinese Academy of Sciences, Chengdu 610041, China
3 shared publicationsQiong Yu
3 shared publications- Chunjiang Liu
National Science Library (Chengdu), Chinese Academy of Sciences, Chengdu 610213, China
2 shared publications - Haiyi Yang
Faculty of Management and Economics, Kunming University of Science and Technology, Kunming, China
2 shared publications - Haiyun Xu
Business School, Shandong University of Technology, Zibo 255000, China
2 shared publications
Latest Publications
- 4 November 2026
- Published by Springer Nature in Annals of Data Science
- p. 1-23
Identification and Analysis of Information Diffusion Patterns in Social Media Networks: A Social Psychological Approach
- 4 November 2026
- Published by Springer Nature in Annals of Data Science
- p. 1-23
Identification and Analysis of Information Diffusion Patterns in Social Media Networks: A Social Psychological Approach
- Open Access
- 27 February 2026
- Published by Elsevier in SSRN Electronic Journal
Modelling Temporal Primacy-Recency Dynamics for Social Media Networks: A Graph Attention Approach for Long-term User Behavior Prediction
While behavior prediction in social networks has attracted significant research attention, accurately modeling long-term user behavior remains a challenge owing to complex temporal dynamics and psychological influences. To tackle this issue, we introduce, ChronoGAT, a novel neural network model that integrates socio-psychological mechanisms -- including primacy effect, recency effect, and social conformity -- into a multi-head graph attention architecture for improved long-term behavior forecasting. The model dynamically captures structural and temporal dependencies, with specialized attention mechanisms designed to emphasize long-range interaction patterns and psychological influences. Evaluated on a large-scale dataset from a video-sharing platform (comprising 6,789 videos, 2.63 million users, and over 3 million relations), our approach achieves a 19.4% improvement in prediction accuracy compared to state-of-the-art baselines. Notably, quantitative analysis reveals that socio-psychological factors explain over 70% of the variability in long-term content dissemination trajectories. This work offers a computationally scalable and psychologically principled framework for effectively modeling long-term user behavior in online social systems.
- 27 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessModelling Temporal Primacy-Recency Dynamics for Social Media Networks: A Graph Attention Approach for Long-term User Behavior Prediction
While behavior prediction in social networks has attracted significant research attention, accurately modeling long-term user behavior remains a challenge owing to complex temporal dynamics and psychological influences. To tackle this issue, we introduce, ChronoGAT, a novel neural network model that integrates socio-psychological mechanisms -- including primacy effect, recency effect, and social conformity -- into a multi-head graph attention architecture for improved long-term behavior forecasting. The model dynamically captures structural and temporal dependencies, with specialized attention mechanisms designed to emphasize long-range interaction patterns and psychological influences. Evaluated on a large-scale dataset from a video-sharing platform (comprising 6,789 videos, 2.63 million users, and over 3 million relations), our approach achieves a 19.4% improvement in prediction accuracy compared to state-of-the-art baselines. Notably, quantitative analysis reveals that socio-psychological factors explain over 70% of the variability in long-term content dissemination trajectories. This work offers a computationally scalable and psychologically principled framework for effectively modeling long-term user behavior in online social systems.
- Open Access
- 29 July 2025
- Published by Springer Nature in Neural Processing Letters
- Vol. 57 (4) , 1-22
Prediction of Implicit Relationships Using Uncertain Knowledge Graph Embedding and Bayesian Networks
- 29 July 2025
- Published by Springer Nature in Neural Processing Letters
- Vol. 57 (4) , 1-22
Open AccessPrediction of Implicit Relationships Using Uncertain Knowledge Graph Embedding and Bayesian Networks
- Open Access
- 24 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 369
A Community Detection and Graph-Neural-Network-Based Link Prediction Approach for Scientific Literature
This study presents a novel approach that synergizes community detection algorithms with various Graph Neural Network (GNN) models to bolster link prediction in scientific literature networks. By integrating the Louvain community detection algorithm into our GNN frameworks, we consistently enhanced the performance across all models tested. For example, integrating the Louvain model with the GAT model resulted in an AUC score increase from 0.777 to 0.823, exemplifying the typical improvements observed. Similar gains were noted when the Louvain model was paired with other GNN architectures, confirming the robustness and effectiveness of incorporating community-level insights. This consistent increase in performance—reflected in our extensive experimentation on bipartite graphs of scientific collaborations and citations—highlights the synergistic potential of combining community detection with GNNs to overcome common link prediction challenges such as scalability and resolution limits. Our findings advocate for the integration of community structures as a significant step forward in the predictive accuracy of network science models, offering a comprehensive understanding of scientific collaboration patterns through the lens of advanced machine learning techniques.
- 24 January 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (3) , 369
Open AccessA Community Detection and Graph-Neural-Network-Based Link Prediction Approach for Scientific Literature
This study presents a novel approach that synergizes community detection algorithms with various Graph Neural Network (GNN) models to bolster link prediction in scientific literature networks. By integrating the Louvain community detection algorithm into our GNN frameworks, we consistently enhanced the performance across all models tested. For example, integrating the Louvain model with the GAT model resulted in an AUC score increase from 0.777 to 0.823, exemplifying the typical improvements observed. Similar gains were noted when the Louvain model was paired with other GNN architectures, confirming the robustness and effectiveness of incorporating community-level insights. This consistent increase in performance—reflected in our extensive experimentation on bipartite graphs of scientific collaborations and citations—highlights the synergistic potential of combining community detection with GNNs to overcome common link prediction challenges such as scalability and resolution limits. Our findings advocate for the integration of community structures as a significant step forward in the predictive accuracy of network science models, offering a comprehensive understanding of scientific collaboration patterns through the lens of advanced machine learning techniques.
- Open Access
A Community Detection and Graph Neural Network Based Link Prediction Approach for Scientific Literature
This study presents a novel approach that synergizes community detection algorithms with various Graph Neural Network (GNN) models to bolster link prediction in scientific literature networks. By integrating the Louvain community detection algorithm into our GNN frameworks, we consistently enhance performance across all models tested. For example, integrating Louvain with the GAT model resulted in an AUC score increase from 0.777 to 0.823, exemplifying the typical improvements observed. Similar gains are noted when Louvain is paired with other GNN architectures, confirming the robustness and effectiveness of incorporating community-level insights. This consistent uplift in performance reflected in our extensive experimentation on bipartite graphs of scientific collaborations and citations highlights the synergistic potential of combining community detection with GNNs to overcome common link prediction challenges such as scalability and resolution limits. Our findings advocate for the integration of community structures as a significant step forward in the predictive accuracy of network science models, offering a comprehensive understanding of scientific collaboration patterns through the lens of advanced machine learning techniques.
Open AccessA Community Detection and Graph Neural Network Based Link Prediction Approach for Scientific Literature
This study presents a novel approach that synergizes community detection algorithms with various Graph Neural Network (GNN) models to bolster link prediction in scientific literature networks. By integrating the Louvain community detection algorithm into our GNN frameworks, we consistently enhance performance across all models tested. For example, integrating Louvain with the GAT model resulted in an AUC score increase from 0.777 to 0.823, exemplifying the typical improvements observed. Similar gains are noted when Louvain is paired with other GNN architectures, confirming the robustness and effectiveness of incorporating community-level insights. This consistent uplift in performance reflected in our extensive experimentation on bipartite graphs of scientific collaborations and citations highlights the synergistic potential of combining community detection with GNNs to overcome common link prediction challenges such as scalability and resolution limits. Our findings advocate for the integration of community structures as a significant step forward in the predictive accuracy of network science models, offering a comprehensive understanding of scientific collaboration patterns through the lens of advanced machine learning techniques.
- Open Access
- 1 January 2017
- Published by Atlantis Press SARL
An Approximate Model Based on Feature Matrix for Nonlinear Hybrid Systems
- 1 January 2017
- Published by Atlantis Press SARL
Open AccessAn Approximate Model Based on Feature Matrix for Nonlinear Hybrid Systems
- Open Access
- 25 October 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-9
Approximate Analyzing of Labeled Transition Systems
As the most important formal semantic model, labeled transition systems are widely used, which can describe the general concurrent systems or control systems without disturbance. However, under normal circumstance, transition systems are complex and difficult to use due to large amount of calculation and the state space explosion problems. In order to overcome these problems, approximate equivalent labeled transition systems are proposed by means of incomplete low-up matrix decomposition factorization. This technique can reduce the complexity of computation and calculate under the allowing errors. As for continuous-time linear systems, we develop a modeling method of approximated transition system based on the approximate solution of matrix, which provides a facility for approximately formal semantic modeling for linear systems and to effectively analyze errors. An example of application in the context of linear systems without disturbances is studied.
- 25 October 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-9
Open AccessApproximate Analyzing of Labeled Transition Systems
As the most important formal semantic model, labeled transition systems are widely used, which can describe the general concurrent systems or control systems without disturbance. However, under normal circumstance, transition systems are complex and difficult to use due to large amount of calculation and the state space explosion problems. In order to overcome these problems, approximate equivalent labeled transition systems are proposed by means of incomplete low-up matrix decomposition factorization. This technique can reduce the complexity of computation and calculate under the allowing errors. As for continuous-time linear systems, we develop a modeling method of approximated transition system based on the approximate solution of matrix, which provides a facility for approximately formal semantic modeling for linear systems and to effectively analyze errors. An example of application in the context of linear systems without disturbances is studied.
- Open Access
- 1 January 2015
- Published by Atlantis Press SARL
An Approximate Semantic Model of Hybrid Systems
- 1 January 2015
- Published by Atlantis Press SARL
Open AccessAn Approximate Semantic Model of Hybrid Systems
- Open Access
- 11 May 2014
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2014, 1-5
Approximate Equivalence of the Hybrid Automata with Taylor Theory
Hybrid automaton is a formal model for precisely describing a hybrid system in which the computational processes interact with the physical ones. The reachability analysis of the polynomial hybrid automaton is decidable, which makes theTaylorapproximation of a hybrid automaton applicable and valuable. In this paper, we studied the simulation relation among the hybrid automaton and its Taylor approximation, as well as the approximate equivalence relation. We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybrid automata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.
- 11 May 2014
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2014, 1-5
Open AccessApproximate Equivalence of the Hybrid Automata with Taylor Theory
Hybrid automaton is a formal model for precisely describing a hybrid system in which the computational processes interact with the physical ones. The reachability analysis of the polynomial hybrid automaton is decidable, which makes theTaylorapproximation of a hybrid automaton applicable and valuable. In this paper, we studied the simulation relation among the hybrid automaton and its Taylor approximation, as well as the approximate equivalence relation. We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybrid automata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.
- Open Access
- 15 April 2014
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2014, 1-11
Semantic Consistency Checking in Building Ontology from Heterogeneous Sources
Semantic collision is inevitable while building a domain ontology from heterogeneous data sources (semi-)automatically. Therefore, the semantic consistency is indispensable precondition for building a correct ontology. In this paper, a model-checking-based method is proposed to handle the semantic consistency problem with a kind of middle-model methodology, which could extract a domain ontology from structured and semistructured data sources semiautomatically. The method translates the middle model into the Kripke structure, and consistency assertions into CTL formulae, so a consistency checking problem is promoted to a global model checking. Moreover, the feasibility and correctness of the transformation is proved, and case studies are provided.
- 15 April 2014
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2014, 1-11
Open AccessSemantic Consistency Checking in Building Ontology from Heterogeneous Sources
Semantic collision is inevitable while building a domain ontology from heterogeneous data sources (semi-)automatically. Therefore, the semantic consistency is indispensable precondition for building a correct ontology. In this paper, a model-checking-based method is proposed to handle the semantic consistency problem with a kind of middle-model methodology, which could extract a domain ontology from structured and semistructured data sources semiautomatically. The method translates the middle model into the Kripke structure, and consistency assertions into CTL formulae, so a consistency checking problem is promoted to a global model checking. Moreover, the feasibility and correctness of the transformation is proved, and case studies are provided.