Linlin Zhu

Ms. Linlin Zhu

HeNan University, College of Computer and Information engineering,Kaifeng
+1
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
20 September 2021 in Remote Sensing
Verified
Journal Article
Open access
PDF file
Linlin ZhuLinlin Zhu
Linlin Zhu
XGXun Geng
Xun Geng
ZLZheng Li
Zheng Li
CLChun Liu
Chun Liu
It is of great significance to apply the object detection methods to automatically detect boulders from planetary images and analyze their distribution. This contributes to the selection of candidate landing sites and the understanding of the geological processes. This paper improves the state-of-the-art object detection method of YOLOv5 with attention mechanism and designs a pyramid based approach to detect boulders from planetary images. A new feature fusion layer has been designed to capture more shallow features of the small boulders. The attention modules implemented by combining the convolutional block attention module (CBAM) and efficient channel attention network (ECA-Net) are also added into YOLOv5 to highlight the information that contribute to boulder detection. Based on the Pascal Visual Object Classes 2007 (VOC2007) dataset which is widely used for object detection evaluations and the boulder dataset that we constructed from the images of Bennu asteroid, the evaluation results have shown that the improvements have increased the performance of YOLOv5 by 3.4% in precision. With the improved YOLOv5 detection method, the pyramid based approach extracts several layers of images with different resolutions from the large planetary images and detects boulders of different scales from different layers. We have also applied the proposed approach to detect the boulders on Bennu asteroid. The distribution of the boulders on Bennu asteroid has been analyzed and presented.

1 August 2023 in Journal of Neural Engineering
Verified
Journal Article
Closed access
PDF file
LZLi Zheng
Li Zheng
PLPan Liao
Pan Liao
XWXiuwen Wu
Xiuwen Wu
MCMiao Cao
Miao Cao
WCWei Cui
Wei Cui
JGJia-Hong Gao
Jia-Hong Gao
Objective. Magnetoencephalography (MEG) is a powerful non-invasive diagnostic modality for presurgical epilepsy evaluation. However, the clinical utility of MEG mapping for localising epileptic foci is limited by its low efficiency, high labour requirements, and considerable interoperator variability. To address these obstacles, we proposed a novel artificial intelligence–based automated magnetic source imaging (AMSI) pipeline for automated detection and localisation of epileptic sources from MEG data. Approach. To expedite the analysis of clinical MEG data from patients with epilepsy and reduce human bias, we developed an autolabelling method, a deep-learning model based on convolutional neural networks and a hierarchical clustering method based on a perceptual hash algorithm, to enable the coregistration of MEG and magnetic resonance imaging, the detection and clustering of epileptic activity, and the localisation of epileptic sources in a highly automated manner. We tested the capability of the AMSI pipeline by assessing MEG data from 48 epilepsy patients. Main results. The AMSI pipeline was able to rapidly detect interictal epileptiform discharges with 93.31% ± 3.87% precision based on a 35-patient dataset (with sevenfold patientwise cross-validation) and robustly rendered accurate localisation of epileptic activity with a lobar concordance of 87.18% against interictal and ictal stereo-electroencephalography findings in a 13-patient dataset. We also showed that the AMSI pipeline accomplishes the necessary processes and delivers objective results within a much shorter time frame (∼12 min) than traditional manual processes (∼4 h). Significance. The AMSI pipeline promises to facilitate increased utilisation of MEG data in the clinical analysis of patients with epilepsy.

10 January 2025 in Information Processing & Management
Verified
Journal Article
Closed access
Linlin ZhuLinlin Zhu
Linlin Zhu
HSHeli Sun
Heli Sun
XHXiaoyong Huang
Xiaoyong Huang
PLPan Lou
Pan Lou
LHLiang He
Liang He

12 May 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
HSHeli Sun
Heli Sun
MSMiaomiao Sun
Miaomiao Sun
XLXuechun Liu
Xuechun Liu
Linlin ZhuLinlin Zhu
Linlin Zhu
LHLiang He
Liang He
YCYuan Chen
Yuan Chen
Tenuous subgraph finding aims to detect a subgraph with few social interactions and weak relationships among nodes. Despite significant efforts have been made on this task, they are mostly carried out in view of graph-structured data. These methods depend on calculating the shortest path and need to enumerate all the paths between nodes, which suffer the combinatorial explosion. Moreover, they all lack the integration of neighborhood information. To this end, we propose a novel model named Graph Neural Network with Motif-aware for tenuous subgraph finding (GNNM), a neighborhood aggregation based GNNs framework which can capture the latent relationship between nodes. Specially, we design a GNN module to project nodes into a low dimensional vector combining the higher-order correlation within nodes based on a motif-aware module. And then design greedy algorithms in vector space to obtain a tenuous subgraph whose size is greater than a specified constraint. Particularly, considering existing evaluation indicators cannot capture the latent friendship between nodes, we introduce a novel Potential Friend(PF) concept to measure the tenuity of a graph from a new perspective. Experimental results on the real-world and synthetic datasets demonstrate that our proposed method GNNM outperforms existing algorithms in efficiency and subgraph quality.

20 February 2026 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
Linlin ZhuLinlin Zhu
Linlin Zhu
LHLiang He
Liang He
HSHeli Sun
Heli Sun
QZQi Zhang
Qi Zhang
The widespread dissemination and misleading impact of fake news on the web have become a significant concern for the public and the government. Discovering fake news is crucial for ensuring that users receive authentic information and maintaining social harmony. However, most existing entity-based fake news detection methods have two issues: i) methods for acquiring additional information through entities lack flexibility and real-time capabilities. ii) approaches using entities to capture news semantics have not adequately revealed the interactions between words in the text. To address these issues, we propose a Multi-graph Semantic-aware Adaptive Graph Convolutional Network (MgSAN), which comprehensively captures the semantic information of news texts by constructing multiple semantic graphs and learns the features from these graph structures using an adaptive graph convolutional network (SwiGCN). Specifically, we design a global semantic interaction graph to capture the complex interactions between words, generating a comprehensive textual semantic representation. We also employ an entity-noun relationship graph to mine deep semantic associations, enhancing the model’s understanding of fine-grained textual deep meanings. Additionally, we develop an adaptive graph convolutional network to effectively extract and aggregate feature information from different graph structures. Finally, we introduce a fusion module to integrate both global and local fine-grained semantic information, forming a rich composite semantic representation, thereby improving the effectiveness of fake news detection. Extensive experimental results on three public benchmark datasets verify the effectiveness and superior performance of MgSAN, outperforming state-of-the-art detection models.

1 January 2023 in International Journal of New Developments in Education
Verified
Journal Article
Open access
PDF file
Linlin ZhuLinlin Zhu
Linlin Zhu
Extensive research has been conducted on ergative verbs both domestically and internationally. However, there is still ongoing debate concerning the classification and criteria for ergative verbs. This paper subscribes to the notion that unergative verbs are a subset of unaccusative verbs, and aims to contribute to the ongoing debate on their classification and criteria. Additionally, this paper discusses the method of causative-to-unaccusative entailment for identifying ergative verbs based on these criteria.