Loading...

Table of Content

      
    20 July 2025
    Volume 60 Issue 7
    EEG-MFNet: a lightweight multi-branch fusion network for electroencephalogram signal analysis
    YE Xiaoya, WANG Xiuqing, MA Haibin, ZHANG Nuofei
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  1-12.  doi:10.6040/j.issn.1671-9352.4.2024.126
    Abstract ( 42 )   PDF (5101KB) ( 63 )   Save
    References | Related Articles | Metrics
    In order to solve the problems of decoding efficiency caused by low resolution, insufficient data volume and individual differences of subjects, multi-branch fusion network for electroencephalogram signal(EEG-MFNet)model suitable for EEG signal analysis is proposed. Multi-level spatiotemporal features of EEG data are extracted through multi-scale spatiotemporal convolutional modules, and further applied by multi-scale temporal convolution to extract more advanced time-space-frequency domain features. Applying a sliding window to the feature data of the input classifier significantly enhances the effective features of the data. The average classification accuracy and standard deviation of the EEG-MFNet model are improved by more than 3.19% and 22.86% compared with the comparison model, respectively. Model inference time is reduced by more than 16.87%. The experimental results show that the proposed method improves the stability of the model and significantly improves the training efficiency. This work provides a more efficient decoding scheme for EEG signal analysis based on motor imagery.
    Method for glioma gene status prediction based on deep truth discovery
    ZHAO Yulin, LIANG Fengning, ZHAO Teng, CAO Yaru, WANG Lin, ZHU Hong
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  13-21.  doi:10.6040/j.issn.1671-9352.0.2023.550
    Abstract ( 34 )   PDF (2368KB) ( 24 )   Save
    References | Related Articles | Metrics
    Aiming at the problems of incomplete deep network feature extraction and inherent uncertainty of the model in the current deep learning model for the prediction of glioma isocitrate dehydrogenase 1(IDH1)gene status based on Magnetic Resonance Imaging(MRI), the truth discovery divided attention-ResNet(TDA-ResNet)model are proposed based on improved residual network(ResNet)with truth discovery. Firstly, the ResNet network model architecture is optimized by the divided attention mechanism to extract local and global features of glioma images to predict the IDH1 gene status of glioma; meanwhile, the truth discovery algorithm is incorporated into the model to calibrate the uncertainty of the depth feature vectors as the prediction results, so as to improve the prediction accuracy of the model. The experimental data were collected from the MR images of some glioma patients in the Affiliated Hospital of Xuzhou Medical University and the public dataset of the cancer imaging archive(TCIA). The experimental accuracies of the TDA-ResNet model in the MR image dataset of glioma in the Affiliated Hospital of Xuzhou Medical University and the TCIA dataset were 95.73% and 94.3%. The experimental results show that the TDA-ResNet model can achieve non-invasive prediction and uncertainty calibration of IDH1 gene status of glioma, and its performance is better than the existing deep learning prediction model of IDH1 gene status, which is of great significance for the clinical diagnosis and treatment of glioma.
    A dual branch retinal vessel segmentation network based on guided filtering and Transformer
    YAN Bencong, WANG Yingmei
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  22-31.  doi:10.6040/j.issn.1671-9352.0.2024.062
    Abstract ( 29 )   PDF (11904KB) ( 18 )   Save
    References | Related Articles | Metrics
    Based on the Transformer structure and the UNet++ network,a new dual branch retinal vessel segmentation network is proposed. The dual branch encoder in the network can better correlate global information in the image, so that the proposed network performs well on small datasets. Furthermore, in order to solve the problem of retinal vessel information loss caused by downsampling operations in UNet, guided filtering is introduced in the feature maps of the output layer and the second layer, which effectively improves the accuracy of small vessel segmentation. The effectiveness of the network is validated by experiments on the DRIVE(digital retinal images for vessel extraction)dataset and the CHASEDB1(combined healthy and diabetic retinopathy database 1)dataset, which shows significant improvements in accuracy, sensitivity, and other parameters. In addition, more small blood vessels are visually segmented with better accuracy. All results demonstrate that the proposed method has better performance.
    Left ventricular MRI segmentation based on nonzero level sets convexity preserving algorithm
    LI Ji, LIU Aiwen, QIN Liu
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  32-47.  doi:10.6040/j.issn.1671-9352.0.2024.063
    Abstract ( 24 )   PDF (21341KB) ( 18 )   Save
    References | Related Articles | Metrics
    Accurate segmentation of the left ventricle in clinical applications requires maintaining a convex shape that encompasses the left ventricle cavity, trabeculae, and papillary muscles. The nonzero level set convexity preserving model, a novel cardiac magnetic resonance imaging segmentation model incorporating an enhanced distance regularization term and a nonzero level set convexity preserving term is introduced. By leveraging the curvature of the level set contour, the model effectively promotes convexity, ensuring the contour evolves into a convex shape. Evaluated on the ACDC MICCAI 2017 datasets, the model achieved a mean Dice coefficient of 0.961 and 0.936 in end-diastole and end-systole phases, respectively, alongside a mean Hausdorff distance of 4.89 and 5.79. Notably, the model eliminates the need for manual annotation of training data and time-consuming learning processes, while achieving segmentation accuracy and robustness comparable to deep learning-based left ventricle segmentation models.
    Regional risk assessment on the prevention and control of emerging infectious diseases
    LIU Yong, WANG Xiao, YANG Shushu
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  48-55.  doi:10.6040/j.issn.1671-9352.0.2023.293
    Abstract ( 24 )   PDF (1087KB) ( 21 )   Save
    References | Related Articles | Metrics
    Using graph theory knowledge, the social groups network structure is defined in this text. A tree-shaped risk transmission network for the newly discovered epidemic site is constructed. Combining a risk assessment model, the epidemic site is divided into three risk levels: high, medium, and low. The rationality of the classification method is verified through data simulation. The results indicate that the constructed tree-structured regional risk propagation network can effectively depict the epidemic transmission within the social network of newly affected areas. By determining the correlation functions among regional nodes and constructing a risk classification model based on node risk values, the occurrence of epidemics in surrounding areas can be scientifically characterized. This model facilitates the proactive, precise, and systematic basis for epidemic prevention and control efforts.
    A network concept incorporated adjacency relationships between objects and its recommendation application
    LI Xiaolan, LIU Zhonghui, MIN Fan
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  56-68.  doi:10.6040/j.issn.1671-9352.4.2024.210
    Abstract ( 33 )   PDF (1552KB) ( 17 )   Save
    References | Related Articles | Metrics
    The traditional concepts only include the relationship between objects and attributes, while the adjacency relationships between objects are ingored, resulting in poor recommendation performance. To solve this problem, the adjacency network concept based on the network formal context is proposed, and a method for constructing an AN concept set is designed, along with a recommendation algorithm based on this set. The AN concept is consisted of extent objects, adjacency intent and intent attributes. The adjacency intent is formed by adjacent nodes of extent objects. A heuristic construction algorithm is proposed, which utilizes the concept volume as heuristic information to construct the AN concept set. Different strategies are adopted to make the pre-recommendation for extent objects and adjacency intent objects. The final recommendation result is determined by the recommendation frequency threshold. The algorithm is verified on eleven real datasets. It is compared with the classical collaborative filtering algorithms and recommendation algorithms based on the formal concepts. The results show that our algorithm has better recommendation effect.
    Multi-label feature selection with label manifold and dynamic graph constraints
    WU Xiaojun, CHEN Yidan, HAO Yaojun, SONG Changwei, HE Deqing
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  69-83.  doi:10.6040/j.issn.1671-9352.7.2024.452
    Abstract ( 24 )   PDF (12188KB) ( 31 )   Save
    References | Related Articles | Metrics
    Multi-label feature selection algorithms with label manifolds and dynamic graph constraints are proposed by integrating adaptive dynamic graph technique and label manifold into an improved linear mapping learning framework. In this algorithm, an improved matrix decomposition technique based on feature self-representation improves the linear mapping model and decouples the correlation between features and labels as well as between different labels. An adaptive dynamic graph technique with Laplace rank constraints is designed to learn a high-quality feature similarity graph. A label manifold based on label relevance is constructed to fully incorporate label information into the training of the algorithm. Numerous experimental results verify that the adaptive dynamic graph technique can effectively improve the quality of the graph matrix and the effectiveness of the proposed algorithm in addressing the multi-label feature selection problem.
    Hierarchical graph representation learning based on graphical mutual information pooling
    WU Xinyao, XU Ji
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  84-93.  doi:10.6040/j.issn.1671-9352.4.2024.839
    Abstract ( 17 )   PDF (3232KB) ( 21 )   Save
    References | Related Articles | Metrics
    A graph pooling operator called graphical mutual information pooling(GMIPool). GMIPool is proposed utilizes mutual information neural estimation to measure the mutual information between nodes and their corresponding subgraphs, including both feature mutual information and structural mutual information. It leverages this information to identify and retain key nodes in the graph, constructing a more compact coarsened graph. To ensure structural consistency between the original and coarsened graphs, the method adjusts the coarsened graphs structure using the neighborhood correlations between nodes. Experiments on several node classification task datasets validate the effectiveness of GMIPool.
    Knowledge graph representation learning based on neighborhood granularity and three-way decision
    QIAN Wenbin, PENG Jiahao, CAI Xingxing
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  94-103.  doi:10.6040/j.issn.1671-9352.4.2024.534
    Abstract ( 35 )   PDF (2754KB) ( 18 )   Save
    References | Related Articles | Metrics
    A knowledge representation learning method based on neighborhood granularity and three-way decision theory(NGTwD)is proposed. The method is implemented using a two-stage enhancement algorithm framework. In the first stage, knowledge representation learning is utilized to fit the nodes and relations in the knowledge graph, and map the embedded semantic information into a low-dimensional vector space. To better capture and exploit the latent similarities in the semantic information, the neighborhood granularity of the low-dimensional vector representations is divided in the second stage. This process is further complemented by applying three-way decision theory to precisely segment the similar semantic information. The extracted latent information is then used to retrain the model, thereby improving the accuracy and robustness of the knowledge representation learning method. Five classic knowledge representation learning models are selected, and experiments are conducted on four large publicly available knowledge graph datasets. The effectiveness of the proposed method is validated through the experimental results.
    Multi-granularity support vector regression algorithm based on granular ball computing
    HUA Youlin, SHAO Yabin, ZHU Xueqin
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  104-115.  doi:10.6040/j.issn.1671-9352.8.2024.024
    Abstract ( 28 )   PDF (4811KB) ( 33 )   Save
    References | Related Articles | Metrics
    To achieve both efficiency and robustness in the support vector regression algorithm, multi-granularity granular ball computing is integrated into the support vector regression algorithm. A multi-granularity granular ball support vector regression algorithm is proposed based on granular ball computing. The radius information from granular balls is incorporated into the models constraint conditions, replacing the traditional sample point based support vector regression algorithm with a granular ball based support vector regression algorithm. Additionally, the dual model of the multi-granularity granular ball support vector regression is investigated, and a particle swarm optimization algorithm is utilized to solve it. Experimental results show that on both artificial datasets and University of California-Irvine(UCI)publicly available datasets, computational efficiency and robustness are improved by the multi-granularity granular ball support vector regression.
    Method for constructing knowledge structures and finding learning paths based on FT-rough set
    ZHOU Miaojuan, HUANG Hanliang, ZHANG Jiping, LI Jinjin
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  116-130.  doi:10.6040/j.issn.1671-9352.7.2024.122
    Abstract ( 34 )   PDF (1265KB) ( 12 )   Save
    References | Related Articles | Metrics
    The method of constructing knowledge structures under FT-rough set is proposed, and how to evaluate learners skills and select learning paths is discussed. In fuzzy approximation space, knowledge structures are constructed using the upper and lower inverse models of FT-rough set, and their properties are studied. The mastery of learners skills is evaluated under the condition that their knowledge state is known, and learning paths diagram and its algorithm are provided. The effectiveness and feasibilities of the proposed algorithm are verified by teaching examples.
    Novel multi-granularity variable precision(*,·)-fuzzy rough set
    LI Xinru, LI Lingqiang, JIA Chengzhao
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2025, 60(7):  131-142.  doi:10.6040/j.issn.1671-9352.0.2024.187
    Abstract ( 23 )   PDF (475KB) ( 6 )   Save
    References | Related Articles | Metrics
    A novel variable precision(*,·)-fuzzy rough set is introduced. Combined with the idea of multi-granularity, a multi-granularity variable precision(*,·)-fuzzy rough set is further proposed, which includes three basic models, optimism, pessimism and compromise. The algebraic and topological properties of the model are investigated, and it is proved that the model satisfies the properties of inclusion, idempotency and duality, and can induce fuzzy topology and fuzzy cotopology structure.