Shihan Yang

Shihan Yang

Auto-generated profile, based on publicly available information

Shihan Yang

Faculty of Management and Economics Kunming University of Science and Technology 650031 Kunming China

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 January 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
CLChunjiang Liu
Chunjiang Liu
YHYikun Han
Yikun Han
HXHaiyun Xu
Haiyun Xu
SYShihan Yang
Shihan Yang
KWKaidi Wang
Kaidi Wang
YSYongye Su
Yongye Su
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.

1 November 2010
Verified
Conference Paper
Closed access
SYShihan Yang
Shihan Yang
JWJinzhan Wu
Jinzhan Wu
One of key issues of the Semantic Web applications is the lack of semantic data (ontologies). Although the vast majority of data are stored in the popular relational databases, they are still not easily available for many next generation Web applications. Therefore, one of core challenges of Semantic Web is whether these applications can automatically retrieve semantic information from the existed relational databases. This paper proposes a middle graph-based formal model language, W-graph, a bridge between relational databases and ontologies, which abstracts semantic information from relational database instances semi-automatically and then generates an OWL ontology automatically. This method not only maps relational database schemata to ontologies, but also populates ontologies with data stored in databases. Moreover, a proof of semantic preserving on the mapping is provided, and a case study and an implemented prototype tool are also reported.

1 February 2013 in Journal of Computers
Verified
Journal Article
Open access
PDF file
SYShihan Yang
Shihan Yang
JWJinzhao Wu
Jinzhao Wu
AHAnping He
Anping He
YRYunbo Rao
Yunbo Rao
The extensible markup language (XML), a standard format of web information, has a clear syntax but unfortunately an ambiguous formal semantics, which results in being not used directly in semantic web applications. So it is tough job to reuse XML-based data intelligently in the semantic web. To address this problem, a new formal technique of obtaining ontology data automatically from XML documents is proposed. We provide the XML a semantical interpretation by developing a graph-based formal language, which then can be automatically mapped into web ontology language OWL with semantics preserved. The semantic validity and entailment problem are also concerned. The automatical mapping tool has also been developed.

29 July 2025 in Neural Processing Letters
Verified
Journal Article
Open access
PDF file
SYShihan Yang
Shihan Yang
LLLiannan Lin
Liannan Lin
CLChunjiang Liu
Chunjiang Liu
MZMingkai Zhang
Mingkai Zhang
HYHaiyi Yang
Haiyi Yang
Relation prediction in knowledge graphs is a classic task. However, predicting unseen facts under the open-world assumption remains challenging, as conventional closure reasoning methods tend to fail. To address this, we propose an uncertain knowledge graph embedding and Bayesian inferring model, UKGEBN, which examines the capabilities of approximate inference under the open-world assumption. This model employs a large language model to encode entities and relations by treating facts as natural language sentences. It then learns knowledge confidence through a recurrent neural network and subsequently constructs Bayesian networks for the uncertain knowledge graph based on the learned confidence. The constructed Bayesian network can reasonably infer unseen knowledge facts, even if the elements of these facts-such as new entities and relationships-have never been encountered in the knowledge base before. The experimental results show that the new model has improved the MSE metric by 24.6% in relation prediction on the benchmark dataset. Case studies indicate that the model significantly enhances the revelation of latent semantic information, facilitating the prediction of implicit relationships in uncertain knowledge graphs.

15 April 2014 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
SYShihan Yang
Shihan Yang
HTHongyan Tan
Hongyan Tan
JWJinzhao Wu
Jinzhao Wu
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.

1 January 2013 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
RQRui Qiao
Rui Qiao
XZXiuqin Zhong
Xiuqin Zhong
SYShihan Yang
Shihan Yang
HHHeng He
Heng He