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

SSRN 2024年

作者： Huang, Yang Pi, Yueyang Shi, Yiqing Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China College of Photonic and Electronic Engineering Fujian Normal University Fuzhou350007 China

Graph convolutional network have significant advantages in tasks dealing with graph-structured data, but most existing approaches based on graph convolutional network usually potentially assume that nodes belonging to the same class in a graph tend to form edges, yet inter-class edges exist in many real graph-structured data. Due to the propagation mechanism of graph convolutional network, it is usually difficult to avoid the aggregation of interference information of nodes from different classes, leading to the inclusion of noise and irrelevant information in the results, thus affecting the performance of the model. We propose a new framework to address this issue, which can extend graph convolutional network to heterophilous graph-structured data. The proposed method has two main parts: Firstly, from the perspective of feature space, the heterophily of the graph-structured data is modeled so that the model can adaptively change the information propagation process according to the homophily of the edges, and mitigate the influence of inter-class information on the model. Secondly, the implicit node interaction information is captured through the feature space, which is then fused with the original interaction information to aggregate sufficient intra-class information. Extensive experiments on real-world datasets demonstrate the competitiveness of our approach among current state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Automatic Text Summarization Based on Transformer and Switchable Normalization

Automatic Text Summarization Based on Transformer and Switch...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Tao Luo Kun Guo Hong Guo College of Mathematics and Computer Sciences Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

With the development of text summarization research, the methods based on RNN with the Encoder-Decoder model gradually become the mainstream. However, RNN tends to forget previous context information and leads to the lack of original information. That will reduce the accuracy of the generated summarizations. The Transformer model uses the self-attention mechanism to encode and decode historical information so that it can achieve better performance than RNN in learning context information. In this paper, a text summarization model based on transformer and switchable normalization is proposed. The accuracy of the model is improved by optimizing the normalization layer. Compared with other models, the new model has a great advantage in understanding words' semantics and associations. Experimental results in English Gigaword dataset show that the proposed model can achieve high ROUGE values and make the summarization more readable.

关键词： Decoding Switches Context modeling Vocabulary Task analysis data mining Semantics

来源：评论

学校读者我要写书评

暂无评论

Ascl: Accelerating Semi-Supervised Learning Via Contrastive Learning

SSRN

引用

SSRN 2024年

作者： Liu, Haixiong Li, Zuoyong Wu, Jiawei Zeng, Kun Hu, Rong Zeng, Wei Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science Minjiang University Fuzhou350121 China School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University Guangdong Shenzhen518107 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Physics and Mechanical and Electrical Engineering Longyan University Longyan364012 China

SSL(Semi-supervised learning) is widely used in machine learning, which leverages labeled and unlabeled data to improve model performance. SSL aims to optimize class mutual information, but noisy pseudo-labels introduce false class information due to the scarcity of labels. Therefore, these algorithms often need significant training time to refine pseudo-labels for performance improvement iteratively. To tackle this challenge, we propose a novel plug-and-play method named ASCL(Accelerating Semi-Supervised Learning via Contrastive Learning). This method combines contrastive learning with uncertainty-based selection for performance improvement and accelerates the convergence of SSL algorithms. Contrastive learning initially emphasizes the mutual information between samples as a means to decrease dependence on pseudo-labels. Subsequently, it gradually turns to maximizing the mutual information between classes, aligning with the objective of semi-supervised learning. Uncertainty-based selection provides a robust mechanism for acquiring pseudo-labels. The combination of the contrastive learning module and the uncertainty-based selection module forms a virtuous cycle to improve the performance of the proposed model. Extensive experiments demonstrate that ASCL outperforms state-of-the-art methods in terms of both convergence efficiency and performance. In the experimental scenario where only one label is assigned per class in the CIFAR-10 dataset, the application of ASCL to Pseudo-label, UDA (Unsupervised data Augmentation for Consistency Training), and Fixmatch benefits substantial improvements in classification accuracy. Specifically, the results demonstrate notable improvements in respect of 16.32%, 6.9%, and 24.43% when compared to the original outcomes. Moreover, the required training time is reduced by almost 50%. © 2024, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Few-shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and Knowledge Distillation

arXiv

引用

arXiv 2023年

作者： Jiang, Chengjia Wang, Tao Li, Sien Wang, Jinyang Wang, Shirui Antoniou, Antonios Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Engineering European University Cyprus Nicosia Cyprus

We address the problem of learning new classes for semantic segmentation models from few examples, which is challenging because of the following two reasons. Firstly, it is difficult to learn from limited novel data to capture the underlying class distribution. Secondly, it is challenging to retain knowledge for existing classes and to avoid catastrophic forgetting. For learning from limited data, we propose a pseudo-labeling strategy to augment the few-shot training annotations in order to learn novel classes more effectively. Given only one or a few images labeled with the novel classes and a much larger set of unlabeled images, we transfer the knowledge from labeled images to unlabeled images with a coarse-to-fine pseudo-labeling approach in two steps. Specifically, we first match each labeled image to its nearest neighbors in the unlabeled image set at the scene level, in order to obtain images with a similar scene layout. This is followed by obtaining pseudo-labels within this neighborhood by applying classifiers learned on the few-shot annotations. In addition, we use knowledge distillation on both labeled and unlabeled data to retain knowledge on existing classes. We integrate the above steps into a single convolutional neural network with a unified learning objective. Extensive experiments on the Cityscapes and KITTI datasets validate the efficacy of the proposed approach in the self-driving domain. Code is available from https://***/ChasonJiang/FSCILSS. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and Knowledge Distillation

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-...

引用

Information Science, Parallel and Distributed Systems (ISPDS), International Conference on

作者： Chengjia Jiang Tao Wang Sien Li Jinyang Wang Shirui Wang Antonios Antoniou Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China The Key Laboratory of Cognitive Computing and Intelligent Information Processing Fujian Education Institutions Wuyi University Wuyishan China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Engineering European University Cyprus Nicosia Cyprus

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mixed Word Embedding Method Based on Knowledge Graph Augment for Text Classification

Mixed Word Embedding Method Based on Knowledge Graph Augment...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Hongzhong Wang Kun Guo Zhanghui Liu Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

This paper presents a self-training word embedding text classification model based on knowledge graph expansion for text classification. Current mixed word embedding methods are overly dependent on the Fasttext pre-training model and here is still a problem of missing words with rich semantic information are not mapped. First, we propose a method for extracting missing nouns based on shape near word filtering. Second, we design a self-training word embedding method based on knowledge graph that mixes with pre-training word embedding to obtain a high-quality mixed word vector with rich semantics and rich semantics. Third, we designed a GRU model based on improved mixed word embedding to improve the quality of text classification. Experiments conducted on multiple text classification datasets demonstrate that our methods can effectively improve the text classification accuracy.

关键词： Text categorization Context modeling Feature extraction Training Task analysis Predictive models

来源：评论

学校读者我要写书评

暂无评论

Financial Big data Hot and Cold Separation Scheme Based on HBase and Redis

Financial Big Data Hot and Cold Separation Scheme Based on H...

引用

IEEE International Conference on Big data and Cloud computing (BdCloud)

作者： Kunhui Li Kun Guo Hong Guo Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

In the era of big data, HBase has been widely used in scenarios of massive unstructured data. For the financial big data, due to the integrity and timing of it, unreasonable data storage and management usually lead to hot spots that decreases the query performance. In practice, the separation of hot and cold financial data will improve data query performance and utilization rate of cluster resources. In this paper, a hot and cold data separation scheme is designed, to store infrequently queried financial data to HBase, and frequently queried one to Redis. The cold data is reasonably planned and managed through pre-partitioning and row key design for HBase. A hot data cache based on Redis is realized to improve the query speed and reduces the pressure of HBase. In addition, due to the lack of Redis's inherent cache elimination strategy, we propose a caching strategy based on the frequencies of updating and querying operations. The experimental results show that the scheme can effectively avoid the hot storage problem, and improve the query performance, and improve the cache hit ratio of Redis. Therefore, the number of cold data access requests can be effectively reduced.

关键词： Big data Distributed databases Memory Time series analysis Stock markets

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

Label Distribution Learning with Correlation Information

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Lin, Yaojin Guo, Wenzhong Ding, Weiping College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Zhangzhou363000 China School of Information Science and Technology Nantong University Nantong226019 China

Label distribution learning quantifies the label space for each instance and has widely applicability in different fields. However, most existing works primarily focus on label correlation, but they still have a limitation in capturing instance correlation. Meanwhile, traditional label distribution learning operates on individual labels sequentially, leading to limitation in applying common features. Therefore, in this paper, we propose a novel approach for label distribution learning with correlation information i.e. instance correlation and label correlation. Specifically, the instance correlation and label correlation are identified by an optimization function and Pearson correlation coefficient, respectively. Besides, we conduct $\ell_{2,1}-$norm regularization to exploit common features. Comprehensive experiments manifest the superiority of our proposed approach against other well-established label distribution learning algorithms. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Global stability of the periodic solution of the three level food chain model with extinction of top predator

arXiv

引用

arXiv 2021年

作者： Cheng, Kaijen You, Hongming Yang, Ting-Hui School of Mathematics and Statistics Zhaoqing University Guangdong Zhaoqing526061 China College of Mathematics and Computer Science Quanzhou Normal University Quanzhou362000 China Department of Mathematics Tamkang University No. 151 Yingzhuan Road Tamsui Dist. New Taipei City25137 Taiwan Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing School of Mathematics and Computer Science Quanzhou Normal University Quanzhou China

In this work, we revisit the classical Holling type II three species food chain model from a different viewpoint. Two critical parameters λ1 and λ2 dependent on all parameters are defined. The existence and local stabilities of all equilibria can be reformulated by λ1 and λ2, and the complete classifications of parameters and its corresponding dynamics are given. Moreover, with the extinction of top-predator, there is an invariant two dimensional subsystem containing the prey and the intermediate predator. We prove the global stability of the boundary equilibrium in 3+ by differential inequality as well as Butler-McGehee lemma if it is stable. Alternatively, there is a unique limit cycle when the boundary equilibrium lost its stability, and we also show the global stability of the limit cycle in 3+ by differential inequality and computing the Floquet Multipliers. Finally, some interesting numerical simulations, the chaotic and the bi-stability phenomena, are presented numerically. A brief discussion and biological implications are also *** Codes 92D25 Copyright © 2021, The Authors. All rights reserved.

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：