Yuxiang Wang

Prof. Dr. Yuxiang Wang

School of Computer Science, Hangzhou Dianzi University, Hangzhou 310018, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
7 May 2020 in Advances in Orthopedics
Verified
Journal Article
Open access
PDF file
DMDaudi R. Manini
Daudi R. Manini
FSFrank D. Shega
Frank D. Shega
CGChaofeng Guo
Chaofeng Guo
YWYuXiang Wang
YuXiang Wang
Background. Platelet-rich plasma (PRP) has been used very successfully in enhancing bone fusion in animal experiments. Also, the efficaciousness of PRP in other specialties of medicine such as dentistry, dermatology ophthalmology, and sports medicine is well documented. But the use of PRP to augment bone fusion after spinal surgery in humans is still controversial. We conducted a meta-analysis to determine the role of PRP in enhancing spinal fusion by fastening the rate of new bone formation and decreasing pain after spinal surgery in humans. Methods. We searched PubMed, EMBASE, and the Cochrane Library studies that compared PRP versus control in enhancing spinal fusion after deformity correction. Results. Five retrospective studies with 253 participants and nine prospective cohort studies with 460 participants were identified. The bone fusion rate was excellent for studies that used a high platelet concentration in PRP relative to control (odds ratio (OR) = 4.35, 95% confidence interval (CI) (2.13, 8.83), and P<0.05) while bone fusion was poor to studies that used a low concentrate of platelet in PRP relative to control. The rate of new bone formation was high in the PRP group compared to the control group with the mean difference in Hounsfield unit (HU) 144.91 (95% CI (80.63, 209.18), P<0.05). Time to bone fusion was short in the PRP group during the first six months of surgery relative to the control group with a mean difference of −2.03 (95% CI (−2.35, −1.7); P<0.05). No difference was found in pain reduction by visual analog score (VAS) between the PRP group and control. Conclusion. PRP facilitates new bone formation and bone fusion with a minimum concentration of the growth factor 5 times that of the peripheral blood. PRP stimulatory effects are not continuous and are very effective within six months of implantation.

24 December 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
YGYuxia Geng
Yuxia Geng
JCJiaoyan Chen
Jiaoyan Chen
YZYuhang Zeng
Yuhang Zeng
ZCZhuo Chen
Zhuo Chen
WZWen Zhang
Wen Zhang
XXXiaoliang Xu
Xiaoliang Xu

10 July 2024
Verified
Conference Paper
Open access
YWYuxiang Wang
Yuxiang Wang
XGXiaoxuan Gou
Xiaoxuan Gou
XXXiaoliang Xu
Xiaoliang Xu
YGYuxia Geng
Yuxia Geng
XKXiangyu Ke
Xiangyu Ke
XWXiangying Wu
Xiangying Wu
Given a graph G and a query node q, community search (CS) aims to find a structurally cohesive subgraph from G that contains q. CS is widely used in many real-world applications, such as online recommendation and expert finding. Recently, the rise of learning-based CS methods has garnered extensive research interests, showcasing the promising potential of neural solutions. However, there remains room for optimization: (1) They initialize node features via classical methods, e.g., one-hot, random, and position encoding, which may fall short in capturing valuable community cohesiveness-related features. (2) The reliance on GCN or GCN-like models poses challenges in scaling to large graphs. (3) Existing methods do not adapt well to dynamic graphs, often requiring retraining from scratch. To handle this, we present CSFormer, a scalable CS based on Graph Transformer. First, we present a novel l-hop neighborhood community vector based on n-order h-index to represent each node's community features, generating a sequence of feature vectors by varying the neighborhood scope l. Then, we build a Transformer backbone to learn a good graph embedding that carries rich community features, based on which we perform a prediction-filtering-based online CS to efficiently return a community of q. We extend CSFormer to dynamic graphs and various community models. Extensive experiments on seven real-world graphs show our solution's superiority on effectiveness, e.g., we attain an average improvement of 20.6% in F1-score compared to the latest competitors.

8 October 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Tianxing WuTianxing Wu
Tianxing Wu
CGChaoyu Gao
Chaoyu Gao
LLLin Li
Lin Li
YWYuxiang Wang
Yuxiang Wang
In recent years, the scale of knowledge graphs and the number of entities have grown rapidly. Entity matching across different knowledge graphs has become an urgent problem to be solved for knowledge fusion. With the importance of entity matching being increasingly evident, the use of representation learning technologies to find matched entities has attracted extensive attention due to the computability of vector representations. However, existing studies on representation learning technologies cannot make full use of knowledge graph relevant multi-modal information. In this paper, we propose a new cross-lingual entity matching method (called CLEM) with knowledge graph representation learning on rich multi-modal information. The core is the multi-view intact space learning method to integrate embeddings of multi-modal information for matching entities. Experimental results on cross-lingual datasets show the superiority and competitiveness of our proposed method.

7 September 2020 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
XXXiaoliang Xu
Xiaoliang Xu
CLChang Li
Chang Li
YWYuxiang Wang
Yuxiang Wang
YXYixing Xia
Yixing Xia

22 March 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
YWYuxiang Wang
Yuxiang Wang
JLJun Liu
Jun Liu
XXXiaoliang Xu
Xiaoliang Xu
XKXiangyu Ke
Xiangyu Ke
Tianxing WuTianxing Wu
Tianxing Wu
XGXiaoxuan Gou
Xiaoxuan Gou
Expert finding is crucial for a wealth of applications in both academia and industry. Given a user query and trove of academic papers, expert finding aims at retrieving the most relevant experts for the query, from the academic papers. Existing studies focus on embedding-based solutions that consider academic papers’ textual semantic similarities to a query via document representation and extract the top- n experts from the most similar papers. Beyond implicit textual semantics, however, papers’ explicit relationships (e.g., co-authorship) in a heterogeneous graph (e.g., DBLP) are critical for expert finding, because they help improve the representation quality. Despite their importance, the explicit relationships of papers generally have been ignored in the literature. In this article, we study expert finding on heterogeneous graphs by considering both the explicit relationships and implicit textual semantics of papers in one model. Specifically, we define the cohesive ( k , 𝒫)-core community of papers w.r.t. a meta-path 𝒫 (i.e., relationship) and propose a ( k , 𝒫)-core based document embedding model to enhance the representation quality. Based on this, we design a proximity graph-based index (PG-Index) of papers and present a threshold algorithm (TA)-based method to efficiently extract top- n experts from papers returned by PG-Index. We further optimize our approach in two ways: (1) we boost effectiveness by considering the ( k , 𝒫)-core community of experts and the diversity of experts’ research interests, to achieve high-quality expert representation from paper representation; and (2) we streamline expert finding, going from “extract top- n experts from top- m ( m> n ) semantically similar papers” to “directly return top- n experts”. The process of returning a large number of top- m papers as intermediate data is avoided, thereby improving the efficiency. Extensive experiments using real-world datasets demonstrate our approach’s superiority.