Xin Xu

Ms. Xin Xu

Beijing University of Posts and Telecommunications, Beijing, China
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
MXMingying Xu
Mingying Xu
JDJunping Du
Junping Du
ZGZeli Guan
Zeli Guan
ZXZhe Xue
Zhe Xue
FKFeifei Kou
Feifei Kou
ALAng Li
Ang Li
Computer science discipline includes many research fields, which mutually influence and promote each other’s development. This poses two great challenges of predicting the research topics of each research field. One is how to model fine‐grained topic representation of a research field. The other is how to model research topic of different fields and keep the semantic consistency of research topics when learning the scientific influence context from other related fields. Unfortunately, the existing research topic prediction approaches cannot handle these two challenges. To solve these problems, we employ multiple different Recurrent Neural Network chains which model research topics of different fields and propose a research topic prediction model based on spatial attention and semantic consistency‐based scientific influence modeling. Spatial attention is employed in field topic representation which can selectively extract the attributes from the field topics to distinguish the importance of field topic attributes. Semantic consistency‐based scientific influence modeling maps research topics of different fields to a unified semantic space to obtain the scientific influence context of other related fields. Extensive experiment results on five related research fields in the computer science (CS) discipline show that the proposed model is superior to the most advanced methods and achieves good topic prediction performance.

3 January 2023 in Electronics
Verified
Journal Article
Open access
PDF file
XXXin Xu
Xin Xu
JDJunping Du
Junping Du
JSJie Song
Jie Song
ZXZhe Xue
Zhe Xue
Graph neural networks have a wide range of applications, such as citation networks, social networks, and knowledge graphs. Among various graph analyses, node classification has garnered much attention. While many of the recent network embedding models achieve promising performance, they usually require sufficient labeled nodes for training, which does not meet the reality that only a few labeled nodes are available in novel classes. While few-shot learning is commonly employed in the vision and language domains to address the problem of insufficient training samples, there are still two characteristics of the few-shot node classification problem in the non-Euclidean domain that require investigation: (1) how to extract the most informative knowledge for a class and use it on testing data and (2) how to thoroughly explore the limited number of support sets and maximize the amount of information transferred to the query set. We propose an InfoMax Classification-Enhanced Learnable Network (ICELN) to address these issues, motivated by Deep Graph InfoMax (DGI), which adapts the InfoMax principle to the summary representation of a graph and the patch representation of a node. By increasing the amount of information that is shared between the query nodes and the class representation, an ICELN can transfer the maximum amount of information to unlabeled data and enhance the graph representation potential. The whole model is trained using an episodic method, which simulates the actual testing environment to ensure the meta-knowledge learned from previous experience may be used for entirely new classes that have not been studied before. Extensive experiments are conducted on five real-world datasets to demonstrate the advantages of an ICELN over the existing few-shot node classification methods.

8 October 2021
Verified
Book Chapter
Closed access
PDF file
YWYuhui Wang
Yuhui Wang
JDJunping Du
Junping Du
YSYingxia Shao
Yingxia Shao
ALAng Li
Ang Li
XXXin Xu
Xin Xu

20 January 2023 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
XXXin Xu
Xin Xu
JDJunping Du
Junping Du
ZXZhe Xue
Zhe Xue

1 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
MXMingying Xu
Mingying Xu
JDJunping Du
Junping Du
FKFeifei Kou
Feifei Kou
MLMeiyu Liang
Meiyu Liang
XXXin Xu
Xin Xu
JYJiaxin Yang
Jiaxin Yang
Internet of Things search has great potential applications with the rapid development of Internet of Things technology. Combining Internet of Things technology and academic search to build academic search framework based on Internet of Things is an effective solution to realize massive academic resource search. Recently, the academic big data has been characterized by a large number of types and spanning many fields. The traditional web search technology is no longer suitable for the search environment of academic big data. Thus, this paper designs academic search framework based on Internet of Things Technology. In order to alleviate the pressure of the cloud server processing massive academic big data, the edge server is introduced to clean and remove the redundancy of the data to form a clean data for further analysis and processing by the cloud server. Edge computing network effectively makes up for the deficiency of cloud computing in the conditions of distributed and high concurrent access, reduces long‐distance data transmission, and improves the quality of network user experience. For Academic Search, this paper proposes a novel weakly supervised academic search model based on knowledge‐enhanced feature representation. The proposed model can relieve high cost of acquisition of manually labeled data by obtaining a lot of pseudolabeled data and consider word‐level interactive matching and sentence‐level semantic matching for more accurate matching in the process of academic search. The experimental result on academic datasets demonstrate that the performance of the proposed model is much better than that of the existing methods.