检索结果-内蒙古大学图书馆

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Yang Yang, Bo Zhao, Xuehua Yang, Zhejian Chen, Hechang Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Aviation University of Air Force Changchun130062 China School of Digital Media Shenzhen Institute of Information Technology Shenzhen518055 China School of Artificial Intelligence Jilin University Changchun130012 China

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, especially when determining the number of clusters in the observed network without any prior knowledge. In view of this, we propose a mathematically principled method for signed network multiple structure discovery named the Signed Stochastic Block Model (SSBM). The SSBM can capture the multiple structures contained in signed networks, e.g., community, bipartite, and coexistence of them, by adopting a probabilistic model. Moreover, by integrating the minimum message length (MML) criterion and component-wise EM (CEM) algorithm, a scalable learning algorithm that has the ability of model selection is proposed to handle large-scale signed networks. By comparing state-of-the-art methods on synthetic and realworld signed networks, extensive experimental results demonstrate the effectiveness and efficiency of SSBM in discovering large-scale exploratory signed networks with multiple structures. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic models

Practical two-party privacy-preserving neural network based on secret sharing

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ge, Zhengqiang Zhou, Zhipeng Guo, Dong Li, Qiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

Neural networks, with the capability to provide efficient predictive models, have been widely used in medical, financial, and other fields, bringing great convenience to our lives. However, the high accuracy of the model requires a large amount of data from multiple parties, raising public concerns about privacy. Privacy-preserving neural network based on multi-party computation is one of the current methods used to provide model training and inference under the premise of solving data privacy. In this study, we propose a new two-party privacy-preserving neural network training and inference framework in which privacy data is distributed to two non-colluding servers. We construct a preprocessing protocol for mask generation, support and realize secret sharing comparison on 2PC, and propose a new method to further reduce the communication rounds. Based on the comparison protocol, we construct building blocks such as division and exponential, and realize the process of training and inference that no longer needs to convert between different types of secret sharings and is entirely based on arithmetic secret sharing. Compared with the previous works, our work obtains higher accuracy, which is very close to that of plaintext training. While the accuracy has been improved, the runtime is reduced, considering the online phase, our work is 5× faster than SecureML, 4.32-5.75× faster than SecureNN, and is very close to the current optimal 3PC implementation, FALCON. For secure inference, as far as known knowledge is concerned, we should be the current optimal 2PC implementation, which is 4-358× faster than other works. © 2021, CC BY.

关键词： Neural networks

Node classification based graph classification with latent sample graph generation and dense graph optimization

学校读者我要写书评

暂无评论

Neurocomputing 2025年 649卷

作者： Huayang Liu Xiaoxin Guo Xuanru Li Longchen Su Chenxi Liu Guangqi Yang Hongliang Dong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Recent studies have shown that the utilization of multi-scale graphs can achieve better results than single-scale graph structures in downstream tasks. However, due to the randomness of generating latent sample graphs from different data partitions, additional tuning costs are usually required for similar generated graphs, which requires more pre-training to adjust the overall model and makes it difficult to guarantee model stability. In this work, a new framework called Node Classification based Graph Classification (NbG) is proposed, which combines the advantage of node classification and graph classification. The NbG can construct latent sample graphs through multi-graph population fusion methods, enabling the exploration of graph structures across different granularity levels. To ensure the validity of the obtained latent sample graph, a novel method called Latent Sample Graph Generation (LSGG) is proposed for graph construction. Finally, a transformer-based graph node classification method is used to perform graph node classification on the obtained latent sample graph. To evaluate the superiority and generalizability of our model in graph classification, the extensive experiments is conducted on seven datasets in the fields of bioinformatics, small molecules, and social networks. The codes are publicly available at https://***/TWoodKayak/NbG .

关键词：

PepLand: A large-scale pre-trained peptide representation model for a comprehensive landscape of both canonical and non-canonical amino acids

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Ruochi Wu, Haoran Xiu, Yuting Li, Kewei Chen, Ningning Wang, Yu Wang, Yan Gao, Xin Zhou, Fengfeng Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China School of Artificial Intelligence Jilin University Changchun130012 China Syneron Technology Guangzhou510700 China College of Computer Science and Technology Jilin University Jilin Changchun130012 China Thuwal23955 Saudi Arabia Thuwal23955 Saudi Arabia

In recent years, the scientific community has become increasingly interested on peptides with non-canonical amino acids due to their superior stability and resistance to proteolytic degradation. These peptides present promising modifications to biological, pharmacological, and physiochemical attributes in both endogenous and engineered peptides. Notwithstanding their considerable advantages, the scientific community exhibits a conspicuous absence of an effective pre-trained model adept at distilling feature representations from such complex peptide sequences. We herein propose PepLand, a novel pre-training architecture for representation and property analysis of peptides spanning both canonical and non-canonical amino acids. In essence, PepLand leverages a comprehensive multi-view heterogeneous graph neural network tailored to unveil the subtle structural representations of peptides. Empirical validations underscore PepLand's effectiveness across an array of peptide property predictions, encompassing protein-protein interactions, permeability, solubility, and synthesizability. The rigorous evaluation confirms PepLand's unparalleled capability in capturing salient synthetic peptide features, thereby laying a robust foundation for transformative advances in peptide-centric research domains. We have made all the source code utilized in this study publicly accessible via GitHub at https://***/zhangruochi/pepland. © 2023, CC BY-NC-ND.

关键词： Peptides

GPFedRec: Graph-Guided Personalization for Federated Recommendation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Chunxu Long, Guodong Zhou, Tianyi Zhang, Zijian Yan, Peng Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia UMIACS University of Maryland Maryland United States College of Computer Science and Technology Jilin University City University of Hong Kong China

The federated recommendation system is an emerging AI service architecture that provides recommendation services in a privacy-preserving manner. Using user-relation graphs to enhance federated recommendations is a promising topic. However, it is still an open challenge to construct the user-relation graph while preserving data locality-based privacy protection in federated settings. Inspired by a simple motivation, similar users share a similar vision (embeddings) to the same item set, this paper proposes a novel Graph-guided Personalization for Federated Recommendation (GPFedRec). The proposed method constructs a user-relation graph from user-specific personalized item embeddings at the server without accessing the users' interaction records. The personalized item embedding is locally fine-tuned on each device, and then a user-relation graph will be constructed by measuring the similarity among client-specific item embeddings. Without accessing users' historical interactions, we embody the data locality-based privacy protection of vanilla federated learning. Furthermore, a graph-guided aggregation mechanism is designed to leverage the user-relation graph and federated optimization framework simultaneously. Extensive experiments on five benchmark datasets demonstrate GPFedRec's superior performance. The in-depth study validates that GPFedRec can generally improve existing federated recommendation methods as a plugin while keeping user privacy safe. Code is available to ease reproducibility. Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

ESAE: Evolutionary Strategy-Based Architecture Evolution 14th

学校读者我要写书评

暂无评论

ESAE: Evolutionary Strategy-Based Architecture Evolution

14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019

作者： Gu, Xue Meng, Ziyao Liang, Yanchun Xu, Dong Huang, Han Han, Xiaosong Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education School of Computer Zhuhai College of Jilin University Zhuhai519041 China Department of Electrical Engineering and Computer Science Informatics Institute and Christopher S. Bond Life Sciences Center University of Missouri ColumbiaMO65211 United States School of Software Engineering South China University of Technology GuangZhou510006 China

ISBN: (纸本)9789811534249

Although deep neural networks (DNNs) play important roles in many fields, the architecture design of DNNs can be challenging due to the difficulty of input data representation, the huge number of parameters and the complex layer relationships. To overcome the obstacles of architecture design, we developed a new method to generate the optimal structure of DNNs, named Evolutionary Strategy-based Architecture Evolution (ESAE), consisting of a bi-level representation and a probability distribution learning approach. The bi-level representation encodes architectures in the gene and parameter levels. The probability distribution learning approach ensures the efficient convergence of the architecture searching process. By using Fashion-MNIST and CIFAR-10, the effectiveness of the proposed ESAS is verified. The evolved DNNs, starting from a trivial initial architecture with one single convolutional layer, achieved the accuracies of 94.48% and 93.49% on Fashion-MNIST and CIFAR-10, respectively, and require remarkably less hardware costs in terms of GPUs and running time, compared with the existing state-of-the-art manual screwed architectures. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Deep neural networks

Evolutionary generative adversarial networks with crossover based knowledge distillation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Junjie Zhang, Junwei Gong, Xiaoyu Lü, Shuai Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Generative Adversarial Networks (GAN) is an adversarial model, and it has been demonstrated to be effective for various generative tasks. However, GAN and its variants also suffer from many training problems, such as mode collapse and gradient vanish. In this paper, we firstly propose a general crossover operator, which can be widely applied to GANs using evolutionary strategies. Then we design an evolutionary GAN framework named C-GAN based on it. And we combine the crossover operator with evolutionary generative adversarial networks (E-GAN) to implement the evolutionary generative adversarial networks with crossover (CE-GAN). Under the premise that a variety of loss functions are used as mutation operators to generate mutation individuals, we evaluate the generated samples and allow the mutation individuals to learn experiences from the output in a knowledge distillation manner, imitating the best output outcome, resulting in better offspring. Then, we greedily select the best offspring as parents for subsequent training using discriminator as an evaluator. Experiments on real datasets demonstrate the effectiveness of CE-GAN and show that our method is competitive in terms of generated images quality and time efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

Resource Scheduling for UAVs-aided D2D Networks: A Multi-objective Optimization Approach

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Pan, Hongyang Liu, Yanheng Sun, Geng Wang, Pengfei Yuen, Chau College of Computer Science and Technology Jilin University Changchun130012 China Pillar Singapore University of Technology and Design Singapore487372 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Computer Science and Technology Dalian University of Technology Dalian116024 China School of Electrical and Electronics Engineering Nanyang Technological University Singapore639798 Singapore

Unmanned aerial vehicles (UAVs)-aided device-to-device (D2D) networks have attracted great interests with the development of 5G/6G communications, while there are several challenges about resource scheduling in UAVs-aided D2D networks. In this work, we formulate a UAVs-aided D2D network resource scheduling optimization problem (NetResSOP) to comprehensively consider the number of deployed UAVs, UAV positions, UAV transmission powers, UAV flight velocities, communication channels, and UAV-device pair assignment so as to maximize the D2D network capacity, minimize the number of deployed UAVs, and minimize the average energy consumption over all UAVs simultaneously. The formulated NetResSOP is a mixed-integer programming problem (MIPP) and an NP-hard problem, which means that it is difficult to be solved in polynomial time. Moreover, there are trade-offs between the optimization objectives, and hence it is also difficult to find an optimal solution that can simultaneously make all objectives be optimal. Thus, we propose a non-dominated sorting genetic algorithm-III with a Flexible solution dimension mechanism, a Discrete part generation mechanism, and a UAV number adjustment mechanism (NSGA-III-FDU) for solving the problem comprehensively. Simulation results demonstrate the effectiveness and the stability of the proposed NSGA-III-FDU under different scales and settings of the D2D networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Energy utilization

Wide aspect ratio matching for robust face detection

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Luo, Shi Li, Xiongfei Zhang, Xiaoli Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Recently, anchor-based methods have achieved great progress in face detection. Once anchor design and anchor matching strategy determined, plenty of positive anchors will be sampled. However, faces with extreme aspect ratio always fail to be sampled according to standard anchor matching strategy. In fact, the max IoUs between anchors and extreme aspect ratio faces are still lower than fixed sampling threshold. In this paper, we firstly explore the factors that affect the max IoU of each face in theory. Then, anchor matching simulation is performed to evaluate the sampling range of face aspect ratio. Besides, we propose a Wide Aspect Ratio Matching (WARM) strategy to collect more representative positive anchors from ground-truth faces across a wide range of aspect ratio. Finally, we present a novel feature enhancement module, named Receptive Field Diversity (RFD) module, to provide diverse receptive field corresponding to different aspect ratios. Extensive experiments show that our method can help detectors better capture extreme aspect ratio faces and achieve promising detection performance on challenging face detection benchmarks, including WIDER FACE and FDDB datasets. © 2021, CC BY.

关键词： Aspect ratio