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

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： You, Jinpeng Lin, Yanghao Lin, Dazhen Cao, Donglin Artificial Intelligence Department Xiamen University Xiamen361005 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China

ISBN: (纸本)9789819923557

In recent years, short video platforms have become the main source of online rumors. According to the statistics of Shanghai online rumor refutation platform in 2021, the number of short video rumors was about five times that of short video rumors in 2020, which makes it necessary to detect rumors of short videos. At present, short video rumor detection has the problem of multi-modal information fusion, the traditional multi-modal fusion uses deep learning to obtain the underlying features of multi-modality and then aggregate them into cross-modal features. However, there are distortions of theme and tampering with key-frame in rumor videos. Therefore, short video rumors need to learn features from the perspective of theme and key-frame. Aiming at the problem of multi-modal information fusion of short video rumors, this paper proposes a short video rumor detection model (TKCM) based on theme and key-frame. It uses aggregation network to obtain the theme feature of video, attention network to obtain the key-frame feature, and fuses multi-modality by modal adjustment mechanism for short video rumor detection. Experimental results show that the F1 score of the proposed method on the short video rumor dataset is improved by 2%–5% compared with some state-of-the-art video classification models. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Meta-path and Meta-schema Hierarchical Aggregation for Heterogeneous Graph Neural networks

Meta-path and Meta-schema Hierarchical Aggregation for Heter...

引用

Smart World Congress (SWC), IEEE

作者： Ling Wu Pingping Gao Kun Guo Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Sciencen (Fuzhou University) China

ISBN: (数字)9798331520861

ISBN: (纸本)9798331520878

With deep learning’s advancement in recent years, heterogeneous graph neural networks (HGNNs) have drawn a lot of interest. They are a group of deep learning models specifically designed for handling heterogeneous graph data, in which nodes and edges are of various types and all nodes are assumed to have either direct or indirect associations. A metaschema, which serves as a thorough and unified blueprint for the heterogeneous graph, elegantly connects varied node types to other heterogeneous nodes via multiple heterogeneous edges with rich sematincs. However, many existing methods that utilize meta-schema to mine heterogeneous information often focus on the different meta-relationships inside the schema, limiting the meta-schema to describing only the local relational semantics. To better utilize meta-schema for efficiently integrating different heterogeneous information, we organize them into a hierarchical structure(i.e., hierarchical meta-schema), with all types of nodes distributed across different layers. The layers are interconnected through heterogeneous relationships. The target type is placed at the final layer and others are arranged hierarchically in the front according to the heterogeneous relationships defined in the meta-schema. During information aggregation, according to the hierarchical meta-schema, the information of each layer is gradually aggregated to the target type on the final layer from far to near via the attention mechanism. Moreover, metapaths regularly begin and end with the same type and help to define complex structures and semantic. Therefore, we also consider the semantic information of neighbors based on metapaths within the proposed hierarchical meta-schema to enhance the complex semantics among nodes of the same-type that may be lacking in the meta-schema. Finally, we proposed a meta-path and meta-schema hierarchical aggregation for heterogeneous graph neural network model, named HGNN-MMHA. And we may allow the meta-schema to not

关键词： Deep learning Correlation Limiting Attention mechanisms Semantics Graph neural networks Heterogeneous networks Data models

来源：评论

学校读者我要写书评

暂无评论

A Unified Stream and Batch Graph computing Model for Community Detection 17th

A Unified Stream and Batch Graph Computing Model for Commu...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Dai, Jinkun Wu, Ling Guo, Kun Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer and Data Science Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819923557

An essential challenge in graph data analysis and mining is to simply and effectively deal with large-scale network data that is expanding dynamically. Although batch-based parallel graph computation frameworks have better accuracy, they cannot process incremental data on time and need to be recomputed. To process real-time data, stream processing applications need to be redeveloped, which increases the redundancy of work, and some existing dynamic graph computation schemes are not generalizable. This paper proposes a unified stream and batch graph computing model(USBGM). The model is compatible with both stream and batch graph computing. Graph operators and algorithms developed based on the model can handle stream and batch graph data in a unified manner. The experiments on real-world and artificial networks verified the effectiveness and efficiency of the model. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

DDoS Detection and Defense Based on FLAD and SDN 20

DDoS Detection and Defense Based on FLAD and SDN

引用

20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Dong, Jie Fang, Wenyu Zheng, Wanling Liu, Jinkun Liu, Yanhua College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China

ISBN: (纸本)9798350356328

In order to achieve more efficient and accurate DDoS detection while ensuring data privacy, this paper proposes a DDoS detection method based on FLAD. Firstly, this paper uses the FLAD algorithm to train a global DDoS detection model without leaving local traffic data, protecting the privacy and security of traffic data between different hosts, and improving aggregation efficiency by dynamically adjusting the aggregation weights to adapt to different sub-dataset increments. Secondly, a DDoS traffic detection method based on the integration of LSTM and CNN is proposed, which extracts and analyzes the temporal correlation of traffic data by calculating the statistical characteristics of traffic data within a time period, to achieve real-time detection of traffic feature data. Again, combined with the concept of SDN, real-time defense against DDoS based on ODL-API is implemented, and precise matching of DDoS detection results with network entity information is achieved, realizing the technology of real-time and precise issuance of multiple flow rules, effectively blocking DDoS malicious attack traffic, protecting important entities in the topology, and maintaining stable traffic in the topology. This paper focuses on solving the detection problem of DDoS traffic data increments and uneven data distribution through the FLAD algorithm. Experimental results show that the proposed method improves the accuracy of DDoS attack detection by more than 4% and the F1 Score by more than 7% compared to the FedAvg aggregation algorithm. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Generalized Self-Adaption network for Domain Adaptation 2

Generalized Self-Adaption Network for Domain Adaptation

引用

2nd International Conference on Artificial Intelligence and intelligent information processing, AIIIP 2023

作者： Bian, Yongheng Ke, Xiao College of Computer and Data Science Fuzhou University Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou350116 China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou350003 China

ISBN: (纸本)9798350371451

The purpose of domain adaptation is to transfer knowledge learned in the labeled source domain to unlabeled but related target domains without requiring a large number of target domain labels. The latest method of domain adaptation mainly adjusts the distribution of the source and target domains to adapt to the target domain. Despite significant success, when there are significant distribution differences between the source and target domains, the adaptability in the target domain still decreases, which may be due to insufficient exploration of domain specific features leading to domain offset issues. To address this issue, we propose the GSA-NET framework in this article. We designed an adversarial dropout method to improve the generalization performance of the model in the target domain by pushing the decision boundary away from the feature dense region. At the same time, in order to effectively match the distribution of advanced features across domains, we deploy feature adaptation modules before the classification layer, which can significantly reduce domain differences. Our experiments on two cross domain benchmarks, Office Home and Office-31, have shown that the proposed method is significantly superior to existing methods. © 2023 IEEE.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

A Cloud computing User Experience Focused Load Balancing Method Based on Modified CMA-ES Algorithm 18th

A Cloud Computing User Experience Focused Load Balancing Met...

引用

18th International Conference on Green, Pervasive, and Cloud computing, GPC 2023

作者： Luo, Jihai Dong, Chen Chen, Zhenyi Xu, Li Chen, Tianci College of Computer and Data Science - Fuzhou University Xueyuan Road Fujian Fuzhou360108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Department of Computer Science and Engineering University of South Florida TampaFL33620 United States College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China

ISBN: (纸本)9789819998951

The development of the software and hardware has brought about the abundance and overflow of computing resources. Many Internet companies can lease idle computing resources based on the peak and valley cycles of usage load to provide IaaS service. After the surging development, more and more companies are gradually paying attention to the specific user experience in cloud computing. But there are few works about that aspect in load balance problem. Therefore, we consider the load balancing resource allocation problem, from the perspective of user experience, mainly based on geographical distance and regional Equilibrium, combined with user usage habits, in multiple service periods. A detailed mathematical definition has been established for this problem. This article proposes a mathematical model for the problem, along with an modified CMA-ES (Covariance Matrix Adaptation Evolution Strategy) algorithm, called WS-ESS-CMA-ES algorithm, to allocate computing resources and solve the above problem. The process of using the proposed algorithm to solve the problem of cloud computing resource allocation in real scenarios is simulated, and compared with some other algorithms. The experiment results show that our algorithm performs well. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Globally Consistent Vertical Federated Graph Autoencoder for Privacy-Preserving Community Detection 17th

Globally Consistent Vertical Federated Graph Autoencoder for...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Fang, Yutong Huang, Qingqing Ye, Enjie Guo, Wenzhong Guo, Kun Chen, Xiaoqi Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer and Data Science/College of Software Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819923557

Community detection is a trendy area in research on complex network analysis and has a wide range of real-world applications, like advertising. As people become increasingly concerned about privacy, protecting participants’ privacy in distributed community detection has become a new challenge. When applied to not identically and independently distributed (Non-IID) data, most federated graph algorithms suffer from the weight divergence problem caused by diversified training of local and global models, resulting in accuracy degradation. Furthermore, the privacy protection approaches based on anonymization, such as differential privacy (DP), and cryptography, such as homomorphic encryption (HE), incur accuracy loss and high time consumption, respectively. In this paper, we propose a globally consistent vertical federated graph autoencoder (GCVFGAE) algorithm, which builds a globally consistent model among the coordinator and all participants to solve the Non-IID graph data problem. As well, an attribute blinding strategy based on security aggregation is developed to protect the network privacy of each participant without losing accuracy. Both real-world and artificial networks’ experiments show that our algorithm reaches higher accuracy than the existing vertical federated graph neural networks (GNNs) and the simple distributed graph autoencoder without federated learning and detects communities identical to those found by the standard graph autoencoder (GAE). © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

Horizontal Federated Traffic Speed Prediction Base on Secure Node Attribute Aggregation 17th

Horizontal Federated Traffic Speed Prediction Base on Secur...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Ye, Enjie Guo, Kun Guo, Wenzhong Chen, Dangrun Zhang, Zihan Li, Fuan Zheng, JiaChen Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer and Data Science/College of Software Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819923847

Federated graph learning has been widely used in distributed graph machine learning tasks. The data distribution of existing graph-based federated Spatio-temporal prediction methods is mainly segmented by graph topology. However, in the real-world Spatio-temporal traffic speed prediction task, a location will have data from different devices belonging to different companies. A node may have multi-party information in the real-world distributed traffic speed prediction scenario. The difference in multi-party information leads to the information not being fully utilized. Moreover, the direct transmission of node embedding in the federated learning process may also risk privacy leaks. Using homomorphic encryption and other encryption methods will bring a high computational overhead. Therefore we propose a new distributed privacy-preserving traffic speed prediction algorithm, which uses secure node attribute aggregation strategy(SNAAS) to apply to the multi-party collaborative traffic speed prediction scenario when the graph topology structure is public. At the same time, secret sharing technology is used in SNAAS to protect the attribute matrix and reduce the overhead of secret computing. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Variable projection algorithms with sparse constraint for separable nonlinear models

引用

Control Theory and Technology 2024年第1期22卷 135-146页

作者： Hui-Lang Xu Guang-Yong Chen Si-Qing Cheng Min Gan Jing Chen College of Computer and Data Science Fuzhou UniversityFuzhou350116FujianChina Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350116FujianChina Key Laboratory of Intelligent Metro of Universities in Fujian Fuzhou UniversityFuzhou350116FujianChina Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou UniversityFuzhou350116FujianChina School of Science Jiangnan UniversityWuxi214122JiangsuChina

Separable nonlinear models are widely used in various fields such as time series analysis, system modeling, and machine learning, due to their flexible structures and ability to capture nonlinear behavior of data. However, identifying the parameters of these models is challenging, especially when sparse models with better interpretability are desired by practitioners. Previous theoretical and practical studies have shown that variable projection (VP) is an efficient method for identifying separable nonlinear models, but these are based on \(L_2\) penalty of model parameters, which cannot be directly extended to deal with sparse constraint. Based on the exploration of the structural characteristics of separable models, this paper proposes gradient-based and trust-region-based variable projection algorithms, which mainly solve two key problems: how to eliminate linear parameters under sparse constraint;and how to deal with the coupling relationship between linear and nonlinear parameters in the model. Finally, numerical experiments on synthetic data and real time series data are conducted to verify the effectiveness of the proposed algorithms.

关键词： Variable projection(VP) Non-smooth constraint Separable nonlinear models

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Context Modeling for Road Obstacle Detection 1

引用

4th International Conference on Machine Learning for Cyber Security, ML4CS 2022

作者： Wu, Xiuen Wang, Tao Liang, Lingyu Li, Zuoyong Ching, Fum Yew College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou350108 China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan354300 China School of Electronic and Information Engineering South China University of Technology Guangzhou510641 China Ministry of Education Key Laboratory of Computer Network and Information Integration Southeast University Nanjing211189 China Guangzhou510320 China Penang11800 Malaysia

ISBN: (数字)9783031200960

ISBN: (纸本)9783031200953

Road obstacle detection is an important problem for vehicle driving safety. In this paper, we aim to obtain robust road obstacle detection based on spatio-temporal context modeling. Firstly, a data-driven spatial context model of the driving scene is constructed with the layouts of the training data. Then, obstacles in the input image are detected via the state-of-the-art object detection algorithms, and the results are combined with the generated scene layout. In addition, to further improve the performance and robustness, temporal information in the image sequence is taken into consideration, and the optical flow is obtained in the vicinity of the detected objects to track the obstacles across neighboring frames. Qualitative and quantitative experiments were conducted on the Small Obstacle Detection (SOD) dataset and the Lost and Found dataset. The results indicate that our method with spatio-temporal context modeling is superior to existing methods for road obstacle detection. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：