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

41st International Conference on Machine Learning, ICML 2024

作者： Li, Changchun Dai, Yuanchao Feng, Lei Li, Ximing Wang, Bing Ouyang, Jihong College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

Positive and Unlabeled (PU) learning refers to a special case of binary classification, and technically, it aims to induce a binary classifier from a few labeled positive training instances and loads of unlabeled instances. In this paper, we derive a theorem indicating that the probability boundary of the asymmetric disambiguation-free expected risk of PU learning is controlled by its asymmetric penalty, and we further empirically evaluated this theorem. Inspired by the theorem and its empirical evaluations, we propose an easy-to-implement two-stage PU learning method, namely Positive and Unlabeled Learning with Controlled Probability Boundary Fence (PUL-CPBF). In the first stage, we train a set of weak binary classifiers concerning different probability boundaries by minimizing the asymmetric disambiguation-free empirical risks with specific asymmetric penalty values. We can interpret these induced weak binary classifiers as a probability boundary fence. For each unlabeled instance, we can use the predictions to locate its class posterior probability and generate a stochastic label. In the second stage, we train a strong binary classifier over labeled positive training instances and all unlabeled instances with stochastic labels in a self-training manner. Extensive empirical results demonstrate that PUL-CPBF can achieve competitive performance compared with the existing PU learning baselines. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

SS-MAF: Semi-Supervised Echocardiographic Segmentation Using Multi-Atlas Fusion 8

SS-MAF: Semi-Supervised Echocardiographic Segmentation Using...

引用

8th International Conference on Communication, Image and Signal Processing, CCISP 2023

作者： Yang, Shuaihua Zheng, Caixia College of Information Science and Technology Northeast Normal University Changchun130117 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China

ISBN: (纸本)9798350305838

Left ventricle (LV) segmentation in echocardiography is of paramount significance in cardiac function analysis. Recently, semi-supervised segmentation has garnered considerable attention due to its potential mitigation of labeling costs. Despite this, most semi-supervised methodologies tend to overlook the specialized anatomical priors specific to echocardiography, often yielding suboptimal outcomes. Simultaneously, atlas priors have been validated on other organs and imaging modalities. However, their direct application in echocardiography is fraught with challenges, primarily attributed to the indistinct boundaries of the LV and the presence of fan-shaped image edges, which impede atlas image registration. This paper presents a new method of semi-supervised segmentation using multi-atlas fusion, named SS- MAF, which is designed to incorporate atlas priors tailored for echocardiography while circumventing the intricate image registration process in traditional atlas-based methods. The SS-MAF comprises two components: a Multi-Task Learning (MTL) module and a Multi-Atlas Fusion (MAF) module. The MTL module serves precise landmark localization and segmentation estimation. The MAF module is primarily focused on the generation of probabilistic atlases, utilizing annotated atlas data with the guidance of key landmarks to facilitate the automatic annotation of unlabeled data, avoiding the traditional image-level registration, thus enhancing the performance of the MTL module. Our SS- MAF is rigorously evaluated on the publicly available CAMUS dataset, with results demonstrating its superiority over other state-of-the-art semi-supervised segmentation techniques in echocardiography. © 2023 IEEE.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Algorithms with Heuristic Gradient-based Repair for Constrained Optimization

Evolutionary Algorithms with Heuristic Gradient-based Repair...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Du, Jiacheng Bu, Chenyang Liu, Yuxin Liu, Fei Luo, Wenjian Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Anhui Hefei230027 China Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518000 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Gradient-based repair aims to repair infeasible solutions to feasible ones using the gradient information of the constraints. As an effective constraint handling method, gradientbased repair has received extensive attention and has been applied in various evolutionary algorithms (EAs). Nevertheless, due to the complexity of constraints in practical problems, a single infeasible solution often needs to be repaired multiple times until it becomes a feasible solution or reaches the maximum number of repairs. As far as we know, existing related research on gradient-based repair mainly applies this method directly to EAs, while there is little work in the evolutionary computing community on how to improve gradient-based repair. Currently, the multiple repairs for a single individual are independent. That is, the current repair does not consider the previous repair experience. However, only using gradient information to repair infeasible individuals may result in oscillations in the search process. Therefore, in this paper, we propose a heuristic gradient-based repair method (HGR) which exploits the previous repair information of an individual to alleviate this issue. Experimental results on several benchmarks demonstrate the effectiveness of the proposed method. The source code is available at https://***/DMiC-Lab-HFUT/HGR-SMC2022. © 2022 IEEE.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

knowledge Graph based Mutual Attention for Machine Reading Comprehension over Anti-Terrorism Corpus

引用

data Intelligence 2023年第3期5卷 685-706页

作者： Feng Gao Jin Hou Jinguang Gu Lihua Zhang School of Computer Science and Technology Wuhan University of Science and TechnologyWuhan 430065Hubei The Key Laboratory of Rich-Media Knowledge Organization and Service of Digital Publishing Content Insitute of Scientic and Technical Information of ChinaBeijing 100038China Wuhan University of Science and Technology Big Data Science and Engineering Research Institute Wuhan 430065Hubei Eastchina Jiaotong University Nanchang 330013Jiangxi

Machine reading comprehension has been a research focus in natural language processing and intelligence ***,there is a lack of models and datasets for the MRC tasks in the anti-terrorism ***,current research lacks the ability to embed accurate background knowledge and provide precise *** address these two problems,this paper first builds a text corpus and testbed that focuses on the anti-terrorism domain in a semi-automatic ***,it proposes a knowledge-based machine reading comprehension model that fuses domain-related triples from a large-scale encyclopedic knowledge base to enhance the semantics of the *** eliminate knowledge noise that could lead to semantic deviation,this paper uses a mixed mutual ttention mechanism among questions,passages,and knowledge triples to select the most relevant triples before embedding their semantics into the *** results indicate that the proposed approach can achieve a 70.70%EM value and an 87.91%F1 score,with a 4.23%and 3.35%improvement over existing methods,respectively.

关键词： Machine reading comprehension Anti-terrorism domain knowledge embedding knowledge attention Mutual attention

来源：评论

学校读者我要写书评

暂无评论

FedLMT: Tackling System Heterogeneity of Federated Learning via Low-Rank Model Training with Theoretical Guarantees 41

FedLMT: Tackling System Heterogeneity of Federated Learning ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Liu, Jiahao Zhou, Yipeng Wu, Di Hu, Miao Guizani, Mohsen Sheng, Quan Z. School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Computing Faculty of Science and Engineering Macquarie University Sydney Australia Abu Dhabi United Arab Emirates

Federated learning (FL) is an emerging machine learning paradigm for preserving data privacy. However, diverse client hardware often has varying computation resources. Such system heterogeneity limits the participation of resource-constrained clients in FL, and hence degrades the global model accuracy. To enable heterogeneous clients to participate in and contribute to FL training, previous works tackle this problem by assigning customized sub-models to individual clients with model pruning, distillation, or low-rank based techniques. Unfortunately, the global model trained by these methods still encounters performance degradation due to heterogeneous sub-model aggregation. Besides, most methods are heuristic-based and lack convergence analysis. In this work, we propose the FedLMT framework to bridge the performance gap, by assigning clients with a homogeneous pre-factorized low-rank model to substantially reduce resource consumption without conducting heterogeneous aggregation. We theoretically prove that the convergence of the low-rank model can guarantee the convergence of the original full model. To further meet clients' personalized resource needs, we extend FedLMT to pFedLMT, by separating model parameters into common and custom ones. Finally, extensive experiments are conducted to verify our theoretical analysis and show that FedLMT and pFedLMT outperform other baselines with much less communication and computation costs. Copyright 2024 by the author(s)

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

Using Depth-Enhanced Spatial Transformation for Student Gaze...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Miao, Haonan Zhao, Peizheng Sun, Yuqi Nan, Fang Zhang, Xiaolong Wu, Yaqiang Tian, Feng School of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China School of Advanced Technology Xi'an Jiaotong-Liverpool University Suzhou215123 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798350368741

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students' gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods. © 2025 IEEE.

关键词： classroom depth-enhanced 2D space dual-view gaze target estimation spatial transformation

来源：评论

学校读者我要写书评

暂无评论

Evolution of vegetation phenology and its response to urbanisation in Shaanxi province,China:A fine-scale perspective

引用

Journal of Geographical Sciences 2025年第5期35卷 1024-1048页

作者： GAO Meiling MA Jingjing LI Zhenhong YANG Guijun College of Geological Engineering and Geomatics Chang'an UniversityXi'an 710054China State Key Laboratory of Loess Science Xian 710054China Key Laboratory of Ecological Geology and Disaster Prevention Ministry of Natural ResourcesXi'an 710054China Big Data Center for Geosciences and Satellites Xi'an 710054China

Shaanxi province in China is rich in vegetation resources,making the study of vegetation phenology crucial for understanding climate change and ecological *** studies on Shaanxi have primarily focused on coarse-scale phenology,which results in the loss of essential spatial details due to the lack of finer-scale ***,the impact of rapid urbanisation on the phenology of various vegetation types in this region remains *** address these gaps,we integrated Landsat and MODIS data to generate a daily 30 m NDVI *** phenology across Shaanxi from 2000 to 2020 was then extracted and analysed,and the responses of different vegetation types to urbanisation were *** indicated that accurate vegetation phenology can be obtained at a 30 m resolution,which is more precise than conventional coarse-scale *** Start of Season(SOS)and End of Season(EOS)in the province advanced by-0.56 and-0.08 day/year,respectively,from 2000 to *** general,the SOS gradually delays,and the EOS progressively advances with increasing ***,anomalies were identified in regions south of 32.64°N and across the zone from 34.04°N to 37.56°N,which are primarily due to the effects of high elevation and rapid urbanisation,*** investigation into phenological differences among various vegetation types revealed that forests exhibit the earliest SOS,while grasslands present the *** addition,a significant negative correlation was found between the SOS difference and air temperature difference along the urban-rural gradient,with urbanisation having the most significant impact on cropland *** study provides valuable insights into vegetation phenology and its response to *** insights offer crucial information for ecological conservation and management strategies.

关键词： vegetation phenology gap filling and Savitzky-Golay filtering Google Earth Engine spatiotemporal changes urbanisation

来源：评论

学校读者我要写书评

暂无评论

A topic detection method based on KM-LSH Fusion algorithm and improved BTM model

引用

Soft Computing 2024年第19期28卷 11421-11438页

作者： Liu, Wenjun Guo, Huan Gan, Jiaxin Wang, Hai Wang, Hailan Zhang, Chao Peng, Qingcheng Sun, Yuyan Yu, Bao Hou, Mengshu Li, Bo Li, Xiaolei School of Computer and Software Engineering XiHua University Chengdu610039 China Chengdu611731 China Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College Luzhou646000 China School of Big Data and Artificial Intelligence Chengdu Technological University Chengdu611730 China Sichuan Provincial Engineering Research Center of Hydroelectric Energy Power Equipment Technology Chengdu610039 China

Topic detection is an information processing technology designed to help people deal with the growing problem of data information on the Internet. In the research literature, topic detection methods are used for topic classification through word embedding, supervised-based and unsupervised-based approaches. However, most methods for topic detection only address the problem of clustering and do not focus on the problem of topic detection accuracy reduction due to the cohesiveness of topics. Also, the sequence of biterm during topic detection can cause substantial deviations in the detected topic content. To solve the above problems, this paper proposes a topic detection method based on KM-LSH fusion algorithm and improved BTM model. KM-LSH fusion algorithm is a fusion algorithm that combines K-means clustering and LSH refinement clustering. The proposed method can solve the problem of cohesiveness of topic detection, and the improved BTM model can solve the influence of the sequence of biterm on topic detection. First, the text vector is constructed by processing the collected set of microblog texts using text preprocessing methods. Secondly, the KM-LSH fusion algorithm is used to calculate text similarity and perform topic clustering and refinement. Finally, the improved BTM model is used to model the texts, which is combined with the word position and the improved TF-IDF weight calculation algorithm to adjust the microblogging texts in clustering. The experiment results indicate that the proposed KM-LSH-IBTM method improves the evaluation indexes compared with the other three topic detection methods. In conclusion, the proposed KM-LSH-IBTM method promotes the processing capability of topic detection in terms of cohesiveness and the sequence of biterm. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Discriminative latent semantics-preserving similarity embedding hashing for cross-modal retrieval

引用

Neural Computing and Applications 2024年第18期36卷 10655-10680页

作者： Chen, Yongfeng Tan, Junpeng Yang, Zhijing Cheng, Yongqiang Chen, Ruihan School of Information Engineering Guangdong University of Technology Guangdong Guangzhou510006 China School of Electronic and Information Engineering South China University of Technology Guangdong Guangzhou510641 China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangdong Guangzhou510665 China Department of Computer Science and Technology University of Hull HullHU6 7RX United Kingdom

Recently, there has been a significant increase in interest in cross-modal hashing technology. For hash code learning, most previous supervision methods use label information to create a similarity matrix in a straightforward manner. However, there are still the following challenges: (1) The asymmetric similarity matrix method only considers the similarity of labels, and the discriminant constraint in Hamming space is ignored;(2) there are optimization errors between the cross-modal semantic correlation of the Hamming space and the nonlinearity of the feature space;and (3) the cross-modal hash matrix is in a dynamic state during the optimization process, and the hash code is easily disturbed and there is bit uncertainty. To this end, we propose the Discriminative Latent Semantics-preserving Similarity Embedding Cross-modal Hashing (DLSSECH) method. Specifically, to reduce the quantization error, we introduce a non-asymmetric similarity decomposition based on orthogonal rotation bias. It can decompose the bitwise correlation of the learned hash code to capture more discriminative semantic information and compact hash code. In addition, to capture the cross-modal semantic correlation of nonlinear feature transformation and reduce quantization error, we propose the latent correlation error matrices based on orthogonal rotation decomposition. The model maintains the maximum difference in semantic dependencies between the projected data and its semantic representation. Finally, we use a sparse common hash matrix and non-asymmetric similarity decomposition factors to solve the uncertainty of the dynamic changes of the hash code. The effectiveness of DLSSECH has demonstrated through experiments on four cross-modal retrieval datasets, where it outperformed some state-of-the-art methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Homomorphic Encryption based stem cell assay data sharing study 4

Homomorphic Encryption based stem cell assay data sharing st...

引用

4th IEEE International Conference on Information Technology, Big data and Artificial Intelligence, ICIBA 2024

作者： Xiao, Hengjiang Liang, Zhihong Huang, Yuxiang Qin, Mingming Xiong, Fei Liu, Mengxin Southwest Forestry University School of Big Data and Intelligent Engineering Kunming China Southwest Forestry University Key Laboratory of National Forestry and Grassland Administration on Forestry and Ecological Big Data China Southwest Forestry University School of Economics and Management Kunming China

ISBN: (纸本)9798350363586

With the rapid development of the biomedical field, stem cell therapy has received widespread attention as an innovative therapy with great potential. However, privacy protection and secure sharing of stem cell testing data are still major challenges. In this paper, we propose a homomorphic encryption-based data sharing scheme for stem cell testing, which achieves efficient and secure data sharing with data privacy by designing a system architecture covering data acquisition, encryption, transmission, decryption and analysis. Experimental results show that the scheme can not only effectively protect data privacy, but also support efficient data processing with less impact on system performance. The main contributions of this paper include designing and implementing a stem cell detection data sharing system based on homomorphic encryption, proposing a homomorphic encryption algorithm optimised for the high-dimensional characteristics of stem cell data, and experimentally verifying the security and effectiveness of the system. Future research directions include optimising homomorphic encryption algorithms, expanding application scenarios, integrating multiple privacy protection techniques, and optimising system performance. © 2024 IEEE.

关键词： data assimilation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：