Loading...

Table of Content

      
    20 December 2023
    Volume 58 Issue 12
    Embedded generation of micro-information and its intelligent hiding-restoration
    Shuzhen CHEN,Kaiquan SHI,Shouwei LI
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  1-9.  doi:10.6040/j.issn.1671-9352.0.2023.160
    Abstract ( 354 )   HTML ( 10 )   PDF (879KB) ( 327 )   Save
    References | Related Articles | Metrics

    Based on the P-set model with dynamic properties and attribute ensemble-fetching properties, the embedding generation and hiding of $\alpha^{F}$-micro-information, $\alpha^{\bar{F}}$-micro-information and ($\alpha^{F}$, $\alpha^{\bar{F}}$)-micro-information are given. Using these concepts, the micro-information system and its structure, and the intelligent hiding of micro-information and its restoration-acquisition are given, and finally the applications of these concepts are introduced.

    A memory network model based on semantic expansion of text for query suggestion
    Naizhou ZHANG,Wei CAO
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  10-21.  doi:10.6040/j.issn.1671-9352.2.2022.484
    Abstract ( 285 )   HTML ( 1 )   PDF (4344KB) ( 365 )   Save
    Figures and Tables | References | Related Articles | Metrics

    A novel memory network model based on the semantic expansion of text is proposed to generate context-aware query suggestions. An attention-based hierarchical encoder-decoder model is employed, utilizing an external memory network to generate the neural attention vector between the query and the related document. The model fuses query-layer, session-layer, and document-layer semantic information. Compared with state-of-the-art approaches, our model can generate context-aware query suggestions with higher relevance. Extensive experiments using real commercial search engine query logs demonstrate the effectiveness of the proposed model.

    Label guided multi-scale graph neural network for protein-protein interactions prediction
    Xinsheng WANG,Xiaofei ZHU,Chenghong LI
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  22-30.  doi:10.6040/j.issn.1671-9352.1.2022.8766
    Abstract ( 251 )   HTML ( 3 )   PDF (2804KB) ( 285 )   Save
    Figures and Tables | References | Related Articles | Metrics

    A protein-protein interactions prediction method based on label guided multi-scale graph neural network is proposed, which not only enhances the representation ability of data, but also introduces label information to guide learning. Firstly, the multi-scale graph representation is obtained by graph data augmentation, and the multi-scale graph representation is input into graph neural network to obtain multi-scale protein representation, and comparative learning is introduced to further improve the protein characterization ability. Secondly, the self-learning label relation graph is constructed to learn the relationship between labels and obtain the feature representation of labels. Finally, the prediction of protein-protein interactions is guided by the feature representation of labels. Experiments are carried out on three public datasets. Compared with the optimal benchmark method, the proposed method has better performance. Specifically, compared with the best baseline method, the micro-F1 scores on the three datasets SHS27k, SHS148k and STRING increase by 2.01%, 0.94% and 0.93% respectively.

    Multimodal sentiment analysis based on text-guided hierarchical adaptive fusion
    Chan LU,Junjun GUO,Kaiwen TAN,Yan XIANG,Zhengtao YU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  31-40, 51.  doi:10.6040/j.issn.1671-9352.1.2022.421
    Abstract ( 442 )   HTML ( 11 )   PDF (1947KB) ( 355 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The paper proposes a multi-modal hierarchical fusion method based on text modal guidance, which uses text modal information as the guidance to achieve hierarchical adaptive screening and fusion of multi-modal information. Firstly, the importance information representation between two modalities is realized based on the cross-modal attention mechanism, then the hierarchical adaptive fusion based on the multimodal important information is realized through the multimodal adaptive gating mechanism, and finally the multimodal features are synthesized. and modal importance information to implement multimodal sentiment analysis. The experimental results on the public datasets MOSI and MOSEI show that the accuracy and F1 value of the baseline model have increased by 0.76% and 0.7%, respectively.

    Three-way over-sampling method for imbalanced data classification
    Yu FANG,Huyu ZHENG,Xuemei CAO
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  41-51.  doi:10.6040/j.issn.1671-9352.4.2022.3492
    Abstract ( 300 )   HTML ( 2 )   PDF (5938KB) ( 306 )   Save
    Figures and Tables | References | Related Articles | Metrics

    This paper proposes a new sampling method combined with three-way decisions and SMOTE, referred to as three-way over-sampling (3WOS). 3WOS constructs the three-way decisions model for all samples and select the samples in the model boundary domain as key samples for SMOTE oversampling. Consequently, the problem of sample aggregation and separation is alleviated effectively. Moreover, the performance of the classifier is improved to a certain extent. Firstly, the method divides all samples into three parts according to the three-way decisions and support vector data description. Secondly, finding the k nearest neighbors of minority class for all key sample and using linear interpolation to synthesize new samples for each key sample to generate the new minority samples. Finally, the updated sample set is used to train the classifier. Experimental results show that the 3WOS method has better performance in classification accuracy, F-measure, G-mean and less cost on the base classifiers than other methods.

    Recovery set of three-way concept
    Yaoqi CHEN,Weihua XU,Zongying JIANG
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  52-62.  doi:10.6040/j.issn.1671-9352.4.2022.7343
    Abstract ( 271 )   HTML ( 2 )   PDF (2834KB) ( 210 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The theory of three-way formal concept analysis is introduced into the field of data recovery in this paper. By defining the recovery set and recovery degree of three-way concept, it explores the hidden information from three-way concepts, and proposes an effective formal context recovery algorithm. Additionally, to solve the three-way concept recovery set problem, the constraints of three-way concept are considered on formal context binary relations, and a conjunctive normal form simplification algorithm is designed for the recovery set (CNFS). Furthermore, a dynamic update algorithm is provided for the recovery set to adapt to the continuous changes of the formal context. Finally, some numerical experiments on public datasets from the UCI perform the effectiveness of our proposed method. Experimental results indicate that the proposed algorithm has high accuracy and effectiveness in formal context recovery, and also verifies that different concepts have different important degrees in cognition.

    Practical application of property-oriented concepts in adaptive assessment of skills
    Qiuhong HE,Jinjin LI,Yinfeng ZHOU,Jing WU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  63-76.  doi:10.6040/j.issn.1671-9352.4.2022.5723
    Abstract ( 272 )   HTML ( 1 )   PDF (1331KB) ( 421 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Certain concepts (X, B) can be obtained via the combination of skill multimaps with property-oriented concepts, which leads to a method for constructing knowledge and skill structures that can be applied to the adaptive assessment of skills. The processis as follows. First, expert teachers provide the question set Q, skill set S, and their corresponding skill multimaps (Q, S; μ). Next, the knowledge and skill structures are obtained from the extension and the intention of (X, B). Thereafter the knowledge structure is used to conduct the adaptive assessment of the sample, and the proportion of their knowledge states is calculated. Subsequently, the equal proportion selection rule of knowledge space theory "binary responses" is optimized to the sample proportion selection rule, facilitate faster assessment effects for examinees in different regions and age groups. Finally, the figure of learning paths for skill sets is drawn.

    A q-rung orthopair fuzzy set based conflict analysis model
    Tiantai LIN,Bin YANG
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  77-90.  doi:10.6040/j.issn.1671-9352.4.2022.9449
    Abstract ( 260 )   HTML ( 1 )   PDF (986KB) ( 419 )   Save
    Figures and Tables | References | Related Articles | Metrics

    We propose a q-rung orthopair fuzzy set based conflict analysis model, employ q-rung orthopair fuzzy numbers to denote the attitudes of agents toward issues. In addition, comprehensive alliance distance is used to measure the alliance degree of agents on the issues, and the conflicting reasons are obtained based on an analysis of the three alliance levels of agents and issues. Furthermore, the classification ability evaluation of a feasible strategy set is given based on fuzzy rough self-information, and a backward algorithm for finding the best feasible strategy is constructed. We consider the three alliance levels of the agents as the classification information required by fuzzy rough self-information. Further, the upper and lower approximations of the alliance levels can be defined, so as to obtain the classification ability evaluation of the feasible strategy set. Finally, the feasibility of the model and algorithm proposed in this paper is demonstrated through an example of Middle East conflict, and analyze the influence of changing value of thresholds on the optimal feasible strategy.

    Conflict analyses and deciosion analyses based on probabilistic multi-valued information systems
    Lei JIN,Tao FENG,Shaopu ZHANG
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  91-107.  doi:10.6040/j.issn.1671-9352.4.2022.7001
    Abstract ( 264 )   HTML ( 2 )   PDF (1739KB) ( 57 )   Save
    Figures and Tables | References | Related Articles | Metrics

    A probabilistic multi-valued information system is proposed by adding a probability measure to the multi-valued information system. In addition, in a probabilistic multi-valued information system, the degree of conflict between agents is defined by Bregman divergence, and the alliance class, neutral class and conflict class of each agent are obtained. Finally, a method for obtaining feasible decision sets in probabilistic multi-valued information systems is proposed based on the mean value and standard deviation of the evaluation results.

    Prime hesitant fuzzy filters in fuzzy implication algebras and its spectral spaces
    Chunhui LIU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  108-117.  doi:10.6040/j.issn.1671-9352.0.2022.343
    Abstract ( 294 )   HTML ( 4 )   PDF (880KB) ( 307 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In this paper, filters problem of fuzzy implication algebras is further studied by using the method and principle of hesitant fuzzy sets and topology. Firstly, the notion of prime hesitant fuzzy filter in fuzzy implication algebras is introduced and its properties are investigated. The prime hesitant fuzzy filter theorem is established and proved of upper semilattice fuzzy implication algebras. Secondly, a topology τ is constructed on the set PHFil (X) consisting of all prime hesitant fuzzy filters in a given fuzzy implication algebra (X, →, 0), a base is obtained of the topology τ and it is proved that the topological space (PHFil(X), τ) is a T0 space.

     
    Cluster analysis based on the hesitation triangle fuzzy correlation coefficient
    Hui MA,Lili WEI
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  118-126.  doi:10.6040/j.issn.1671-9352.4.2022.6483
    Abstract ( 317 )   HTML ( 3 )   PDF (845KB) ( 341 )   Save
    Figures and Tables | References | Related Articles | Metrics

    A clustering algorithm based on the hesitation triangle fuzzy correlation coefficient is proposed to solve the clustering problem of hesitating triangle fuzzy elements. Firstly, the definition and calculation formula of the hesitation triangle fuzzy correlation coefficient of are given. Secondly, considering the influence of the weight of the hesitancy triangle fuzzy element, the hesitation triangle fuzzy correlation coefficient is extended to the hesitation triangle fuzzy weighted correlation coefficient. Finally, the proposed method is applied to the clustering problem in a hesitant fuzzy environment, and the feasibility of the proposed method is demonstrated by an example.

    Burning connectivity of oriented graphs
    Longmiao XIA,Zongtian WEI,Liping DING
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  127-133.  doi:10.6040/j.issn.1671-9352.0.2022.324
    Abstract ( 328 )   HTML ( 2 )   PDF (1109KB) ( 236 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The burning number of the graph is combined with the connectivity to propose the concept of burning connectivity of the oriented graphs. Based on the burning connectivity of some special oriented graphs (such as oriented graphs of trees, circles, wheel, etc.), and upper bounds of burning connectivity of cyclic oriented graphs, oriented graphs with a given diameter. An algorithm for computing the burning connectivity of the general oriented graphs is designed, and the complexity of the algorithm is analyzed.

    Adjacent vertex distinguishing edge coloring of IC-planar graphs without intersecting triangles
    Jin LI,Changqing XU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  134-139.  doi:10.6040/j.issn.1671-9352.0.2022.276
    Abstract ( 272 )   HTML ( 1 )   PDF (798KB) ( 233 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Let φ be an l-proper edge coloring of graph G and Cφ(u) be the color set of all edges incident with vertex u of G. An l-adjacent vertex distinguishing edge coloring of a graph G is the coloring φ such that Cφ(u) and Cφ(v) are distinct for any edge uv of G, denoted by an l-avd coloring. The minimum positive integer l for an l-avd coloring of G is the adjacent vertex distinguishing edge chromatic number, denoted by χa(G). In this paper, we study the adjacent vertex distinguishing edge coloring of an IC-normal planar graph G without intersecting triangles by using the discharging method and get that χa(G)≤max{Δ(G)+2, 12}.

    Domination entropy based on graph operations
    Ying JI,Bo DENG,Haixing ZHAO,Yanlong TANG
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  140-150.  doi:10.6040/j.issn.1671-9352.0.2022.434
    Abstract ( 243 )   HTML ( 1 )   PDF (871KB) ( 357 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Graph invariants are widely used to construct entropy-based metrics to characterize the structure of complex networks. In particular, graph entropy based on dominating sets is often applied to characterize the amount of information in communication systems and the stability of computer networks. Graph entropy calculations are studied based on dominating sets under the four operations of graphs. That is the operations of the disjoint union, joining, corona product, and Cartesian product using the complete graph, star graph, comb graph, and friendship graph.

    Characterizing properties of (signless) Laplacian permanental polynomials of bicyclic graphs
    Tingzeng WU,Tian ZHOU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  151-160.  doi:10.6040/j.issn.1671-9352.0.2022.316
    Abstract ( 260 )   HTML ( 0 )   PDF (904KB) ( 363 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Let G be a graph with n vertices, and let L(G) and Q(G) be the Laplacian matrix and signless Laplacian matrix of G, respectively. The polynomial π(L(G); x)=per(xI-L(G)) (resp. π(Q(G); x)=per(xI-Q(G))) is called Laplacian permanental polynomial (resp. signless Laplacian permanental polynomial) of G. In this paper, we show that two classes of bicyclic graphs are determined by their (signless) Laplacian permanental polynomials.

    Quantum synchronizable codes from generalized cyclotomy of order two over Z2pm
    Shiwen SUN,Danyang MOU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  161-166.  doi:10.6040/j.issn.1671-9352.0.2022.351
    Abstract ( 277 )   HTML ( 2 )   PDF (793KB) ( 169 )   Save
    Figures and Tables | References | Related Articles | Metrics

    A new family of quantum synchronizable codes from generalized cyclotomy of order two over Z2pm are constructed whose synchronization capabilities always reach the upper bound 2pm. In addition, this kind of codes also have ability to correct bit errors and phase errors caused by quantum noise. Finally, some quantum synchronizable codes with optimal capabilities of block synchronization are presented.

    Fixed-time consensus control for high-order multi-agent systems with input delay
    Jinpeng QIU,Zonggang LI,Yinjuan CHEN,Yajiang DU
    JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE). 2023, 58(12):  167-176.  doi:10.6040/j.issn.1671-9352.0.2022.310
    Abstract ( 340 )   HTML ( 7 )   PDF (2940KB) ( 149 )   Save
    Figures and Tables | References | Related Articles | Metrics

    To study the fixed-time consensus control problem of multi-agent system under the influence of input delay and external interference, a leader-following consensus control method based on Pade approximate consensus error is proposed. Firstly, a distributed observer is designed for followers to obtain leader's state information. Secondly, by using the Pade approximation method and introducing the delay dummy variable, the delay consensus error is transformed into the delay-free consensus error, and the distributed dynamic control protocol is designed based on the dynamic gain control method. By using the fixed-time stability theory, the sufficient conditions for the system to achieve fixed-time consensus and the upper bound of convergence time are obtained. Finally, the correctness of the theoretical results is verified by simulation experiments.