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

arXiv 2024年

作者： 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 Laboratory of the Key Laboratory of Symbolic Computation and Knowledge Engineering 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 S2 (scaling & 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. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Ensemble Classifier Design Based on Perturbation Binary Salp Swarm Algorithm for Classification

引用

Computer Modeling in engineering & Sciences 2023年第4期135卷 653-671页

作者： Xuhui Zhu Pingfan Xia Qizhi He Zhiwei Ni Liping Ni School of Management Hefei University of TechnologyHefei230009China School of Statistics Zhejiang Gongshang UniversityHangzhou310018China Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of EducationHefei230009China Collaborative Innovation Center for Statistical Data Engineering Technology and Application ZhejiangGongshang UniversityHangzhou310018China

Multiple classifier system exhibits strong classification capacity compared with single classifiers,but they require significant computational *** ensemble system aims to attain equivalent or better classification accuracy with fewer ***,current methods fail to identify precise solutions for constructing an ensemble *** this study,we propose an ensemble classifier design technique based on the perturbation binary salp swarm algorithm(ECDPB).Considering that extreme learning machines(ELMs)have rapid learning rates and good generalization ability,they can serve as the basic classifier for creating multiple candidates while using fewer computational ***,we introduce a combined diversity measure by taking the complementarity and accuracy of ELMs into account;it is used to identify the ELMs that have good diversity and low *** addition,we propose an ECDPB with powerful optimizing ability;it is employed to find the optimal subset of *** selected ELMs can then be used to forman ensemble *** on 10 benchmark datasets have been conducted,and the results demonstrate that the proposed ECDPB delivers superior classification capacity when compared with alternative methods.

关键词： Ensemble classifier salp swarmalgorithm diversity measure multiple classifiers system extreme learning machine

来源：评论

学校读者我要写书评

暂无评论

Meta-path Enhanced knowledge Graph Convolutional Network for Recommender Systems 12

Meta-path Enhanced Knowledge Graph Convolutional Network for...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Wang, Ru Wu, Meng Ji, Shengwei Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Ministry of Education School of Computer Science and Information Engineering Hefei China

ISBN: (纸本)9781665438582

knowledge Graph (KG) is a directed heterogeneous information network that contains a large number of entities and relations, which is widely used as effective side information in rec-ommender systems. Moreover, in recommender systems, the Graph Convolutional Network (GCN) model is introduced to mine the relatedness between entities in a KG because of its efficiency in extracting spatial features on topological graphs. The knowledge Graph Convolutional Network (KGCN) model up-dates the embedding of a currently positioned entity by aggregating the information of adjacent entities selected randomly. Never-theless, it has two limititations: 1) the information of neighbors se-lected randomly cannot accurately represent the current entity in the KG;2) the model is hard to converge as graph features (i.e. The spatial relation features and semantic information features of en-tities in the KG) grow. To solve these limitations, in this paper, a meta-path (i.e., a sequence of artificially constructed relationships) is introduced into the selection of neighbors in the KGCN model to enhance the representation of each entity. Furthermore, two construction methods of the meta-path - constructing a meta-path based on the same relation (KGCN-SP) and the characteris-tics of KG (KGCN-MP) -are proposed. The experiments based on three real-world datasets demonstrate that the neighbor selection based on the meta-path is able to collect more accurate infor-mation from a KG and improve the recommendation performance effectively. © 2021 IEEE.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

PromptGCN: Bridging Subgraph Gaps in Lightweight GCNs

arXiv

引用

arXiv 2024年

作者： Ji, Shengwei Tian, Yujie Liu, Fei Li, Xinlu Wu, Le The School of Artificial Intelligence and Big Data Hefei University Hefei China The School of Computer Science and Information Engineering Hefei University of Technology Hefei China The Key Laboratory of Knowledge Engineering with Big Data Ministry of Education China

Graph Convolutional Networks (GCNs) are widely used in graph-based applications, such as social networks and recommendation systems. Nevertheless, large-scale graphs or deep aggregation layers in full-batch GCNs consume significant GPU memory, causing out of memory (OOM) errors on mainstream GPUs (e.g., 29GB memory consumption on the Ogbn-products graph with 5 layers). The subgraph sampling methods reduce memory consumption to achieve lightweight GCNs by partitioning the graph into multiple subgraphs and sequentially training GCNs on each subgraph. However, these methods yield gaps among subgraphs, i.e., GCNs can only be trained based on subgraphs instead of global graph information, which reduces the accuracy of GCNs. In this paper, we propose PromptGCN, a novel prompt-based lightweight GCN model to bridge the gaps among subgraphs. First, the learnable prompt embeddings are designed to obtain global information. Then, the prompts are attached into each subgraph to transfer the global information among subgraphs. Extensive experimental results on seven large-scale graphs demonstrate that PromptGCN exhibits superior performance compared to baselines. Notably, PromptGCN improves the accuracy of subgraph sampling methods by up to 5.48% on the Flickr dataset. Overall, PromptGCN can be easily combined with any subgraph sampling method to obtain a lightweight GCN model with higher accuracy. Copyright © 2024, The Authors. All rights reserved.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A Two Dimensional Feature engineering Method for Relation Extraction 5

A Two Dimensional Feature Engineering Method for Relation Ex...

引用

5th International Conference on Control, Robotics, and Intelligent System, CCRIS 2024

作者： Wang, Hao Chen, Yanping Yang, Weizhe Lin, Chuan Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry Huaxi District Guizhou China State Key Laboratory of Public Big Data Huaxi District Guizhou China Guizhou University Huaxi District Guizhou China

ISBN: (数字)9781510685871

ISBN: (纸本)9781510685864

Transforming a sentence into a 2D representation, similar to table structures, reveals a semantic plane where elements can represent potential relations between paired entities. The 2D representation effectively addresses the common issue of overlapping relations. However, previous works directly transformed the representation from raw input, neglecting the utilization of prior knowledge, which is essential to support the entity relation extraction task. In this paper, we propose a 2D feature engineering method. The method innovatively integrates prior knowledge within 2D sentence representations, marking an advancement over previous strategies, and employs an attention mechanism to build the hitherto overlooked association between entities and prior knowledge. The fusion of prior knowledge and targeted attention enhances the model’s relational discernment capabilities. Evaluations on three benchmark datasets—ACE05 Chinese, ACE05 English, and CLTC—demonstrate the efficacy of the proposed method. It surpasses existing techniques, achieving state-of-the-art performance with F1 score improvements of 0.88%, 3.27%, and 2.83% respectively. The results indicate that 2D feature engineering can take advantage of a 2D sentence representation and make full use of prior knowledge. © 2024 SPIE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Controlled-source electromagnetic noise attenuation via a deep convolutional neural network and high-quality sounding curve screening mechanism

引用

Geophysics 2025年第3期90卷 WA125-WA140页

作者： Liu, Yecheng Li, Diquan Li, Jin Zhang, Xian Central South University Monitoring Ministry of Education Key Laboratory of Metallogenic Prediction of Nonferrous Metals and Geological Environment Changsha China Hunan Provincial Key Laboratory of Non-ferrous Resources and Geological Hazard Detection Changsha China Central South University School of Geoscience and Info-physics Changsha China Hunan Normal University College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha China Hunan University of Finance and Economics School of Information Technology and Management Hunan Provincial Key Laboratory of Finance & Economics Big Data Science and Technology Changsha China

Strong noise is one of the biggest challenges in controlled-source electromagnetic (CSEM) exploration, which severely affects the quality of the recorded signal. We develop a novel and effective CSEM noise attenuation method that integrates a deep convolutional neural network (DCNN) with a high-quality sounding curve screening mechanism. This method first uses a DCNN to learn the large-scale noise characteristics of CSEM measured data and build a DCNN denoising model for attenuating the noise. Because some impulse noise remains after DCNN denoising, the high-quality sounding curve screening mechanism is innovatively applied to optimize the DCNN denoised data. The core of this method is the smoothness value (SV), which quantitatively evaluates the smoothness of the sounding curve (apparent resistivity curve). In effect, the mechanism segments the overall DCNN denoised data and calculates the corresponding sounding curve and its SV for each segment. The highest-quality sounding curve can be screened out by comparing the SVs of all curves as well as obtaining the highest-quality data segment present in the overall DCNN denoised data. Finally, our method is validated with synthetic and field data, demonstrating its feasibility and effectiveness in attenuating large-scale CSEM noise. The quality of CSEM data, which is heavily affected by noise, is significantly improved after processing by our method. © 2025 Society of Exploration Geophysicists. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parameter Update: Alleviating Imbalance Impacts for Distributed Deep Learning 24

Hybrid Parameter Update: Alleviating Imbalance Impacts for D...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Li, Hongliang Xu, Dong Xu, Zhewen Li, Xiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China

ISBN: (纸本)9798350319934

Nowadays, data parallelism has been widely applied to train large datasets on distributed deep learning clusters, but it has suffered from costly global parameter updates at batch barriers. Performance imbalance among worker instances, introduced by uneven workload partitioning or biased resource allocation, can cause straggly workers, which can lead to severe impacts on both training speed and result accuracy. This paper studies the issue focusing on the tradeoff between training speed and result accuracy. We propose Cooperate Grouping Parallel (CGP), a hybrid parameter update solution that allows the flexibility of both synchronous and asynchronous update schemes. We introduce a novel Cooperate Worker Grouping Problem (CWGP) that seeks a task grouping configuration that leads to maximum model accuracy and holds customized training speed guarantees. We propose an evolution-based Pareto local searching algorithm to compute efficient worker grouping configurations. Comprehensive evaluation results are presented to demonstrate the effectiveness of CGP under both persistent and fluctuant imbalances. The proposed method alleviates the imbalance impacts without introducing extra adjustment over-heads. © 2022 IEEE.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Structure-Based Uncertainty Estimation for Source-Free Active Domain Adaptation

引用

IET Computer Vision 2025年第1期19卷

作者： Ouyang, Jihong Zhang, Zhengjie Meng, Qingyi Chi, Jinjin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Active domain adaptation (active DA) provides an effective solution by selectively labelling a limited number of target samples to significantly enhance adaptation performance. However, existing active DA methods often struggle in real-world scenarios where, due to data privacy concerns, only a pre-trained source model is available, rather than the source samples. To address this issue, we propose a novel method called the structure-based uncertainty estimation model (SUEM) for source-free active domain adaptation (SFADA). To be specific, we introduce an innovative active sample selection strategy that combines both uncertainty and diversity sampling to identify the most informative samples. We assess the uncertainty in target samples using structure-wise probabilities and implement a diversity selection method to minimise redundancy. For the selected samples, we not only apply standard-supervised loss but also conduct interpolation consistency training to further explore the structural information of the target domain. Extensive experiments across four widely used datasets demonstrate that our method is comparable to or outperforms current UDA and active DA methods. © 2025 The Author(s). IET Computer Vision published by John Wiley & Sons Ltd on behalf of The Institution of engineering and Technology.

关键词： computer vision convolutional neural nets image classification

来源：评论

学校读者我要写书评

暂无评论

TERMS: Task management policies to achieve high performance for mixed workloads using surplus resources

引用

Journal of Parallel and Distributed Computing 2022年第0期170卷 74-85页

作者： Yu, Jinyu Tong, Wei Lv, Pengze Feng, Dan Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology School of Computer Science and Technology Huazhong University of Science and Technology Ministry of Education of China Hubei Wuhan China

Resource contentions and performance interferences can lead to workload performance degradation in mixed-workload deployment clusters. Previous work guarantees the resource requirements of latency-sensitive tasks and reduces performance losses to batch jobs by reclaiming surplus resources from over-provisioned tasks. While the fragmentation of resources leads to a mismatch between provisioned resources and task requirements, resulting in high operation overheads and losses of task fairness. This paper proposes TERMS, the task management policies based on task relevance, resource distribution, and task fairness to achieve efficient and low-cost task management. TERMS mainly includes three types of management policies. The task scheduling policy can schedule new tasks according to task relevance. Task selection strategies select tasks for resource provisioning and task resumption based on resource requirements and task fairness. If necessary, the node selection strategy can be used to choose befitting target nodes based on task relevance and node resource information for task migration when eliminating straggler tasks. Evaluation results show that TERMS can further improve the performance of latency-sensitive services and batch jobs, reduce management overheads, and avoid operation failures. © 2022 Elsevier Inc.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Spatial-temporal graph attention network for traffic flow forecasting 5

Spatial-temporal graph attention network for traffic flow fo...

引用

2022 5th International Conference on Advanced Algorithms and Control engineering, ICAACE 2022

作者： Wang, Ling Jia, Gaofeng School of Automation and Electrical Engineering Key Laboratory of Knowledge Automation for Industrial Processes Ministry of Education University of Science and Technology Beijing Beijing100083 China

Traffic flow forecasting is one of the most challenging tasks in intelligent transportation system, which is very important and critical for many traffic services. Although there are existing works on forecasting the future traffic flow, the majority of them have certain limitations on modelling spatial-temporal correlations: they usually use different modules for spatial and temporal dependencies, and lack abilities of utilizing the historical periodic data. In order to overcome these problems, a novel Spatial-Temporal Graph Attention network (STGAT) is proposed. Considering the periodic characteristic of traffic data, the raw data is transformed into a three-dimensional tensor corresponded to the weekly period and recent period before inputting into the STGAT model. The random walk theory is used to construct a localized spatial-temporal graph to model the spatial-temporal dependencies, and an elaborately designed spatial-temporal graph attention mechanism is used to synchronously capture the complex spatial-temporal dynamic correlations. By calculating the similarity of spatial-temporal features of weekly and recent period input, the model integrates the periodic features into the target. Experimental results on two public real-world datasets demonstrate that STGAT achieves superior performance and consistently outperforms other baselines. © Published under licence by IOP Publishing Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：