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

Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems

Journal of Bionic engineering 2008年第2期5卷 111-119页

作者： Jin-hui Yang Liang Sun Heow Pueh Lee Yun Qian Yan-chun Liang College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012 P. R. China Institute of High Performance Computing Singapore 117528 Singapore Department of Mechanical Engineering National University of Singapore Singapore 117576 Singapore Institute of Electric and Information Engineering Beihua University Jilin 13202 l P. R. China

A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki＇s neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.

关键词： job shop scheduling problem clonal selection algorithm simulated annealing global search local search

来源：评论

学校读者我要写书评

暂无评论

Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training

引用

ACM Transactions on knowledge Discovery from Data 2024年第9期18卷 1-30页

作者： Liu, Yonghao Li, Mengyu Li, Ximing Huang, Lan Giunchiglia, Fausto Liang, Yanchun Feng, Xiaoyue Guan, Renchu Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China University of Trento Trento Italy Zhuhai Lab. of the Key Lab. of Symbolic Computation and Knowledge Eng. of the Ministry of Education Zhuhai College of Science and Technology Zhuhai China

Node classification is an essential problem in graph learning. However, many models typically obtain unsatisfactory performance when applied to few-shot scenarios. Some studies have attempted to combine meta-learning with graph neural networks to solve few-shot node classification on graphs. Despite their promising performance, some limitations remain. First, they employ the node encoding mechanism of homophilic graphs to learn node embeddings, even in heterophilic graphs. Second, existing models based on meta-learning ignore the interference of randomness in the learning process. Third, they are trained using only limited labeled nodes within the specific task, without explicitly utilizing numerous unlabeled nodes. Finally, they treat almost all sampled tasks equally without customizing them for their uniqueness. To address these issues, we propose a novel framework for few-shot node classification called Meta-GPS. Specifically, we first adopt an efficient method to learn discriminative node representations on homophilic and heterophilic graphs. Then, we leverage a prototype-based approach to initialize parameters and contrastive learning for regularizing the distribution of node embeddings. Moreover, we apply self-Training to extract valuable information from unlabeled nodes. Additionally, we adopt S (scaling and shifting) transformation to learn transferable knowledge from diverse tasks. The results on real-world datasets show the superiority of Meta-GPS. Our code is available here. © 2024 Copyright held by the owner/author(s).

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Boosting few-shot point cloud segmentation with intra-class correlation and iterative prototype fusion

引用

Computer Vision and Image Understanding 2025年 258卷

作者： Zhang, Xindan Li, Ying Zhang, Xinnian College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China of Information and Communication Technology Ajou University South Korea

Semantic segmentation of 3D point clouds is often limited by the challenge of obtaining labeled data. Few-shot point cloud segmentation methods, which can learn previously unseen categories, help reduce reliance on labeled datasets. However, existing methods are susceptible to correlation noise and suffer from significant discrepancies between support prototypes and query features. To address these issues, we first introduce an intra-class correlation enhancement module for filtering correlation noise driven by inter-class similarity and intra-class diversity. Second, to better represent the target classes, we propose an iterative prototype fusion module that adapts the query point cloud feature space, mitigating the problem of object variations in the support set and query set. Extensive experiments on S3DIS and ScanNet benchmark datasets demonstrate that our approach achieves competitive performance with state-of-the-art methods. © 2025 Elsevier Inc.

关键词： 3D semantic segmentation Few-shot learning

来源：评论

学校读者我要写书评

暂无评论

An effective dimensionality reduction method for text classification based on TFP-tree

An effective dimensionality reduction method for text classi...

引用

作者： Liu, Lu College of Software Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun China College of Computer Science and Technology Jilin University Changchun China

Obtaining interesting and topic-relevant information is a very important task in Web mining. Text classification using a small proportion of labeled data and a large proportion of unlabeled data, also called semi-supervised learning, is a well-known problem. Despite plenty of research on text classification, however, how to effectively and efficiently apply valuable frequent patterns and deal with high-dimensional data in text classification is still an open issue. Due to the increasing data volumes and plenty of high-dimensional data, both distance measures and time complexity could be influenced by the noisy data. This paper targets on this problem and presents a novel method for text classification called CTFP (Classification based on TFP-tree), which uses TFP-tree (Text-Frequent-Pattern-tree) to generate frequent patterns in tremendous amount of texts and conduct text classification in a relatively low dimensional data space. It effectively reduces the data dimensionality during constructing the classifier. Substantial experiments on three datasets (RCV1, SRAA and Reuters-21578) show that our proposed method can achieve better performance than many existing state-of-the-art methods on precision, efficiency and many other evaluation metrics. © 2018 - IOS Press and the authors. All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Multiparticipant Federated Feature Selection Algorithm With Particle Swarm Optimization for Imbalanced Data Under Privacy Protection

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第5期4卷 1002-1016页

作者： Hu, Ying Zhang, Yong Gong, Dunwei Sun, Xiaoyan China University of Mining and Technology School of Information and Control Engineering Xuzhou221008 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China

In the real world, data describing the same learning task may be distributed in different institutions (called participants), and these participants cannot share their own data due to the need of privacy protection. How to select an optimal feature subset on the basis of ensuring the data privacy of each participant is an important and challenging topic. At the same time, data on part participants show imbalanced or even miss some classes, further increasing the difficulty of solving this kind of problem. In view of this, by introducing a trusted third party to process and integrate optimal information from participants, this article proposes a multiparticipant federated evolutionary feature selection algorithm for imbalanced data under privacy protection. First, a multilevel joint sample filling strategy with multiple participants (called sampling-rough selection-fine tuning strategy) is proposed to fill imbalanced or empty classes on each participant while ensuring data privacy. Then, a federated evolutionary feature selection method based on particle swarm optimization (PSO) is proposed by periodically sharing the optimal feature subsets obtained by PSOs on participants. Finally, the proposed algorithm is applied to 15 test datasets, and compared with several typical imbalanced feature selection algorithms and two kinds of ensemble feature selection algorithms. The experimental results show that the proposed algorithm can significantly promote the ability of each participant on processing imbalanced datasets, and improve the classification accuracy of obtained feature subsets while protecting the participants' data privacy. © 2020 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm with local search for advanced planning and scheduling

Genetic algorithm with local search for advanced planning an...

引用

3rd International Conference on Natural computation, ICNC 2007

作者： Pu, Yan Dayou, Liu Donghui, Yuan Ji, Yu Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)0769528759

In this paper, a genetic algorithm approach with a novel mutation operator based on perturbation and local search has been proposed to solve an advanced planning and scheduling (APS) model in manufacturing supply chain, in which each customer order has a due date, each operation could be performed on alternative machines. The objective is to minimize the makespan of each customer order while ensuring the due date constraints. Various sizes of numerical experiments were carried out to demonstrate the efficiency of the proposed GA and the results indicate that the presented algorithm performs much better than previous work especially in large size problems. © 2007 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Complex knowledge system modeling based on Hierarchical Fuzzy Petri Net

Complex knowledge system modeling based on Hierarchical Fuzz...

引用

2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007

作者： Hongjun, Pan Jigui, Sun Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0769530281

The difficulties of modeling complex knowledge system lie in a large quantity of knowledge rules and the difficulty in organizing rules and grasping their mutual logical relationships. This article proposed a concept of hierarchical fuzzy Petri nets (HFPN), which is more suitable for modeling complex knowledge system than other fuzzy Petri Net models. In addition, the concepts of abstract place and abstract transition in HFPN are allowed to describe and analyze the knowledge system at diverse abstract levels. Therefore, using HFPN, the iterative and incremental methods can be applied to modeling complex knowledge system. In addition, structured approach can be naturally applied to the process of modeling knowledge system. © 2007 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

COVID-19 knowledge Graph for Drug and Vaccine Development

COVID-19 Knowledge Graph for Drug and Vaccine Development

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Huang, Lan Guan, Hongrui Liang, Yanchun Guan, Renchu Feng, Xiaoyue Jilin University The Key Laboratory for Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Changchun China Zhuhai College of Science and Technology Zhuhai Sub Laboratory Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Zhuhai China

ISBN: (纸本)9781665401265

The worldwide spread of COVID-19 has made a severe impact on human health and life. It has shown rapid propagation, long in vitro survival, and a long incubation period. More seriously, COVID-19 is more susceptible to variation, as it is an RNA virus. Mutations of COVID-19 have been reported in multiple countries worldwide, which makes drug and vaccine development a significant challenge. To search for potential drugs and vaccines and reveal the atlas of COVID-19 evolution, we extract information from massive unstructured data and construct a COVID-19 knowledge graph using the COVID-19 data. Based on machine learning approaches, we infer and predict novel coronavirus pneumonia-related diseases, drug action targets, etc. to speculate on new and more effective treatment methods. In addition, to study transcriptome of SARS-CoV-2, new ideas can be provided to biomedical experts with flexible responses to viral variation. An in-depth analysis of the COVID-19 pathomechanism at the pharmaceutical, genetic, and protein levels provides effective means and tools for novel coronavirus pneumonia vaccines, drug development, and therapeutic program design. © 2021 IEEE.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Experimental study of the three key issues of multi-auctioneer model in computer grid

Experimental study of the three key issues of multi-auctione...

引用

18th IASTED International Conference on Parallel and Distributed Computing and Systems

作者： Han, Xiao Fang, Zhiyi Wang, Wanyu Xu, Fengyuan Huang, Mengzhou School of Economics and Information Systems School of Computer Science and Technology Key Laboratory Symbolic Computation and Knowledge Engineering Education Ministry

ISBN: (纸本)9780889866386

By means of introducing multi-auctioneer model, resources in the computational economic grid can be managed and allocated like in the auction. We research and put forward the corresponding solve schemes of three key issues of auctioneer system: preventing auctioneer from cheating, selection of auctioneer, setting of trading prices, and use computational grid modeling and simulation tools GridSim to simulate computational grid environment in the experiment which uses multiauctioneer system to manage and schedule, then we analyze the results of experiment in different conditions, and validate the feasibility of a multi-auctioneer system in computational grid.

关键词： computational economic grid multi-auction system election of auctioneer

来源：评论

学校读者我要写书评

暂无评论

A two-stage HV-driven adaptive multi-objective evolutionary algorithm and its application in fixed polarity reed-muller circuits

引用

Expert Systems with Applications 2025年 288卷

作者： Lu Yang Shengsheng Wang Ruyi Dong Zihao Fu College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China College of Information and Control Engineering Jilin Institute of Chemical Technology Changchun 130012 China

To achieve a balance between convergence and diversity, we proposed a two-stage HV-driven adaptive multi-objective evolutionary algorithm (TSAMEA). TSAMEA employs a sinusoidal decreasing parameter adjustment method to enhance exploration pace in the first stage. An adaptive parameter control mechanism utilizes historical memory pools and an HV-driven degree adjustment strategy to achieve better exploitation in the second stage. Extensive experimental data demonstrate that TSAMEA outperforms nine other compared MOEAs. The component analysis illustrates the efficacy of each component of TSAMEA. In addition, area and power optimization are now the main limitations in chip design, TSAMEA is applied to area and power optimization for Fixed Polarity Reed-Muller (FPRM) logic circuits and perform well, which further verifies the ability of the TSAMEA to solve practical problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：