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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

VLSI multilayer obstacle-avoiding Steiner minimal tree construction algorithms in X-architecture

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 2015年第3期27卷 523-532页

作者： Liu, Genggeng Guo, Wenzhong Chen, Guolong College of Mathematics and Computer Sciences Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China

Steiner minimal tree is a fundamental model in VLSI routing. Further considering X-architecture, the presence of obstacles, and the requirements of multilayer routing, this paper presented an efficient algorithm based on particle swarm optimization for constructing the multilayer obstacle-avoiding X-architecture Steiner minimal tree. Edge transformation was designed to make the particles have the greater ability to change the topology of the routing tree and avoided the obstacles. The new operators combined with union-find set were designed to prevent the generation of the loops. In order to avoid obstacle and discourage the generation of vias, the penalty function related to obstacle-avoiding and vias was proposed. The proposed algorithm finally optimizes the total cost of routing tree which is the most important optimization target of the multilayer routing. The experimental results show that, the proposed algorithm is effective and superior to state-of-the-art multilayer routing algorithms on the total cost. ©, 2015, Institute of computing Technology. All right reserved.

关键词： Multilayers

来源：评论

学校读者我要写书评

暂无评论

A weighted lexicon-based generative model for opinion retrieval

A weighted lexicon-based generative model for opinion retrie...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Xiang-Wen Liao Hu Chen Jing-Jing Wei Zhi-Yong Yu Guo-Long Chen Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9781479942145

In recent years, opinion retrieval attracted a growing research interest as online users' opinions become more and more valuable for market survey, political polls, etc. The goal of opinion retrieval is to find relevant and opinionate documents according to a user's query. Compared with previous lexicon-based generative model for opinion retrieval considering that the sentiment words are equal for a query, which cannot reflect different sentiment words' relevant opinion strength, we propose a graph-based approach by using HITS model to capture the sentiment words' relevant opinion strength. Then the weights are incorporated into the weighted lexicon-based generative model for opinion retrieval. Experimental results on two datasets show the effectiveness of the proposed generative model. Compared with the baseline approach, improvements of 4% and 11% have been obtained on two real datasets.

关键词： Computational modeling Twitter Analytical models Abstracts

来源：评论

学校读者我要写书评

暂无评论

A heterogeneous graph model for social opinion detection 13

A heterogeneous graph model for social opinion detection

引用

13th International Conference on Machine Learning and Cybernetics, ICMLC 2014

作者： Liao, Xiangwen Huang, Yichao Wei, Jingjing Yu, Zhiyong Chen, Guolong College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China College of Physics and Information Engineering Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

ISBN: (纸本)9783662456514

Microblogging services, such as Twitter, have become popular for people to share their opinions towards a broad range of topics. It is a great challenge to get an overview of some important topics by reading all tweets every day. Previous researches such as opinion detection and opinion summarization have been studied for this problem. However, these works mainly focus on the content of text without taking the quality of short text and features of social media into consideration. In this paper, we propose a heterogeneous graph model for users’ opinion detection on microblog. We first extract keywords of topics. Then, a three-level microblog graph is constructed by combining user influence, word importance, post significance, and topic periodicity. Microblog posts are ranked from different topics by using the random walk algorithm. Experimental results on real a dataset validate the effectiveness of our approach. In comparison with baseline approaches, the proposed method achieves 8% improvement. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

IDENTIFYMIX: AN EFFICIENT TWO-STAGE LEARNING APPROACH TO COMBATING LABEL NOISE

Journal of Applied and Numerical Optimization

引用

Journal of Applied and Numerical Optimization 2023年第2期5卷 237-253页

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

Deep neural networks require correct label annotation during supervised learning. It is inevitable, however, that some labels are noisy during the labeling process. A deep neural network retains incorrect labels during training, resulting in a degradation of performance. Therefore, it is essential to identify samples with potentially correct labels. In state-of-the-art methods, small-loss samples are chosen for subsequent training through a sample selection strategy. Howerver, it typically ignores the imbalance in noise ratios between mini-batches when performing sample selection within each minibatch. Further, numerous valuable samples with high losses are discarded, which adversely affects the generalization performance of the model, particularly under conditions of high noise ratios. To this end, this paper proposes IdentifyMix, an effective two-stage learning approach for noisy robust learning that combines an unique sample selection strategy and the semi-supervised learning technique. By observing how the dynamics of network training are changing, AUM (Area Under the Margin) provides a criterion that is applied in this research to identify mislabeled data. Moreover, by combining semi-supervised learning with contrastive learning and data augmentation, it is possible to extract more useful information from mislabeled samples. Experiments on several synthetic and real-world noise benchmarks demonstrate the effectiveness of IdentifyMix compared with state-of-the-art methods. © 2023 Journal of Applied and Numerical Optimization.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-based Multi-task Network for intelligent Management of Garbage Deposit Points

Deep Learning-based Multi-task Network for Intelligent Manag...

引用

IEEE International Symposium on information (IT) in Medicine and Education, ITME

作者： Yezhen Wang Haobin Zheng Changjiang Mao Jing Zhang Xiao Ke College of Computer and Data Science Fuzhou University Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou

ISBN: (纸本)9781728194202

With the economic and social development and the substantial improvement of material conditions, the generation of domestic waste has grown rapidly and has become a constraint factor for the development of new urbanization. In the past few years, research on the domestic waste industry has been limited to intelligent waste sorting, neglecting the role of intelligent management of waste storage sites. To relieve it, We propose a deep learning-based multi-task network for intelligent management of garbage deposit points, which combines algorithms such as YoloV5,Deepsort, Insightface, and Openpose to achieve waste bin detection, waste bin status recognition and analysis, face recognition, action recognition, and multiple object tracking based on real-time surveillance video. Besides, we propose a new dataset named Waste Bin Status, which provides a meaningful addition to the existing field of waste bin identification. Experiments on WBS dataset validate that our method is superior to other methods for garbage point status identification. Moreover, our network is trained to work with different scenarios of garbage deposits, demonstrating state-of-the-art performance in real-world tests.

关键词： Industries Face recognition Surveillance Education Streaming media Multitasking Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Graph Computation Model with Communication Equilibrium 15th

A Two-Stage Graph Computation Model with Communication Equil...

引用

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Dong, Yanmei Chen, Rongwang Guo, Kun College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China College of Mathematics and Computer Science Wuyi University Wuyishan Fujian354300 China Digital Fujian Tourism Big Data Institute Wuyishan Fujian354300 China

ISBN: (纸本)9789811625398

Distributed graph computing aims at performing in-depth analysis on large networks in a parallel manner. Iterative communication computation is an important model to perform graph analysis. Moreover, high-efficiency iterative communication computation is necessary for assuring the quality of graph partitioning. Many strategies to improve graph computing are usually based on the hypothesis of single communication iteration which focuses on the optimization of load balance in a single graph partitioning and the improvement of parallel granularity or communication manners. However, a graph in the real-world usually requires complex communication iterations to achieve good analysis results, which often have the problems of data and communication tilting and low analysis efficiency. In this paper, we propose a two-stage graph computing model with communication equilibrium (TSMCE). The model employs a communication-equilibrated graph partitioning strategy (CEGP) for load balancing and a two-stage graph computing mode (TS) to reduce the crossing-partition communication. With the change of graph density, various factors such as load balancing, communication balancing, cross-partition transmission traffic, communication delay, and convergence speed can always maintain an efficient balance. The experiments conducted on the real-world datasets show that the communication-equilibrated graph partitioning strategy can divide a graph with high quality compared with Hash and Metis. Besides, the overall performance of our two-stage graph computing model with communication equilibrium is higher than that of the BSP model. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Mobile Crowd-Sensing System Based on Participant Selection 15th

Mobile Crowd-Sensing System Based on Participant Selection

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Tu, Chunyu Han, Lei Wang, Leye Yu, Zhiyong College of Mathematics and Computer Science 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 and Information Sharing Ministry of Education Fuzhou China Key Lab of High Confidence Software Technologies Peking University Beijing China

ISBN: (纸本)9783030642426

Mobile Crowdsensing (MCS) is often accompanied by various adverse objectives when performing data collection, which makes it difficult to collect accurate data of the entire target area with low cost. Therefore, how to collect a small part of the data to accurately infer the other data of the entire target area is a crucial issue. People’s daily trajectories usually follow a certain pattern, for example, students go to school, company employees go to work. This pattern allows us to find participants who often pass through fixed areas within a certain time span, leading their collected partial data are near optimal for the entire data collection task. This paper models the problem and develops multiple methods to improve the participant selection and the data recovery. Particularly, we use a random method, reinforcement learning, and greedy algorithm to handle this problem and compare the differences among these methods by experiments. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A forensics tool of Foxmail client

A forensics tool of Foxmail client

引用

International Conference on Systems and Informatics (ICSAI)

作者： Lili Xie Guolong Chen College of Mathematics and Computer Science Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781479954599

Computer forensics is an important part of the computer crime investigation. So a Forensics system aimed to Foxmail data analysis and investigation is proposed in this paper. The system can index the email data based on Lucene technology and the MMSeg participle algorithm, and provides the full text retrieval of the email content function. Subsequently, a visual communication graph would be generated according to the retrieval results. Based on the communication graph, an algorithm on graphic structure analysis is proposed, and by means of centrality and minimum traffic filtering method, multilevel analysis is carried out on the graph, which can detect the possible suspicious personnel and their relationships and provide strong support for the computer crime investigation.

关键词： Electronic mail Forensics Postal services Indexes Filtering Personnel Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：