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

arXiv 2025年

作者： Hao, Pingting Liu, Kunpeng Gao, Wanfu College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Computer Science Portland State University PortlandOR97201 United States

In recent years, multi-view multi-label learning (MVML) has gained popularity due to its close resemblance to real-world scenarios. However, the challenge of selecting informative features to ensure both performance and efficiency remains a significant question in MVML. Existing methods often extract information separately from the consistency part and the complementary part, which may result in noise due to unclear segmentation. In this paper, we propose a unified model constructed from the perspective of global-view reconstruction. Additionally, while feature selection methods can discern the importance of features, they typically overlook the uncertainty of samples, which is prevalent in realistic scenarios. To address this, we incorporate the perception of sample uncertainty during the reconstruction process to enhance trustworthiness. Thus, the global-view is reconstructed through the graph structure between samples, sample confidence, and the view relationship. The accurate mapping is established between the reconstructed view and the label matrix. Experimental results demonstrate the superior performance of our method on multi-view datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Reconsidering Feature Structure Information and Latent Space Alignment in Partial Multi-label Feature Selection

arXiv

引用

arXiv 2025年

作者： Pan, Hanlin Liu, Kunpeng Gao, Wanfu College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Computer Science Portland State University PortlandOR97201 United States

The purpose of partial multi-label feature selection is to select the most representative feature subset, where the data comes from partial multi-label datasets that have label ambiguity issues. For label disambiguation, previous methods mainly focus on utilizing the information inside the labels and the relationship between the labels and features. However, the information existing in the feature space is rarely considered, especially in partial multi-label scenarios where the noises is considered to be concentrated in the label space while the feature information is correct. This paper proposes a method based on latent space alignment, which uses the information mined in feature space to disambiguate in latent space through the structural consistency between labels and features. In addition, previous methods overestimate the consistency of features and labels in the latent space after convergence. We comprehensively consider the similarity of latent space projections to feature space and label space, and propose new feature selection term. This method also significantly improves the positive label identification ability of the selected features. Comprehensive experiments demonstrate the superiority of the proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Novel Iterative Velocity Control Algorithm and Its FPGA Implementation Based on Trigonometric Function

引用

Chinese Journal of Electronics 2019年第2期28卷 237-245页

作者： WEN Quangang LIANG Yanchun Adriano Tavares Ricardo Teixeira WU Chunguo Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Department of Industrial Electronics University of Minho Campus de Azurm

The servo motor’s flexible acceleration/deceleration(acc/dec) control is an emerging research topic in the automation field. A velocity control algorithm based on trigonometric function is proposed in this *** required parameters, it transforms trigonometric calculations into elementary mathematical operations and calculates the velocity controlling values iteratively, which could avoid trigonometric calculation and reduce the computation time. Experimental results show that the proposed algorithm is suitable for implementation on field programmable gate arrays and achieves a flexible controlling, enhancing both the equipment’s stability and reliability. It is promising to significantly improve the high-speed computerized numerical control equipment’s controlling accuracy, without a huge hardware resource consumption.

关键词： Acceleration Velocity control Algorithm design and analysis Field programmable gate arrays Servomotors

来源：评论

学校读者我要写书评

暂无评论

DeepHBSP:A Deep Learning Framework for Predicting Human Blood-Secretory Proteins Using Transfer Learning

引用

Journal of Computer Science & Technology 2021年第2期36卷 234-247页

作者： Wei Du Yu Sun Hui-Min Bao Liang Chen Ying Li Yan-Chun Liang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and TechnologyJilin UniversityChangchun 130012China Department of Computer Science College of EngineeringShantou UniversityShantou 515063China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai 519041China

The identification of blood-secretory proteins and the detection of protein biomarkers in the blood have an important clinical application *** methods for predicting blood-secretory proteins are mainly based on traditional machine learning algorithms,and heavily rely on annotated protein *** traditional machine learning algorithms,deep learning algorithms can automatically learn better feature representations from raw data,and are expected to be more promising to predict blood-secretory *** present a novel deep learning model(DeepHBSP)combined with transfer learning by integrating a binary classification network and a ranking network to identify blood-secretory proteins from the amino acid sequence information *** loss function of DeepHBSP in the training step is designed to apply descriptive loss and compactness loss to the binary classification network and the ranking network,*** feature extraction subnetwork of DeepHBSP is composed of a multi-lane capsule ***,transfer learning is used to train a highly accurate generalized model with small samples of blood-secretory *** main contributions of this study are as follows:1)a novel deep learning architecture by integrating a binary classification network and a ranking network is proposed,superior to existing traditional machine learning algorithms and other state-of-the-art deep learning architectures for biological sequence analysis;2)the proposed model for blood-secretory protein prediction uses only amino acid sequences,overcoming the heavy dependence of existing methods on annotated protein features;3)the blood-secretory proteins predicted by our model are statistically significant compared with existing blood-based biomarkers of cancer.

关键词： blood-secretory protein deep learning capsule network transfer learning

来源：评论

学校读者我要写书评

暂无评论

The batch patching method using dynamic cache of proxy cache for streaming media

引用

4th International Conference on Grid and Cooperative Computing - GCC 2005

作者： Xu, Zhiwen Guo, Xiaoxin Che, Xiangjiu Wang, Zhengxuan Pang, Yunjie Open Symbol Computation and Knowledge Engineering Laboratory State Education Department Jilin University 130012 Jilin Province China

ISBN: (纸本)3540305106

The proxy cache for streaming media is the important method to economize the resources of the Internet. The cache policies influence the effect for proxy cache. In this paper, based on the client's request rate, cached the video based on segmentation, we proposed that the method for batch, patch and batch patching using dynamic cache. The policies of batch and batch patching using dynamic cache based on segmentation enlarge the width of the batch and patching. It combines dynamic cache based on segmentation with the excellence of patching. Presented that allocation relation between the segmented cache and dynamic cache in the batch and patching, and assured that batch patching using dynamic cache of proxy for streaming media based on segmentation is optimal. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Prior-guided dual-stage diabetic retinopathy grading model based on feature collaboration of lesion and vascular structure

引用

Expert Systems with Applications 2025年 285卷

作者： Guo, Xiaoxin Yang, Guangqi Xu, Chenfangqian Dong, Hongliang Hu, Xiaoying Che, Songtian Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University 2699 Qianjin Street Changchun130012 China College of Computer Science and Technology Jilin University 2699 Qianjin Street Changchun130012 China Ophthalmology Department Bethune First Hospital of Jilin University Changchun Jilin130021 China Ophthalmology Department Bethune Second Hospital of Jilin University Changchun Jilin130041 China

In order to fully utilize lesion features and vascular structure and solve the problem of class imbalance, diabetes retinopathy (DR) grading is modeled as a dual-stage task, and the prior-guided dual-stage diabetes retinopathy grading model is proposed by designing an end-to-end hierarchical framework, consisting of XE-Net and MFC-Net. The former uses vascular structure from color fundus images as prior knowledge to guide the classification of proliferative diabetic retinopathy (PDR) and non-PDR;the latter further classifies non-PDR images using color fundus images with four types of segmented lesions. The core of MFC-Net is the feature collaboration block (FCB) for multi-classification tasks, which is proposed to facilitate effective collaboration between global and local features. In addition, a class-balanced (CB) loss weight is also introduced to address the common class imbalance problem in DR datasets. The experimental results on two publicly available datasets, DDR and IDRiD show that the proposed model has significant advantages. © 2025 Elsevier Ltd

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

An ontology-based method in information translation

An ontology-based method in information translation

引用

2nd International Conference on Semantics, knowledge, and Grid, SKG 2006

作者： Bai, Yan Liu, Dayou Open Symbol Computation and Knowledge Engineering Laboratory of State Education Ministry College of Computer Science and Technology Jilin University China

ISBN: (纸本)076952673X

An ontology-based method named AOBM is proposed in this paper. It fully takes into account the factors that will afect the communication, and using ontology can be represented in agent's knowledge base. Pmvided ontology did not belong to the public data or have any public ontology, AOBM establishes a layering algorithm, which is able to avoid logical exception handling policies, ensure the right understanding of the communication entity concept, and resolve the consistency problem of the concept translation. Experimental results show that AOBM is superior to other methods, and can effectively improve the communication consistency of a mobile agent system under certain conditions. © 2006 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Novel measurement for mining effective association rules

Novel measurement for mining effective association rules

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Wei, Jin-Mao Yi, Wei-Guo Wang, Ming-Yang Institute of Computational Intelligence Northeast Normal University ChangChun Jilin 130024 China Open Symbol Computation and Knowledge Engineering Laboratory State Education Department Jilin University

ISBN: (纸本)078039092X

In this paper, we analyze the method of support-confidence framework when mining association rules. In order to avoid the limitation in the criterion, we propose a new method of match as the substitution of confidence. We analyze in detail the property of the proposed measurement. Experimental results show that there is higher correlation between the antecedent and the consequent of the rules produced by the improved method compared with the rules produced by the support-confidence framework. Furthermore, the improved method decreases the generation of redundancy rules. © 2005 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Canonical Huffman code based full-text index

引用

Progress in Natural Science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b, Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a College of Computer Science and Technology, Jilin University, Key laboratory of symbol computation and knowledge engineering of the Ministry of education, Changchun 130012, China b department of Computer Science, Jilin Technology and Business College, Changchun 130062, China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer Science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：评论

学校读者我要写书评

暂无评论

Identification of transcription factor binding sites using GA and PSO

Identification of transcription factor binding sites using G...

引用

6th International Conference on Intelligent Systems Design and Applications (ISDA 2006)

作者： Chang, Xiao-Yu Zhou, Chun-Guang Li, Yan-Wen Hu, Ping Key Laboratory of Symbol Computation and J Knowledge Engineering Jilin University Ministry of Education China Department of Computer Science Northeast Normal University Changchun 130012 China

ISBN: (纸本)0769525288

Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: Genetic, Algorithm (GA) and Particle Swarm Optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast Saccharomyces Cerevisiae transcription factor binding sites and CRP binding sites. The results on Saccharomyces Cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs Sampler.

关键词： Binding sites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：