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

Unsupervised feature selection with evolutionary sparsity

Neural Networks 2025年 189卷 107512页

作者： Zhou, Shixuan Xiang, Yi Huang, Han Huang, Pei Peng, Chaoda Yang, Xiaowei Song, Peng School of Software Engineering South China University of Technology Guangzhou510006 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Ministry of Education Guangzhou510006 China Guangdong Engineering Center for Large Model and GenAI Technology Guangzhou510006 China School of Information Science Guangdong University of Finance and Economics Guangzhou510006 China School of Mathematics and Informatics South China Agricultural University Guangzhou510006 China School of Computer and Control Engineering Yantai University Yantai264005 China

The 2,0-norm is playing an increasingly important role in unsupervised feature selection. However, existing algorithm for optimization problem with 2,0-norm constraint has two problems: First, they cannot automatically determine the sparsity, also known as the number of key features. Second, they have the risk of converging towards local optima, therefore selecting trivial (less informative) features. To address these problems, this paper proposes an unsupervised feature selection method with evolutionary sparsity (EVSP), which integrates the feature selection process with a sparse projection matrix and population search mechanisms into a unified unsupervised feature selection framework. Specifically, the level of sparsity is encoded as population individuals, and subsequently, a multi-objective evolutionary algorithm based on binary encoding is introduced to recursively determine the optimal level of sparsity, thus unsupervisedly guiding the learning of an optimal row-sparse projection matrix. Moreover, by utilizing the feature weights learned through sparse projection, a two-stage strategy called the mutation-repair operator is designed to steer the evolution of the population, aiming to generate high-quality candidate solutions. Comprehensive experiments on eleven benchmark datasets, with a maximum dimensionality of 10304 features and a maximum size of 9298 samples, demonstrate that the proposed EVSP method can effectively determine the optimal sparsity level, significantly outperforming several state-of-the-art methods. © 2025 Elsevier Ltd

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Image Transmission Schemes over Zigbee-Based Image Sensor Networks

引用

Chinese Journal of Electronics 2016年第2期25卷 284-289页

作者： TAO Dan YANG Guangwei CHEN Houjin WU Hao LIU Pingping School of Electronic and Information Engineering Beijing Jiaotong University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University College of Computer Science and Technology Jilin University

Image transmission is one of the biggest challenges in wireless sensor networks because of the limited resource on sensor nodes. We proposed two image transmission schemes driven by reliability and real time considerations in order to transfer JPEG images over Zigbee-based sensor networks. By adding two bytes counter in the header of data packet, we can easily solve the repeated data reception problem caused by retransmission mechanism in traditional Zigbees network layer. We proposed an efficient retransmission and acknowledgment mechanism in Zigbees application layer. By classifying different data reception response events, we can provide data packets with differential responses and ensure that image packets can be transferred quickly even with large maximum number of retransmission. Practical results show the effectiveness of our solutions to make image transmission over Zigbee-based sensor networks efficient.

关键词： Image sensor networks Image transmission Retransmission and acknowledgment mechanism Zigbee

来源：评论

学校读者我要写书评

暂无评论

SPHLU:An Efficient Algorithm for Processing PRkNN Queries on Uncertain Data

引用

Chinese Journal of Electronics 2016年第3期25卷 403-406页

作者： WANG Shengsheng LI Yang CHAI Sheng BOLOU Bolou Dickson College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of EducationJilin University

Query on uncertain data has received much attention in recent years, especially with the development of Location-based services(LBS). Little research is focused on reverse k nearest neighbor queries on uncertain data. We study the Probabilistic reverse k nearest neighbor(PRkN N) queries on uncertain data. It is succinctly shown that, PRkN N query retrieves all the points that have higher probabilities than a given threshold value to be the Reverse k-nearest neighbor(RkN N) of query data *** previous works on this topic mostly process with k > *** algorithms allow the cases for k > 1, but the efficiency is inefficient especially for large k. We propose an efficient pruning algorithm — Spatial pruning heuristic with louer and upper bound(SPHLU) for solving the PRkN N queries for k > 1. The experimental results demonstrate that our algorithm is even more efficient than the existent algorithms especial for a large value of k.

关键词： Spatial database Uncertain data R-tree Probabilistic reverse k nearest neighbor queries

来源：评论

学校读者我要写书评

暂无评论

A Re-Parametrization-Based Bayesian Differential Analysis Algorithm for Gene Regulatory Networks Modeled with Structural Equation Models

引用

Computer Modeling in engineering & Sciences 2020年第7期124卷 303-313页

作者： Yan Li Dayou Liu Yungang Zhu Jie Liu College of Computer Science and Technology Jilin UniversityChangchun130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun130012China

Under different conditions,gene regulatory networks(GRNs)of the same gene set could be similar but *** differential analysis of GRNs under different conditions is important for understanding condition-specific gene regulatory *** a naive approach,existing GRN inference algorithms can be used to separately estimate two GRNs under different conditions and identify the differences between ***,in this way,the similarities between the pairwise GRNs are not taken into *** joint differential analysis algorithms have been proposed recently,which were proved to outperform the naive approach *** this paper,we model the GRNs under different conditions with structural equation models(SEMs)to integrate gene expression data and genetic perturbations,and re-parameterize the pairwise SEMs to form an integrated model that incorporates the differential ***,a Bayesian inference method is used to make joint differential analysis by solving the integrated *** evaluated the performance of the proposed re-parametrization-based Bayesian differential analysis(ReBDA)algorithm by running simulations on synthetic data with different *** performance of the ReBDA algorithm was demonstrated better than another state-of-the-art joint differential analysis algorithm for SEMs ReDNet *** the end,the ReBDA algorithm was applied to make differential analysis on a real human lung gene data set to illustrate its applicability and practicability.

关键词： Gene regulatory networks structural equation models joint

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deriving all minimal consistency-based diagnosis sets using SAT solvers

引用

Progress in Natural Science:Materials International 2009年第4期19卷 489-494页

作者： Xiangfu Zhao a,b, Liming Zhang a,b, Dantong Ouyang a,b, Yu Jiao a,b a key laboratory of symbolic computation and knowledge engineering of Ministry of Education, Jilin University, Changchun 130012, China b School of Computer Science and Technology, Jilin University, Changchun 130012, China [a]Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China [b]School of Computer Science and Technology Jilin University Changchun 130012 China

In this paper, a novel method is proposed for judging whether a component set is a consistency-based diagnostic set, using SAT solv- ers. Firstly, the model of the system to be diagnosed and all the observations are described with conjunctive normal forms (CNF). Then, all the related clauses in the CNF files to the components other than the considered ones are extracted, to be used for satisfiability checking by SAT solvers. Next, all the minimal consistency-based diagnostic sets are derived by the CSSE-tree or by other similar algorithms. We have implemented four related algorithms, by calling the gold medal SAT solver in SAT07 competition – RSAT. Experimental results show that all the minimal consistency-based diagnostic sets can be quickly computed. Especially our CSSE-tree has the best effciency for the singleor double-fault diagnosis.

关键词： Conjunctive normal form Consistency-based diagnosis Model-based diagnosis SAT solver

来源：评论

学校读者我要写书评

暂无评论

Local feature aggregation algorithm based on graph convolutional network

引用

Frontiers of Computer Science 2022年第3期16卷 203-205页

作者： Hao WANG Liyan DONG Minghui SUN College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China

1Introduction and main contributions In the field of social networks and knowledge graphs,semi-supervised learning models based on graph convolutional networks have achieved great success in node classification[1],inductive node embedding[2],link prediction[3],and *** semi-supervised models based on graph convolutional network(GCN)[4]expect to obtain more feature information of a graph or accelerate the training.

关键词： convolution aggregation semi

来源：评论

学校读者我要写书评

暂无评论

SEOE:an option graph based semantically embedding method for prenatal depression detection

引用

Frontiers of Computer Science 2024年第6期18卷 245-258页

作者： Xiaosong HAN Mengchen CAO Dong XU Xiaoyue FENG Yanchun LIANG Xiaoduo LANG Renchu GUAN College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin UniversityChangchun 130012China Department of Electrical Engineering and Computer Science and Christopher S.Bond Life Sciences Center University of MissouriColumbiaMO 65211USA Department of Computer Science and Technology Zhuhai Laboratory of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationZhuhai College of Science and TechnologyZhuhai 519041China Jilin Provincial Institute of Population Science and Technology Changchun 130000China

Prenatal depression,which can affect pregnant women’s physical and psychological health and cause postpartum depression,is increasing ***,it is essential to detect prenatal depression early and conduct an attribution *** studies have used questionnaires to screen for prenatal depression,but the existing methods lack *** diagnose the early signs of prenatal depression and identify the key factors that may lead to prenatal depression from questionnaires,we present the semantically enhanced option embedding(SEOE)model to represent questionnaire *** can quantitatively determine the relationship and patterns between options and *** first quantifies options and resorts them,gathering options with little difference,since Word2Vec is highly dependent on *** resort task is transformed into an optimization problem involving the traveling salesman ***,all questionnaire samples are used to train the options’vector using ***,an LSTM and GRU fused model incorporating the cycle learning rate is constructed to detect whether a pregnant woman is suffering from *** verify the model,we compare it with other deep learning and traditional machine learning *** experiment results show that our proposed model can accurately identify pregnant women with depression and reach an F1 score of *** most relevant factors of depression found by SEOE are also verified in the *** addition,our model is of low computational complexity and strong generalization,which can be widely applied to other questionnaire analyses of psychiatric disorders.

关键词： questionnaire analyses text classification graph representation learning traveling salesman problem prenatal depression

来源：评论

学校读者我要写书评

暂无评论

Autonomous Domain Correlation-Based Cross-domain Network View Caching Method for SDN Distributed Controller

引用

Chinese Journal of Electronics 2016年第6期25卷 1127-1133页

作者： FU Tao HU Liang CHAI Sheng CHE Xilong College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University

Software-defined networks(SDN) maintain a global view of the network, thus improving the intelligence of forwarding decisions. With the expansion of the network scale, distributed controllers are used in a variety of large-scale networks in which subnetworks managed by controller instance are called autonomous domains. We analyze statistic frequency of communication across the autonomous domain. We calculate the autonomous domain correlations for controller instances using acquired statistical information. We cache network views to highly correlated controller instances. Distributed controllers are capable of considering both the average response time and overall storage. An experiment shows that our method can fully take advantage of these two performance indicators.

关键词： Software-defined networks(SDN) Distributed controller Network analyze Network view cache

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：