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

Exploring Trial-and-Error in Deep Learning:Initial Application to Isotope Detection in Mass Spectrometry

Big Data Mining and Analytics 2024年第4期7卷 1251-1261页

作者： Qihong Jiao Yuxiao Wang Yongshuai Wang Shiwei Sun Xuefeng Cui School of Computer Science and Technology Shandong UniversityQingdao 266237China Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China

Mass spectrometry plays a crucial role in biomedicine by detecting isotopes,contributing significantly to research,diagnostics,and therapy *** study introduces IsoFusion,a deep learning model designed to address isotope detection in raw mass *** than directly applying convolutional layers to all signal and noise peaks,IsoFusion employs a trial-and-error ***,it investigates all potential charge states(trials)and collects signal peaks around expected m/z values for each ***,convolutional layers extract features from each trial,which are fused to identify the correct ***,the reparameterization trick predicts isotope features based on this correct trial.A key advantage of IsoFusion is shared model parameters across all trials,enhancing feature learning for less common charge states using data from prevalent *** results show a significant accuracy improvement for charge state 5,reaching 99.42%,compared to DeepIso’s 43.36%.Moreover,IsoFusion achieves a 97.33%detection accuracy for isotopes,with 2.4%of detected isotopes previously unidentified by four commonly used methods.

关键词： Liquid Chromatography-Mass Spectrometry(LC-MS) isotope detection retention time prediction charge state prediction deep learning

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

Parallel Attention Based Network for Human Activity Recognition Using Wearable Devices 27th

Parallel Attention Based Network for Human Activity Recogni...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Xu, Chenyang Fan, Feiyi Ke, Guanzhou Guo, Changru Wu, Qingyu Shen, Jianfei Institute of Computing Technology Chinese Academy of Sciences Beijing100090 China School of Electrical and Information Engineering Tianjin University Tianjin300072 China Beijing Jiaotong University Beijing100044 China Jinan Zhongke Ubiquitous-Intelligent Institute of Computing Technology Shandong Jinan250102 China

ISBN: (纸本)9783031782008

In recent years, significant progress has been made in improving the efficacy of wearable human activity recognition (HAR) tasks using deep learning technology. Existing research indicates that stacked convolutional layers effectively extract high-semantic signal features from multi-sensor channel time-series data. However, these approaches disregard the fact that sensor signals are low-semantic and sensor-based deep networks lead to overfitting and gradient vanishing. In this paper, we present the parallel attention-based HAR (PA-HAR) method. Our method employs multiple small-scale receptive fields to extract low-semantic signals in parallel and a skip-squeeze excitation block to establish correlations among multi-feature maps based on the feature channel dimension. We also introduce smooth and non-monotonic sigmoid linear units (SiLU) to integrate multi-scale and cross-channel features in order to prevent the loss of non-linear information due to small-scale receptive fields and reduce representational ability loss. Extensive experiments on seven public datasets show that our proposed PA-HAR model outperforms state-of-the-art approaches in HAR tasks. In addition, we develop a wearable real-time activity recognition system based on the embedded device with our model. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

In-Context Compositional Generalization for Large Vision-Language Models

In-Context Compositional Generalization for Large Vision-Lan...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Li, Chuanhao Jing, Chenchen Li, Zhen Zhai, Mingliang Wu, Yuwei Jia, Yunde Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China School of Computer Science Zhejiang University Hangzhou China

ISBN: (纸本)9798891761643

Recent work has revealed that in-context learning for large language models exhibits compositional generalization capacity, which can be enhanced by selecting in-context demonstrations similar to test cases to provide contextual information. However, how to exhibit in-context compositional generalization (ICCG) of large vision-language models (LVLMs) is non-trival. Due to the inherent asymmetry between visual and linguistic modalities, ICCG in LVLMs faces an inevitable challenge-redundant information on the visual modality. The redundant information affects in-context learning from two aspects: (1) Similarity calculation may be dominated by redundant information, resulting in sub-optimal demonstration selection. (2) Redundant information in in-context demonstrations brings misleading contextual information to in-context learning. To alleviate these problems, we propose a demonstration selection method to achieve ICCG for LVLMs, by considering two key factors of demonstrations: content and structure, from a multimodal perspective. Specifically, we design a diversity-coverage-based matching score to select demonstrations with maximum coverage, and avoid selecting demonstrations with redundant information via their content redundancy and structural complexity. We build a GQA-ICCG dataset to simulate the ICCG setting, and conduct experiments on GQA-ICCG and the VQA v2 dataset. Experimental results demonstrate the effectiveness of our method. © 2024 Association for Computational Linguistics.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

FUZZY ALIGNMENTS IN DIRECTED ACYCLIC GRAPH FOR NON-AUTOREGRESSIVE MACHINE TRANSLATION 11

FUZZY ALIGNMENTS IN DIRECTED ACYCLIC GRAPH FOR NON-AUTOREGRE...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Ma, Zhengrui Shao, Chenze Gui, Shangtong Zhang, Min Feng, Yang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Harbin Institute of Technology Shenzhen China

Non-autoregressive translation (NAT) reduces the decoding latency but suffers from performance degradation due to the multi-modality problem. Recently, the structure of directed acyclic graph has achieved great success in NAT, which tackles the multi-modality problem by introducing dependency between vertices. However, training it with negative log-likelihood loss implicitly requires a strict alignment between reference tokens and vertices, weakening its ability to handle multiple translation modalities. In this paper, we hold the view that all paths in the graph are fuzzily aligned with the reference sentence. We do not require the exact alignment but train the model to maximize a fuzzy alignment score between the graph and reference, which takes captured translations in all modalities into account. Extensive experiments on major WMT benchmarks show that our method substantially improves translation performance and increases prediction confidence, setting a new state of the art for NAT on the raw training data. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

引用

IEEE Transactions on Circuits and Systems for Video technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-Updating Strategy Based Particle Swarm Optimization

引用

intelligent Automation & Soft computing 2023年第9期37卷 2783-2807页

作者： Dongping Tian Bingchun Li Jing Liu Chen Liu Ling Yuan Zhongzhi Shi School of Computer Science and Technology Kashi UniversityKashi844006China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing100190China

Particle swarm optimization(PSO)is a stochastic computation tech-nique that has become an increasingly important branch of swarm intelligence ***,like other evolutionary algorithms,PSO also suffers from premature convergence and entrapment into local optima in dealing with complex multimodal *** this paper puts forward an adaptive multi-updating strategy based particle swarm optimization(abbreviated as AMS-PSO).To start with,the chaotic sequence is employed to generate high-quality initial particles to accelerate the convergence rate of the ***,according to the current iteration,different update schemes are used to regulate the particle search process at different evolution *** be specific,two different sets of velocity update strategies are utilized to enhance the exploration ability in the early evolution stage while the other two sets of velocity update schemes are applied to improve the exploitation capability in the later evolution *** by the unequal weightage of acceleration coefficients is used to guide the search for the global worst particle to enhance the swarm *** addition,an auxiliary update strategy is exclusively leveraged to the global best particle for the purpose of ensuring the convergence of the PSO ***,extensive experiments on two sets of well-known benchmark functions bear out that AMS-PSO outperforms several state-of-the-art PSOs in terms of solution accuracy and convergence rate.

关键词： Particle swarm optimization local optima acceleration coefficients swarm diversity premature convergence

来源：评论

学校读者我要写书评

暂无评论

An Entity Alignment Algorithm Based on Ontology Enhancement and Multi-Feature Fusion 6

An Entity Alignment Algorithm Based on Ontology Enhancement ...

引用

6th International Conference on Frontier Technologies of information and Computer, ICFTIC 2024

作者： Song, Hao Lei, Yuxia Zi, Kangli Quan, Fuyuan Zhang, Tianhang Li, Qi School of Computer Science Qufu Normal University Shandong Rizhao China Institute of Computing Technology Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Beijing China

ISBN: (纸本)9798331541750

Entity alignment plays a crucial role in the integration of knowledge graphs. However, current knowledge graphs often suffer from inconsistent construction standards, structural heterogeneity, and imprecise semantic representation of entities, which can lead to suboptimal embedding of structural information. Moreover, most existing entity alignment methods rely heavily on structural information, which limits alignment efficiency. To address these challenges, this paper presents Onto-IMF, an ontology-enhanced entity alignment method based on multi-feature fusion. This approach aims to enhance the semantic representation of entities by incorporating ontology information, thereby reducing structural discrepancies among heterogeneous graphs and improving the embedding of structural information. The multi-feature fusion entity alignment leverages diverse semantic features, including relations, attributes, and entity names, to achieve more accurate alignment. Experimental results on various DBP15K subsets indicate that the proposed method achieves Hits@l scores of 86.6%, 93.0%, and 97.7%, respectively, representing an average improvement of 7.9% over the best-performing baseline models. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

GNSS Signal Acquisition Based on Compressive Sensing and Improved Measurement Matrix 6

GNSS Signal Acquisition Based on Compressive Sensing and Imp...

引用

6th International Conference on Electronic Engineering and Informatics, EEI 2024

作者： Zhang, Wenjun Chen, Jie Guo, Yincun Zhao, Yongchen School of Communication and Information Engineering Shanghai University Shanghai China Shanghai Aerospace Electronic Technology institute Shanghai Aerospace Electronic Technology Institute Shanghai Key Laboratory of Intelligent Computing for Spatial Heterogeneous Network Shanghai China

ISBN: (纸本)9798350353594

The main task of Global Navigation Satellite System (GNSS) receiver is to obtain satellite signals, but the signal acquisition operations performed in this process consume a large amount of hardware resources. Compressed sensing is a new signal sampling theory that can reduce the calculation amount of the acquisition process, but it will also bring a certain signal-to-noise ratio loss. In order to improve the acquisition performance on the basis of reducing the amount of signal acquisition calculations, this paper proposes an improved measurement matrix compressed sensing signal partial matched filter-fast Fourier transform (PMF -FFT) acquisition method, which improves the Gaussian random matrix through singular value decomposition and improves the incoherence of the measurement matrix. Simulation results show that this method significantly reduces the amount of acquisition calculations without greatly reducing the acquisition performance. © 2024 IEEE.

关键词： Matched filters

来源：评论

学校读者我要写书评

暂无评论

A Bi-selection Method Based on Consistent Matrix for Large-Scale Datasets

引用

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1992-2005页

作者： Quan, Jinsheng Qiao, Fengcai Yang, Tian Shen, Shuo Qian, Yuhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Institute of Interdisciplinary Studies Changsha410081 China National University of Defense Technology College of Advanced Interdisciplinary Studies Changsha410081 China Shanxi University Institute of Big Data Science and Industry Taiyuan030006 China

Biselection (feature and sample selection) enhances the efficiency and accuracy of machine learning models when handling large-scale data. Fuzzy rough sets, an uncertainty mathematics model known for its excellent interpretability, are widely used in machine learning, particularly for feature selection. While the consistent matrix has significantly improved the computational efficiency and scalability of feature selection, like most fuzzy rough set-based methods, it focuses only on feature selection and seldom incorporates sample selection. This feature-centric approach can limit classification performance, particularly in noisy and large-scale datasets where both features and samples require judicious selection. To overcome these limitations, this article explores the integration of sample selection with feature selection. First, we introduce a β-consistent granulation method to generate more accurate and concise fuzzy information granules, reducing the impact of noisy samples. In addition, a novel membership function is employed to distinguish noise while simultaneously evaluating both features and samples. As a result, a biselection algorithm with linear computation complexity is proposed to select high-quality features and samples. Numerical experiments demonstrate that, compared to eleven representative algorithms, our proposed method achieves an average accuracy improvement of 9.66% and a 933-fold increase in efficiency. © 2025 IEEE.

关键词： Rough sets Noise Feature extraction Classification algorithms Accuracy Machine learning information systems Data models Computational efficiency Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：