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

4th International Conference on Machine Learning and computer Application, ICMLCA 2023

作者： Ma, Yongzheng Sun, Zhengkai Zhang, Yintong Guan, Hongjiao Qiao, Xinxiao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9798400709449

Self-training is a classical semi-supervised classification method, which iteratively trains labeled samples that are enhanced using unlabeled samples. However, traditional self-training selects pseudo-labeled examples without distinguishing between different classes. Furthermore, wrong pseudo-labeled samples accumulate, leading to an increase in learning bias. In this paper, we propose a self-paced self-training based on K-nearest neighbors (SPST-KNN). SPST-KNN is composed of three main components: sample difficulty calculation, sample type determination, and self-paced selection based on KNN. The types of examples, including safe, boundary, and outlying examples, are determined by KNN. According to the principle of self-paced learning, SPST-KNN preferentially selects easy pseudo-labeled examples in each sample type to be added into the labeled sample set. Experiments and ablation study on 20 real-world datasets have demonstrated the superiority and effectiveness of the proposed SPST-KNN. © 2023 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

GA-Net: Gated Attention Mechanism Based Global Refinement network for Image Inpainting 29

GA-Net: Gated Attention Mechanism Based Global Refinement Ne...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Qiu, Ran Zhao, Shengrong Liang, Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

Underwater images are often affected by problems such as light attenuation, color distortion, noise and scattering, resulting in image defects. A novel image inpainting method is proposed to intelligently predict and fill damaged areas for complete and continuous visualization of the image. First, in order to effectively solve the problem of color distortion caused by light refraction in underwater environments, the improved gated attention mechanism is used. This mechanism improves the local details by learning and weighting the important features of the image. Second, gated convolution automatically determines the degree of restoration for each pixel based on local features of the original image. It eliminates distractions such as low contrast and scattering, retaining more original detailed information. By doing so, image inpainting techniques improve the quality and visualization of underwater images. © 2023 IEEE.

关键词： Gated convolution Image inpainting Underwater images

来源：评论

学校读者我要写书评

暂无评论

HMGR: A Hybrid Model for Geolocation Recommendation 12th

HMGR: A Hybrid Model for Geolocation Recommendation

引用

12th International Congress on Big Data, BigData 2023

作者： Wen, Ruwang Cheng, Zhengxiang Mao, Weixuan Mei, Zhuolin Shi, Jiaoli Cheng, Xiao School of Computer and Big Data Science Jiujiang University Jiangxi Jiujiang China Jiujiang Key Laboratory of Network and Information Security Jiangxi Jiujiang China Institute of Information Security Jiujiang University Jiangxi Jiujiang China

ISBN: (纸本)9783031447242

The Geosocial networks integrate geographical location information into traditional social networks, bridging the gap between people's real-life experiences and the virtual world. As a significant application of geosocial networks, location recommendation suggests places that individuals may find interesting, offering valuable references for their travels and greatly enhancing their lives. Consequently, the challenge of recommending relevant locations to users from a vast pool of geographic options has become a prominent topic in academic research. Collaborative filtering algorithms stand as one of the classic solutions in the field of recommendations. While they partially address the problem of information overload, they often encounter a common obstacle known as the cold start problem. To overcome this issue, this study makes two primary contributions: Firstly, it proposes the utilization of Markov chains to mitigate the cold start problem. Secondly, it introduces a hybrid recommendation model called HMGR for location-based recommendations, which effectively enhances the accuracy of suggestions. We evaluate the efficacy of the Markov chain and HMGR model through extensive experimentation. The results demonstrate that the implementation of Markov chains successfully alleviates the cold start problem, and our HMGR model significantly improves the precision of recommendations. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Method and system of power load classification and decomposition based on deep learning 4

Method and system of power load classification and decomposi...

引用

4th International Conference on Smart Grid and Energy Engineering, SGEE 2023

作者： Sun, Hao Yuan, Hongtai Geng, Yudong Chen, Jing Zhang, Chuanfu Li, Wen Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350359619

This paper introduces a system for the classification and decomposition of electrical loads, addressing the shortcomings of current non-intrusive load decomposition methods that are prone to errors. We propose a method that first classifies electrical loads and then performs decomposition, along with the corresponding system workflow. Initially, we collect household electricity consumption data using a proprietary load collection device developed by the company, constructing an electrical load dataset. Subsequently, we train classification and decomposition methods using this dataset, conducting comparative experiments with various methods to select the most effective one. Based on the trained electrical load classification and decomposition models, we develop an electrical load inference program. The key implementation lies in applying the electrical load classification and decomposition inference program to edge devices. Leveraging the cloud server hosting a backend web service for the mobile app, we interact with users through the app, achieving precise decomposition and monitoring of electrical loads. Integrating edge computing and cloud computing, coupled with a mobile app serving as the interaction platform, this paper presents a high-precision, simplified, and highly scalable solution for electrical load analysis and management. In experimental comparisons, we find that using the Gated Recurrent Unit (GRU) method from deep learning and the Sequence-to-Point Neural network (Seq2point) method outperform other methods in classification and decomposition, significantly improving the accuracy of electrical load classification. Therefore, we select the GRU method and Seq2Point method as the core techniques for the electrical load classification and decomposition system. This system not only demonstrates significant advantages in performance but also possesses high accuracy, model simplification, and scalability, providing an efficient and reliable solution for elec

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Lithological Facies Classification Using Attention-Based Gated Recurrent Unit

引用

Tsinghua Science and Technology 2024年第4期29卷 1206-1218页

作者： Yuwen Liu Yulan Zhang Xingyuan Mao Xucheng Zhou Jingwen Chang Wenwei Wang Pan Wang Lianyong Qi College of Computer Science and Technology China University of Petroleum(East China)Qingdao 266580China Shandong Provincial University Laboratory for Protected Horticulture Weifang University of Science and TechnologyShouguang 262700China School of Mechanical Electrical and Information EngineeringShandong UniversityWeihai 264209China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of JinanJinan 250022China School of Modern Posts Nanjing University of Posts and TelecommunicationsNanjing 210023China

Lithological facies classification is a pivotal task in petroleum geology, underpinning reservoir characterization and influencing decision-making in exploration and production operations. Traditional classification methods, such as support vector machines and Gaussian process classifiers, often struggle with the complexity and nonlinearity of geological data, leading to suboptimal performance. Moreover, numerous prevalent approaches fail to adequately consider the inherent dependencies in the sequence of measurements from adjacent depths in a well. A novel approach leveraging an attention-based gated recurrent unit (AGRU) model is introduced in this paper to address these challenges. The AGRU model excels by exploiting the sequential nature of well-log data and capturing long-range dependencies through an attention mechanism. This model enables a flexible and context-dependent weighting of different parts of the sequence, enhancing the discernment of key features for classification. The proposed method was validated on two publicly available datasets. Results demonstrate a considerably improvement over traditional methods. Specifically, the AGRU model achieved superior performance metrics considering precision, recall, and F1-score.

关键词： attention mechanism facies classification GRU MLP(multilayer perceptron)

来源：评论

学校读者我要写书评

暂无评论

Differentially Private and Heterogeneity-Robust Federated Learning With Theoretical Guarantee

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 6369-6384页

作者： Wang, Xiuhua Wang, Shuai Li, Yiwei Fan, Fengrui Li, Shikang Lin, Xiaodong Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China University of Guelph School of Computer Science GuelphONN1G 2W1 Canada

Federated learning (FL) is a popular distributed paradigm where enormous clients collaboratively train a machine learning (ML) model under the orchestration of a central server without knowing the clients' private raw data. The development of effective FL algorithms faces multiple practical challenges including data heterogeneity and clients' privacy protection. Despite that numerous attempts have been made to deal with data heterogeneity or rigorous privacy protection, none have effectively tackled both issues simultaneously. In this article, we propose a differentially private and heterogeneity-robust FL algorithm, named DP-FedCVR to mitigate the data heterogeneity by following the client-variance-reduction strategy. Besides, it adopts a sophisticated differential privacy (DP) mechanism where the privacy-amplified strategy is applied, to achieve a rigorous privacy protection guarantee. We show that the proposed DP-FedCVR algorithm maintains its heterogeneity-robustness though DP noises are incorporated, while achieving a sublinear convergence rate for a nonconvex FL problem. Numerical experiments based on image classification tasks are presented to demonstrate that DP-FedCVR provides superior performance over the benchmark algorithms in the presence of data heterogeneity and various DP privacy budgets. © 2020 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Intermittent Fault Diagnosis of Split-Star networks and its Applications

引用

IEEE Transactions on Parallel and Distributed Systems 2023年第4期34卷 1253-1264页

作者： Song, Jiankang Lin, Limei Huang, Yanze Hsieh, Sun-Yuan Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou Fujian350117 China Fujian University of Technology School of Computer Science and Mathematics Fuzhou Fujian350118 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid increase of the number of processors in multiprocessor systems and the fast expansion of interconnection networks, the reliability of interconnection network is facing severe challenges, where the fast recognition of fault processors is crucial. In practice, most of the processor failures are intermittent faults. In this article, we first determine the intermittent fault diagnosability t I PMC(S n 2) tIPMC(Sn2) of n-dimensional split-star network Sn2 under the PMC model. In addition, we propose a fast intermittent fault probabilistic diagnosis algorithm FIFPDPMC to identify the nodes with intermittent fault in the n-dimensional split-star network Sn2 under the PMC model, and we calculated the time complexity of the algorithm FIFPDPMC. Then we implement the algorithm FIFPDPMC in the IoT-based wireless sensor network (IoTWSN) and a randomly generated network (RGN) under different number of nodes with intermittent fault, and we evaluate the performance and efficiency of the algorithm FIFPDPMC in terms of accuracy, precision, recall (TPR), F1, G-mean, FPR, TNR and FNR. Experimental results show that, as the number of stages of executing the algorithm FIFPDPMC increases, the number of nodes with intermittent fault being diagnosed by the algorithm FIFPDPMC increases, which implies that the algorithm FIFPDPMC has good performance and efficiency in both IoTWSN and RGN. © 1990-2012 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

High-Level Security Dimension Evaluation of Blockchain BaaS System and key Technology

引用

China Communications 2024年第6期21卷 176-191页

作者： Chen Wanfa Zheng Qing’an Chen Shuzhen Fu Hongyi Chen Liang Fujian Police College Fuzhou 350007China Computer Science and Information Security Management Department Fujian Police CollegeFuzhou 350007China Fujian Province Key Laboratory for Digital Network Crime Supervision and Prevention Fuzhou 350007China Beijing University of Posts and Telecommunications Beijing 100876China Fujian Provincial Prison Administration Fuzhou 350002China

In recent years,blockchain technology integration and application has gradually become an important driving force for new technological innovation and industrial *** blockchain technology and applications are developing rapidly,the emerging security risks and obstacles have gradually become *** can still find security issues in blockchain systems and conduct attacks,causing increasing losses from network attacks every *** response to the current demand for blockchain application security detection and assessment in all industries,and the insufficient coverage of existing detection technologies such as smart contract detectiontechnology,this paper proposes a blockchain core technology security assessment system model,and studies the relevant detection and assessment key technologies and systems.A security assessment scheme based on a smart contract and consensus mechanism detection scheme is *** the underlying blockchain architecture supports the traceability of detection results using super ***,the functionality and performance of the system were tested,and the test results show that the model and solutions proposed in this paper have good feasibility.

关键词： blockchain security consensus mechanis smart contract

来源：评论

学校读者我要写书评

暂无评论

Causal Prompting: Debiasing Large Language Model Prompting Based on Front-Door Adjustment 39

Causal Prompting: Debiasing Large Language Model Prompting B...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Zhang, Congzhi Zhang, Linhai Wu, Jialong He, Yulan Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Department of Informatics King’s College London United Kingdom The Alan Turing Institute United Kingdom

ISBN: (纸本)157735897X

Despite the notable advancements of existing prompting methods, such as In-Context Learning and Chain-of-Thought for Large Language Models (LLMs), they still face challenges related to various biases. Traditional debiasing methods primarily focus on the model training stage, including approaches based on data augmentation and reweighting, yet they struggle with the complex biases inherent in LLMs. To address such limitations, the causal relationship behind the prompting methods is uncovered using a structural causal model, and a novel causal prompting method based on front-door adjustment is proposed to effectively mitigate LLMs biases. In specific, causal intervention is achieved by designing the prompts without accessing the parameters and logits of LLMs. The chain-of-thought generated by LLM is employed as the mediator variable and the causal effect between input prompts and output answers is calculated through front-door adjustment to mitigate model biases. Moreover, to accurately represent the chain-of-thoughts and estimate the causal effects, contrastive learning is used to fine-tune the encoder of chain-of-thought by aligning its space with that of the LLM. Experimental results show that the proposed causal prompting approach achieves excellent performance across seven natural language processing datasets on both open-source and closed-source LLMs. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Multilingual Knowledge Graph Completion via Multimodal Decouple and Relation-based Ensemble Inference 29

Multilingual Knowledge Graph Completion via Multimodal Decou...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Liu, Xiaojing Jiang, Xuesong Yi, Fengge Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

The objective of Multimodal Knowledge Graph Completion (MKGC) is to forecast absent entities within a knowledge graph by leveraging additional textual and visual modalities. Existing studies commonly utilize a singular relationship embedding to depict all modalities within an entity pair, thus connecting several relationships derived from diverse modalities. However, this coupling may introduce interference from conflicting information between modalities, as the relationships between modalities for a given entity pair can be contradictory. Moreover, existing Ensemble Inference methods fail to dynamically adjust modal weights based on their differences and importance, despite the varying contributions of different modalities. In this paper, we propose the Multimodal Decouple and Relation-based Ensemble inference (MDRE) model. For each modality, we construct corresponding relationship embeddings and build separate triple representations to avoid interferences among modalities. During the training phase, we employ confidence-constrained training with temperature scaling to alleviate conflicting information in textual and visual modalities. For inference, we utilize the Relation-based Ensemble Inference method to adjust modal weights at the relationship level, thus achieving improved prediction results. Experimental results on two datasets demonstrate that MDRE outperforms existing single-modal and multimodal knowledge graph completion methods in terms of performance. © 2023 IEEE.

关键词： knowledge graph knowledge graph completion multimodal fusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：